./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for termination
Using default analysis
Version c00e63dc
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/recursified_loop-simple/recursified_nested_3.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-06 19:49:57,778 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-06 19:49:57,818 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf
[2025-02-06 19:49:57,825 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-06 19:49:57,825 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-06 19:49:57,825 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG
[2025-02-06 19:49:57,852 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-06 19:49:57,856 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-06 19:49:57,856 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-06 19:49:57,856 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-06 19:49:57,856 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-06 19:49:57,857 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-06 19:49:57,857 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-06 19:49:57,857 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-06 19:49:57,857 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2025-02-06 19:49:57,857 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2025-02-06 19:49:57,857 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2025-02-06 19:49:57,857 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2025-02-06 19:49:57,857 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2025-02-06 19:49:57,857 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2025-02-06 19:49:57,857 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-06 19:49:57,858 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2025-02-06 19:49:57,858 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-06 19:49:57,858 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-06 19:49:57,861 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-06 19:49:57,861 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-06 19:49:57,861 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2025-02-06 19:49:57,861 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2025-02-06 19:49:57,862 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2025-02-06 19:49:57,862 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-02-06 19:49:57,862 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-06 19:49:57,862 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-06 19:49:57,862 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2025-02-06 19:49:57,862 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-06 19:49:57,862 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-06 19:49:57,862 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-06 19:49:57,862 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-06 19:49:57,862 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-06 19:49:57,862 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-06 19:49:57,862 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2025-02-06 19:49:57,862 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 -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985
[2025-02-06 19:49:58,135 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-06 19:49:58,140 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-06 19:49:58,142 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-06 19:49:58,143 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-06 19:49:58,143 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-06 19:49:58,143 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c
[2025-02-06 19:49:59,228 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bee838d38/560224f8428c46cfbcd31a40692f5e2f/FLAGfd0e8caa8
[2025-02-06 19:49:59,447 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-06 19:49:59,447 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c
[2025-02-06 19:49:59,454 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bee838d38/560224f8428c46cfbcd31a40692f5e2f/FLAGfd0e8caa8
[2025-02-06 19:49:59,796 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bee838d38/560224f8428c46cfbcd31a40692f5e2f
[2025-02-06 19:49:59,798 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-06 19:49:59,800 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-06 19:49:59,802 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-06 19:49:59,802 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-06 19:49:59,805 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-06 19:49:59,805 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:49:59" (1/1) ...
[2025-02-06 19:49:59,806 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610d14e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:59, skipping insertion in model container
[2025-02-06 19:49:59,806 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:49:59" (1/1) ...
[2025-02-06 19:49:59,816 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-06 19:49:59,917 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 19:49:59,926 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-06 19:49:59,944 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 19:49:59,959 INFO  L204         MainTranslator]: Completed translation
[2025-02-06 19:49:59,967 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:59 WrapperNode
[2025-02-06 19:49:59,967 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-06 19:49:59,967 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-06 19:49:59,968 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-06 19:49:59,968 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-06 19:49:59,971 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:59" (1/1) ...
[2025-02-06 19:49:59,977 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:59" (1/1) ...
[2025-02-06 19:49:59,985 INFO  L138                Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53
[2025-02-06 19:49:59,985 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-06 19:49:59,986 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-06 19:49:59,986 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-06 19:49:59,986 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-06 19:49:59,993 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:59" (1/1) ...
[2025-02-06 19:49:59,993 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:59" (1/1) ...
[2025-02-06 19:49:59,995 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:59" (1/1) ...
[2025-02-06 19:50:00,004 INFO  L175           MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 6, 6, 6]. 30 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 6 writes are split as follows [0, 2, 2, 2].
[2025-02-06 19:50:00,004 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:59" (1/1) ...
[2025-02-06 19:50:00,004 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:59" (1/1) ...
[2025-02-06 19:50:00,009 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:59" (1/1) ...
[2025-02-06 19:50:00,009 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:59" (1/1) ...
[2025-02-06 19:50:00,010 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:59" (1/1) ...
[2025-02-06 19:50:00,010 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:59" (1/1) ...
[2025-02-06 19:50:00,012 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-06 19:50:00,012 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-06 19:50:00,012 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-06 19:50:00,013 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-06 19:50:00,013 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:59" (1/1) ...
[2025-02-06 19:50:00,017 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:00,025 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:00,035 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)
[2025-02-06 19:50:00,043 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
[2025-02-06 19:50:00,060 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-06 19:50:00,060 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-06 19:50:00,060 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-02-06 19:50:00,060 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2025-02-06 19:50:00,060 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#3
[2025-02-06 19:50:00,060 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2025-02-06 19:50:00,060 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-02-06 19:50:00,060 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-02-06 19:50:00,060 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2025-02-06 19:50:00,060 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#3
[2025-02-06 19:50:00,060 INFO  L130     BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0
[2025-02-06 19:50:00,060 INFO  L138     BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0
[2025-02-06 19:50:00,061 INFO  L130     BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0
[2025-02-06 19:50:00,061 INFO  L138     BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0
[2025-02-06 19:50:00,061 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-06 19:50:00,061 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-06 19:50:00,061 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-02-06 19:50:00,061 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-02-06 19:50:00,061 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#2
[2025-02-06 19:50:00,061 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#3
[2025-02-06 19:50:00,061 INFO  L130     BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0
[2025-02-06 19:50:00,061 INFO  L138     BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0
[2025-02-06 19:50:00,061 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-02-06 19:50:00,127 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-06 19:50:00,128 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-06 19:50:00,269 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L81: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset;
[2025-02-06 19:50:00,303 INFO  L?                        ?]: Removed 9 outVars from TransFormulas that were not future-live.
[2025-02-06 19:50:00,303 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-06 19:50:00,314 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-06 19:50:00,314 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-06 19:50:00,314 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:50:00 BoogieIcfgContainer
[2025-02-06 19:50:00,314 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-06 19:50:00,315 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2025-02-06 19:50:00,315 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2025-02-06 19:50:00,318 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2025-02-06 19:50:00,319 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-06 19:50:00,319 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:49:59" (1/3) ...
[2025-02-06 19:50:00,321 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@173c0292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:50:00, skipping insertion in model container
[2025-02-06 19:50:00,321 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-06 19:50:00,321 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:49:59" (2/3) ...
[2025-02-06 19:50:00,321 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@173c0292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:50:00, skipping insertion in model container
[2025-02-06 19:50:00,321 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2025-02-06 19:50:00,321 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:50:00" (3/3) ...
[2025-02-06 19:50:00,322 INFO  L363   chiAutomizerObserver]: Analyzing ICFG recursified_nested_3.c
[2025-02-06 19:50:00,374 INFO  L306   stractBuchiCegarLoop]: Interprodecural is true
[2025-02-06 19:50:00,374 INFO  L307   stractBuchiCegarLoop]: Hoare is None
[2025-02-06 19:50:00,374 INFO  L308   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2025-02-06 19:50:00,374 INFO  L309   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2025-02-06 19:50:00,374 INFO  L310   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2025-02-06 19:50:00,374 INFO  L311   stractBuchiCegarLoop]: Difference is false
[2025-02-06 19:50:00,374 INFO  L312   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2025-02-06 19:50:00,374 INFO  L316   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2025-02-06 19:50:00,381 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-06 19:50:00,410 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:00,410 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:50:00,410 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:50:00,417 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-02-06 19:50:00,417 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:00,417 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2025-02-06 19:50:00,417 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-06 19:50:00,422 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:00,422 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:50:00,422 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:50:00,423 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-02-06 19:50:00,423 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:00,428 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-02-06 19:50:00,429 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-02-06 19:50:00,434 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:00,435 INFO  L85        PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 1 times
[2025-02-06 19:50:00,439 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:00,448 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497798458]
[2025-02-06 19:50:00,448 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:50:00,449 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:00,532 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:00,560 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:00,561 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:00,561 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:00,561 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:00,568 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:00,583 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:00,583 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:00,583 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:00,598 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:00,600 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:00,600 INFO  L85        PathProgramCache]: Analyzing trace with hash 880373472, now seen corresponding path program 1 times
[2025-02-06 19:50:00,600 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:00,601 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084046690]
[2025-02-06 19:50:00,601 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:50:00,602 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:00,612 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-02-06 19:50:00,623 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-02-06 19:50:00,623 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:00,623 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:00,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 19:50:00,874 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:50:00,874 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084046690]
[2025-02-06 19:50:00,875 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084046690] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 19:50:00,875 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 19:50:00,875 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-06 19:50:00,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738799055]
[2025-02-06 19:50:00,876 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 19:50:00,878 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:50:00,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:50:00,894 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 19:50:00,894 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-06 19:50:00,895 INFO  L87              Difference]: Start difference. First operand  has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand  has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2025-02-06 19:50:00,973 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:50:00,973 INFO  L93              Difference]: Finished difference Result 35 states and 43 transitions.
[2025-02-06 19:50:00,974 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions.
[2025-02-06 19:50:00,975 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:00,980 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 22 states and 26 transitions.
[2025-02-06 19:50:00,980 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 22
[2025-02-06 19:50:00,980 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 22
[2025-02-06 19:50:00,981 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions.
[2025-02-06 19:50:00,981 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:50:00,981 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions.
[2025-02-06 19:50:00,989 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions.
[2025-02-06 19:50:00,995 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2025-02-06 19:50:00,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5)
[2025-02-06 19:50:00,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions.
[2025-02-06 19:50:00,997 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions.
[2025-02-06 19:50:00,997 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 19:50:00,999 INFO  L432   stractBuchiCegarLoop]: Abstraction has 22 states and 26 transitions.
[2025-02-06 19:50:00,999 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2025-02-06 19:50:00,999 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions.
[2025-02-06 19:50:01,000 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:01,000 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:50:01,000 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:50:01,001 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-02-06 19:50:01,001 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:01,001 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-02-06 19:50:01,001 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-02-06 19:50:01,002 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:01,002 INFO  L85        PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 2 times
[2025-02-06 19:50:01,002 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:01,002 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950247189]
[2025-02-06 19:50:01,002 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:50:01,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:01,008 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:01,025 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:01,025 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-06 19:50:01,025 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:01,025 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:01,028 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:01,031 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:01,031 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:01,031 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:01,033 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:01,034 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:01,034 INFO  L85        PathProgramCache]: Analyzing trace with hash 1255189484, now seen corresponding path program 1 times
[2025-02-06 19:50:01,034 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:01,034 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623529898]
[2025-02-06 19:50:01,034 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:50:01,034 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:01,041 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-02-06 19:50:01,048 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-02-06 19:50:01,048 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:01,049 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:01,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-06 19:50:01,166 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:50:01,166 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623529898]
[2025-02-06 19:50:01,166 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623529898] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 19:50:01,166 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 19:50:01,166 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-06 19:50:01,166 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433799009]
[2025-02-06 19:50:01,166 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 19:50:01,167 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:50:01,167 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:50:01,167 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 19:50:01,167 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-06 19:50:01,167 INFO  L87              Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand  has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-06 19:50:01,215 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:50:01,215 INFO  L93              Difference]: Finished difference Result 24 states and 28 transitions.
[2025-02-06 19:50:01,215 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions.
[2025-02-06 19:50:01,216 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:01,217 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions.
[2025-02-06 19:50:01,217 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 24
[2025-02-06 19:50:01,217 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 24
[2025-02-06 19:50:01,217 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions.
[2025-02-06 19:50:01,217 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:50:01,217 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions.
[2025-02-06 19:50:01,217 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions.
[2025-02-06 19:50:01,218 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2025-02-06 19:50:01,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-02-06 19:50:01,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions.
[2025-02-06 19:50:01,219 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions.
[2025-02-06 19:50:01,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 19:50:01,220 INFO  L432   stractBuchiCegarLoop]: Abstraction has 24 states and 28 transitions.
[2025-02-06 19:50:01,220 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2025-02-06 19:50:01,220 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions.
[2025-02-06 19:50:01,221 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:01,221 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:50:01,221 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:50:01,221 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-02-06 19:50:01,221 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:01,221 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-02-06 19:50:01,221 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-02-06 19:50:01,222 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:01,222 INFO  L85        PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 3 times
[2025-02-06 19:50:01,222 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:01,222 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500994230]
[2025-02-06 19:50:01,222 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-06 19:50:01,222 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:01,227 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:01,230 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:01,230 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-02-06 19:50:01,230 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:01,231 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:01,232 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:01,234 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:01,234 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:01,235 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:01,236 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:01,237 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:01,237 INFO  L85        PathProgramCache]: Analyzing trace with hash -837946947, now seen corresponding path program 1 times
[2025-02-06 19:50:01,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:01,237 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63220527]
[2025-02-06 19:50:01,237 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:50:01,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:01,243 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-02-06 19:50:01,247 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-02-06 19:50:01,247 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:01,247 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:01,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-02-06 19:50:01,539 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:50:01,539 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63220527]
[2025-02-06 19:50:01,539 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63220527] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 19:50:01,539 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332637547]
[2025-02-06 19:50:01,539 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:50:01,539 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 19:50:01,539 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:01,546 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 19:50:01,546 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-06 19:50:01,588 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-02-06 19:50:01,612 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-02-06 19:50:01,612 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:01,612 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:01,614 INFO  L256         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 27 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:01,616 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:01,641 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1
[2025-02-06 19:50:01,809 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-02-06 19:50:01,809 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 19:50:02,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-02-06 19:50:02,178 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332637547] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 19:50:02,178 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 19:50:02,178 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24
[2025-02-06 19:50:02,178 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643532456]
[2025-02-06 19:50:02,178 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 19:50:02,178 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:50:02,178 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:50:02,178 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-02-06 19:50:02,179 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552
[2025-02-06 19:50:02,179 INFO  L87              Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand  has 24 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 20 states have internal predecessors, (35), 10 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11)
[2025-02-06 19:50:02,517 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:50:02,517 INFO  L93              Difference]: Finished difference Result 28 states and 32 transitions.
[2025-02-06 19:50:02,517 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions.
[2025-02-06 19:50:02,518 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:02,522 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions.
[2025-02-06 19:50:02,523 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 28
[2025-02-06 19:50:02,523 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 28
[2025-02-06 19:50:02,523 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions.
[2025-02-06 19:50:02,523 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:50:02,523 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions.
[2025-02-06 19:50:02,523 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions.
[2025-02-06 19:50:02,524 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2025-02-06 19:50:02,524 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8)
[2025-02-06 19:50:02,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions.
[2025-02-06 19:50:02,525 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions.
[2025-02-06 19:50:02,525 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-02-06 19:50:02,526 INFO  L432   stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions.
[2025-02-06 19:50:02,526 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2025-02-06 19:50:02,526 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions.
[2025-02-06 19:50:02,526 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:02,526 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:50:02,526 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:50:02,527 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-02-06 19:50:02,527 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:02,527 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-02-06 19:50:02,527 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-02-06 19:50:02,528 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:02,528 INFO  L85        PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 4 times
[2025-02-06 19:50:02,528 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:02,528 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942862553]
[2025-02-06 19:50:02,528 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-06 19:50:02,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:02,536 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes.
[2025-02-06 19:50:02,540 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:02,541 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-02-06 19:50:02,541 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:02,541 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:02,542 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:02,544 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:02,544 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:02,544 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:02,550 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:02,550 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:02,550 INFO  L85        PathProgramCache]: Analyzing trace with hash 364720792, now seen corresponding path program 2 times
[2025-02-06 19:50:02,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:02,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006515802]
[2025-02-06 19:50:02,550 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:50:02,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:02,558 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes.
[2025-02-06 19:50:02,571 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements.
[2025-02-06 19:50:02,571 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-06 19:50:02,571 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:02,999 INFO  L134       CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2025-02-06 19:50:02,999 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:50:02,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006515802]
[2025-02-06 19:50:02,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006515802] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 19:50:03,000 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552022609]
[2025-02-06 19:50:03,000 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:50:03,000 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 19:50:03,000 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:03,001 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 19:50:03,003 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-06 19:50:03,041 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes.
[2025-02-06 19:50:03,082 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements.
[2025-02-06 19:50:03,083 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-06 19:50:03,083 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:03,084 INFO  L256         TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 51 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:03,087 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:03,106 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1
[2025-02-06 19:50:03,266 INFO  L134       CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-02-06 19:50:03,266 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 19:50:03,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-02-06 19:50:03,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [552022609] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 19:50:03,921 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 19:50:03,921 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 14] total 26
[2025-02-06 19:50:03,921 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274818779]
[2025-02-06 19:50:03,921 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 19:50:03,922 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:50:03,922 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:50:03,922 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2025-02-06 19:50:03,922 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650
[2025-02-06 19:50:03,922 INFO  L87              Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand  has 26 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 22 states have internal predecessors, (44), 9 states have call successors, (16), 6 states have call predecessors, (16), 8 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17)
[2025-02-06 19:50:04,080 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:50:04,080 INFO  L93              Difference]: Finished difference Result 30 states and 34 transitions.
[2025-02-06 19:50:04,080 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions.
[2025-02-06 19:50:04,081 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:04,081 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions.
[2025-02-06 19:50:04,082 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 30
[2025-02-06 19:50:04,082 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 30
[2025-02-06 19:50:04,082 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions.
[2025-02-06 19:50:04,082 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:50:04,082 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions.
[2025-02-06 19:50:04,082 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions.
[2025-02-06 19:50:04,083 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2025-02-06 19:50:04,083 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9)
[2025-02-06 19:50:04,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions.
[2025-02-06 19:50:04,087 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions.
[2025-02-06 19:50:04,087 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-02-06 19:50:04,088 INFO  L432   stractBuchiCegarLoop]: Abstraction has 30 states and 34 transitions.
[2025-02-06 19:50:04,088 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 5 ============
[2025-02-06 19:50:04,088 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 34 transitions.
[2025-02-06 19:50:04,088 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:04,088 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:50:04,088 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:50:04,089 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-02-06 19:50:04,089 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:04,089 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-02-06 19:50:04,089 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-02-06 19:50:04,090 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:04,090 INFO  L85        PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 5 times
[2025-02-06 19:50:04,090 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:04,090 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966477060]
[2025-02-06 19:50:04,090 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-02-06 19:50:04,090 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:04,096 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:04,099 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:04,099 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-06 19:50:04,099 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:04,099 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:04,100 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:04,102 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:04,102 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:04,102 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:04,103 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:04,107 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:04,108 INFO  L85        PathProgramCache]: Analyzing trace with hash -1836767202, now seen corresponding path program 3 times
[2025-02-06 19:50:04,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:04,108 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644186209]
[2025-02-06 19:50:04,108 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-06 19:50:04,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:04,115 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 6 equivalence classes.
[2025-02-06 19:50:04,126 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 61 statements.
[2025-02-06 19:50:04,126 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-02-06 19:50:04,126 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:04,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked.
[2025-02-06 19:50:04,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:50:04,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644186209]
[2025-02-06 19:50:04,416 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644186209] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 19:50:04,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740836824]
[2025-02-06 19:50:04,416 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-06 19:50:04,416 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 19:50:04,416 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:04,441 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 19:50:04,442 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-06 19:50:04,508 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 6 equivalence classes.
[2025-02-06 19:50:04,530 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 36 of 61 statements.
[2025-02-06 19:50:04,531 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-02-06 19:50:04,531 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:04,532 INFO  L256         TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 41 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:04,535 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:04,540 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1
[2025-02-06 19:50:04,649 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked.
[2025-02-06 19:50:04,649 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 19:50:05,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked.
[2025-02-06 19:50:05,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [740836824] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 19:50:05,096 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 19:50:05,096 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 14] total 25
[2025-02-06 19:50:05,096 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481763551]
[2025-02-06 19:50:05,096 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 19:50:05,097 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:50:05,097 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:50:05,097 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2025-02-06 19:50:05,097 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600
[2025-02-06 19:50:05,097 INFO  L87              Difference]: Start difference. First operand 30 states and 34 transitions. cyclomatic complexity: 7 Second operand  has 25 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 21 states have internal predecessors, (32), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (13), 9 states have call predecessors, (13), 10 states have call successors, (13)
[2025-02-06 19:50:05,254 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:50:05,255 INFO  L93              Difference]: Finished difference Result 32 states and 36 transitions.
[2025-02-06 19:50:05,255 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions.
[2025-02-06 19:50:05,255 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:05,256 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions.
[2025-02-06 19:50:05,256 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 32
[2025-02-06 19:50:05,256 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 32
[2025-02-06 19:50:05,256 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions.
[2025-02-06 19:50:05,256 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:50:05,256 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions.
[2025-02-06 19:50:05,256 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions.
[2025-02-06 19:50:05,258 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2025-02-06 19:50:05,258 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 6 states have call successors, (6), 3 states have call predecessors, (6), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10)
[2025-02-06 19:50:05,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions.
[2025-02-06 19:50:05,258 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions.
[2025-02-06 19:50:05,258 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-06 19:50:05,259 INFO  L432   stractBuchiCegarLoop]: Abstraction has 32 states and 36 transitions.
[2025-02-06 19:50:05,259 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 6 ============
[2025-02-06 19:50:05,259 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions.
[2025-02-06 19:50:05,259 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:05,259 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:50:05,259 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:50:05,260 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-02-06 19:50:05,260 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:05,261 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-02-06 19:50:05,261 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-02-06 19:50:05,261 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:05,264 INFO  L85        PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 6 times
[2025-02-06 19:50:05,264 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:05,264 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872757225]
[2025-02-06 19:50:05,264 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-02-06 19:50:05,264 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:05,267 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:05,270 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:05,270 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s)
[2025-02-06 19:50:05,270 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:05,270 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:05,271 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:05,272 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:05,272 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:05,272 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:05,274 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:05,274 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:05,274 INFO  L85        PathProgramCache]: Analyzing trace with hash 1726358141, now seen corresponding path program 4 times
[2025-02-06 19:50:05,274 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:05,274 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022761986]
[2025-02-06 19:50:05,274 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-06 19:50:05,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:05,283 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 87 statements into 2 equivalence classes.
[2025-02-06 19:50:05,300 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-02-06 19:50:05,300 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-02-06 19:50:05,300 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:06,002 INFO  L134       CoverageAnalysis]: Checked inductivity of 333 backedges. 6 proven. 167 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked.
[2025-02-06 19:50:06,003 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:50:06,003 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022761986]
[2025-02-06 19:50:06,003 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022761986] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 19:50:06,003 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621804908]
[2025-02-06 19:50:06,003 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-06 19:50:06,003 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 19:50:06,003 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:06,006 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 19:50:06,007 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-02-06 19:50:06,075 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 87 statements into 2 equivalence classes.
[2025-02-06 19:50:06,126 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-02-06 19:50:06,126 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-02-06 19:50:06,126 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:06,129 INFO  L256         TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 72 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:06,134 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:06,144 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1
[2025-02-06 19:50:06,379 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13
[2025-02-06 19:50:06,381 INFO  L134       CoverageAnalysis]: Checked inductivity of 333 backedges. 234 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-06 19:50:06,382 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 19:50:07,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 333 backedges. 84 proven. 103 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked.
[2025-02-06 19:50:07,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621804908] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 19:50:07,711 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 19:50:07,711 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 18] total 29
[2025-02-06 19:50:07,711 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526080593]
[2025-02-06 19:50:07,711 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 19:50:07,711 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:50:07,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:50:07,712 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2025-02-06 19:50:07,712 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812
[2025-02-06 19:50:07,712 INFO  L87              Difference]: Start difference. First operand 32 states and 36 transitions. cyclomatic complexity: 7 Second operand  has 29 states, 22 states have (on average 2.090909090909091) internal successors, (46), 24 states have internal predecessors, (46), 9 states have call successors, (16), 7 states have call predecessors, (16), 10 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21)
[2025-02-06 19:50:07,887 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:50:07,888 INFO  L93              Difference]: Finished difference Result 34 states and 38 transitions.
[2025-02-06 19:50:07,888 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions.
[2025-02-06 19:50:07,888 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:07,889 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 38 transitions.
[2025-02-06 19:50:07,889 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 34
[2025-02-06 19:50:07,889 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 34
[2025-02-06 19:50:07,889 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 34 states and 38 transitions.
[2025-02-06 19:50:07,889 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:50:07,889 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 34 states and 38 transitions.
[2025-02-06 19:50:07,889 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34 states and 38 transitions.
[2025-02-06 19:50:07,893 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34.
[2025-02-06 19:50:07,894 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 34 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 9 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11)
[2025-02-06 19:50:07,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions.
[2025-02-06 19:50:07,894 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 34 states and 38 transitions.
[2025-02-06 19:50:07,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-06 19:50:07,895 INFO  L432   stractBuchiCegarLoop]: Abstraction has 34 states and 38 transitions.
[2025-02-06 19:50:07,895 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 7 ============
[2025-02-06 19:50:07,895 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 38 transitions.
[2025-02-06 19:50:07,895 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:07,895 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:50:07,895 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:50:07,896 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-02-06 19:50:07,896 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:07,897 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-02-06 19:50:07,897 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-02-06 19:50:07,897 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:07,897 INFO  L85        PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 7 times
[2025-02-06 19:50:07,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:07,897 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436652046]
[2025-02-06 19:50:07,897 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-02-06 19:50:07,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:07,901 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:07,904 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:07,904 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:07,904 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:07,904 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:07,905 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:07,906 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:07,906 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:07,906 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:07,908 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:07,908 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:07,908 INFO  L85        PathProgramCache]: Analyzing trace with hash 12245352, now seen corresponding path program 5 times
[2025-02-06 19:50:07,908 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:07,908 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375297516]
[2025-02-06 19:50:07,908 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-02-06 19:50:07,908 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:07,923 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 102 statements into 8 equivalence classes.
[2025-02-06 19:50:07,953 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 82 of 102 statements.
[2025-02-06 19:50:07,953 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s)
[2025-02-06 19:50:07,953 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:08,576 INFO  L134       CoverageAnalysis]: Checked inductivity of 519 backedges. 14 proven. 262 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked.
[2025-02-06 19:50:08,576 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:50:08,576 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375297516]
[2025-02-06 19:50:08,576 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375297516] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 19:50:08,576 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937463070]
[2025-02-06 19:50:08,576 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-02-06 19:50:08,576 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 19:50:08,576 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:08,579 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 19:50:08,582 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-02-06 19:50:08,645 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 102 statements into 8 equivalence classes.
[2025-02-06 19:50:08,722 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 82 of 102 statements.
[2025-02-06 19:50:08,722 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s)
[2025-02-06 19:50:08,722 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:08,724 INFO  L256         TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 81 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:08,728 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:08,754 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1
[2025-02-06 19:50:09,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 519 backedges. 363 proven. 32 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked.
[2025-02-06 19:50:09,020 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 19:50:11,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 519 backedges. 127 proven. 165 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked.
[2025-02-06 19:50:11,060 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [937463070] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 19:50:11,060 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 19:50:11,060 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 22] total 41
[2025-02-06 19:50:11,060 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745575136]
[2025-02-06 19:50:11,060 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 19:50:11,061 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:50:11,061 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:50:11,061 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2025-02-06 19:50:11,062 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1333, Unknown=0, NotChecked=0, Total=1640
[2025-02-06 19:50:11,062 INFO  L87              Difference]: Start difference. First operand 34 states and 38 transitions. cyclomatic complexity: 7 Second operand  has 41 states, 31 states have (on average 1.903225806451613) internal successors, (59), 35 states have internal predecessors, (59), 13 states have call successors, (20), 8 states have call predecessors, (20), 13 states have return successors, (25), 11 states have call predecessors, (25), 13 states have call successors, (25)
[2025-02-06 19:50:11,375 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:50:11,375 INFO  L93              Difference]: Finished difference Result 38 states and 42 transitions.
[2025-02-06 19:50:11,375 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions.
[2025-02-06 19:50:11,376 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:11,377 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 42 transitions.
[2025-02-06 19:50:11,377 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 38
[2025-02-06 19:50:11,377 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 38
[2025-02-06 19:50:11,377 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 38 states and 42 transitions.
[2025-02-06 19:50:11,378 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:50:11,378 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 38 states and 42 transitions.
[2025-02-06 19:50:11,378 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 38 states and 42 transitions.
[2025-02-06 19:50:11,379 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38.
[2025-02-06 19:50:11,379 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 11 states have return successors, (13), 11 states have call predecessors, (13), 4 states have call successors, (13)
[2025-02-06 19:50:11,380 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions.
[2025-02-06 19:50:11,380 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 38 states and 42 transitions.
[2025-02-06 19:50:11,383 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-02-06 19:50:11,383 INFO  L432   stractBuchiCegarLoop]: Abstraction has 38 states and 42 transitions.
[2025-02-06 19:50:11,383 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 8 ============
[2025-02-06 19:50:11,383 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions.
[2025-02-06 19:50:11,384 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:11,384 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:50:11,384 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:50:11,385 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-02-06 19:50:11,385 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:11,385 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-02-06 19:50:11,385 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-02-06 19:50:11,388 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:11,388 INFO  L85        PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 8 times
[2025-02-06 19:50:11,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:11,388 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165869766]
[2025-02-06 19:50:11,388 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:50:11,388 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:11,392 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:11,394 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:11,395 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-06 19:50:11,395 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:11,395 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:11,395 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:11,400 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:11,400 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:11,400 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:11,402 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:11,403 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:11,403 INFO  L85        PathProgramCache]: Analyzing trace with hash 1666695850, now seen corresponding path program 6 times
[2025-02-06 19:50:11,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:11,403 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095274893]
[2025-02-06 19:50:11,403 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-02-06 19:50:11,403 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:11,418 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 132 statements into 10 equivalence classes.
[2025-02-06 19:50:11,462 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 87 of 132 statements.
[2025-02-06 19:50:11,462 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s)
[2025-02-06 19:50:11,462 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:12,026 INFO  L134       CoverageAnalysis]: Checked inductivity of 1026 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked.
[2025-02-06 19:50:12,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:50:12,026 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095274893]
[2025-02-06 19:50:12,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095274893] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 19:50:12,026 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997352644]
[2025-02-06 19:50:12,026 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-02-06 19:50:12,027 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 19:50:12,027 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:12,029 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 19:50:12,030 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-02-06 19:50:12,115 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 132 statements into 10 equivalence classes.
[2025-02-06 19:50:12,215 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 87 of 132 statements.
[2025-02-06 19:50:12,216 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s)
[2025-02-06 19:50:12,216 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:12,218 INFO  L256         TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 51 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:12,222 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:12,230 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1
[2025-02-06 19:50:12,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked.
[2025-02-06 19:50:12,367 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 19:50:13,165 INFO  L134       CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked.
[2025-02-06 19:50:13,165 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997352644] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 19:50:13,165 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 19:50:13,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 18] total 35
[2025-02-06 19:50:13,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803827864]
[2025-02-06 19:50:13,165 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 19:50:13,165 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:50:13,165 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:50:13,166 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2025-02-06 19:50:13,166 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=957, Unknown=0, NotChecked=0, Total=1190
[2025-02-06 19:50:13,166 INFO  L87              Difference]: Start difference. First operand 38 states and 42 transitions. cyclomatic complexity: 7 Second operand  has 35 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 30 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 10 states have return successors, (18), 14 states have call predecessors, (18), 15 states have call successors, (18)
[2025-02-06 19:50:13,472 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:50:13,472 INFO  L93              Difference]: Finished difference Result 42 states and 46 transitions.
[2025-02-06 19:50:13,472 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 46 transitions.
[2025-02-06 19:50:13,477 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:13,477 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 46 transitions.
[2025-02-06 19:50:13,478 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 42
[2025-02-06 19:50:13,478 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 42
[2025-02-06 19:50:13,478 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions.
[2025-02-06 19:50:13,478 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:50:13,478 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 42 states and 46 transitions.
[2025-02-06 19:50:13,478 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions.
[2025-02-06 19:50:13,480 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42.
[2025-02-06 19:50:13,480 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 13 states have return successors, (15), 13 states have call predecessors, (15), 4 states have call successors, (15)
[2025-02-06 19:50:13,480 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions.
[2025-02-06 19:50:13,480 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 42 states and 46 transitions.
[2025-02-06 19:50:13,485 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-02-06 19:50:13,485 INFO  L432   stractBuchiCegarLoop]: Abstraction has 42 states and 46 transitions.
[2025-02-06 19:50:13,485 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 9 ============
[2025-02-06 19:50:13,485 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 46 transitions.
[2025-02-06 19:50:13,485 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:13,486 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:50:13,486 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:50:13,487 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-02-06 19:50:13,487 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [35, 35, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:13,487 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-02-06 19:50:13,487 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-02-06 19:50:13,489 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:13,489 INFO  L85        PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 9 times
[2025-02-06 19:50:13,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:13,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697942164]
[2025-02-06 19:50:13,489 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-06 19:50:13,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:13,499 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:13,501 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:13,501 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-02-06 19:50:13,501 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:13,501 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:13,506 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:13,507 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:13,507 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:13,507 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:13,509 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:13,509 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:13,513 INFO  L85        PathProgramCache]: Analyzing trace with hash 1452188514, now seen corresponding path program 7 times
[2025-02-06 19:50:13,514 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:13,514 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544988579]
[2025-02-06 19:50:13,514 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-02-06 19:50:13,514 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:13,537 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes.
[2025-02-06 19:50:13,594 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements.
[2025-02-06 19:50:13,594 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:13,594 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:14,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked.
[2025-02-06 19:50:14,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:50:14,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544988579]
[2025-02-06 19:50:14,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544988579] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 19:50:14,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64505537]
[2025-02-06 19:50:14,973 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-02-06 19:50:14,973 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 19:50:14,973 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:14,980 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 19:50:14,981 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-02-06 19:50:15,085 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes.
[2025-02-06 19:50:15,179 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements.
[2025-02-06 19:50:15,180 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:15,180 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:15,183 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 75 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:15,192 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:15,198 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1
[2025-02-06 19:50:15,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked.
[2025-02-06 19:50:15,486 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 19:50:17,211 INFO  L134       CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 2815 trivial. 0 not checked.
[2025-02-06 19:50:17,212 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [64505537] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 19:50:17,212 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 19:50:17,212 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 26] total 39
[2025-02-06 19:50:17,212 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753784854]
[2025-02-06 19:50:17,212 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 19:50:17,212 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:50:17,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:50:17,213 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2025-02-06 19:50:17,213 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=1163, Unknown=0, NotChecked=0, Total=1482
[2025-02-06 19:50:17,213 INFO  L87              Difference]: Start difference. First operand 42 states and 46 transitions. cyclomatic complexity: 7 Second operand  has 39 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 16 states have call successors, (17), 9 states have call predecessors, (17), 13 states have return successors, (24), 18 states have call predecessors, (24), 15 states have call successors, (24)
[2025-02-06 19:50:17,455 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:50:17,455 INFO  L93              Difference]: Finished difference Result 44 states and 48 transitions.
[2025-02-06 19:50:17,455 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions.
[2025-02-06 19:50:17,456 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:17,458 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 48 transitions.
[2025-02-06 19:50:17,459 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 44
[2025-02-06 19:50:17,459 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 44
[2025-02-06 19:50:17,459 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 44 states and 48 transitions.
[2025-02-06 19:50:17,459 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:50:17,459 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions.
[2025-02-06 19:50:17,459 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44 states and 48 transitions.
[2025-02-06 19:50:17,461 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44.
[2025-02-06 19:50:17,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 44 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 14 states have return successors, (16), 14 states have call predecessors, (16), 4 states have call successors, (16)
[2025-02-06 19:50:17,461 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions.
[2025-02-06 19:50:17,461 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions.
[2025-02-06 19:50:17,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-02-06 19:50:17,464 INFO  L432   stractBuchiCegarLoop]: Abstraction has 44 states and 48 transitions.
[2025-02-06 19:50:17,464 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 10 ============
[2025-02-06 19:50:17,464 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 48 transitions.
[2025-02-06 19:50:17,465 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2025-02-06 19:50:17,465 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:50:17,465 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:50:17,467 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2025-02-06 19:50:17,467 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:17,467 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< 
[2025-02-06 19:50:17,467 INFO  L754   eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-02-06 19:50:17,469 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:17,469 INFO  L85        PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 10 times
[2025-02-06 19:50:17,469 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:17,469 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534244846]
[2025-02-06 19:50:17,469 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-06 19:50:17,469 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:17,473 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes.
[2025-02-06 19:50:17,477 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:17,477 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-02-06 19:50:17,477 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:17,477 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:17,478 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:17,479 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:17,479 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:17,479 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:17,481 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:17,482 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:17,482 INFO  L85        PathProgramCache]: Analyzing trace with hash -791636088, now seen corresponding path program 8 times
[2025-02-06 19:50:17,482 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:17,482 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836451021]
[2025-02-06 19:50:17,482 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:50:17,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:17,509 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 255 statements into 2 equivalence classes.
[2025-02-06 19:50:17,602 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 255 of 255 statements.
[2025-02-06 19:50:17,602 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-06 19:50:17,602 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:17,602 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:17,615 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes.
[2025-02-06 19:50:17,666 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements.
[2025-02-06 19:50:17,667 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:17,667 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:17,696 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:17,698 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:17,699 INFO  L85        PathProgramCache]: Analyzing trace with hash -398289569, now seen corresponding path program 1 times
[2025-02-06 19:50:17,699 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:17,699 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62509495]
[2025-02-06 19:50:17,699 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:50:17,699 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:17,727 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes.
[2025-02-06 19:50:17,811 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements.
[2025-02-06 19:50:17,811 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:17,811 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:17,811 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:17,827 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes.
[2025-02-06 19:50:17,881 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements.
[2025-02-06 19:50:17,881 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:17,881 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:17,907 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:26,764 INFO  L204          LassoAnalysis]: Preferences:
[2025-02-06 19:50:26,765 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-02-06 19:50:26,765 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-02-06 19:50:26,765 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-02-06 19:50:26,765 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-02-06 19:50:26,765 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:26,765 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-02-06 19:50:26,765 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-02-06 19:50:26,765 INFO  L132   ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration10_Lasso
[2025-02-06 19:50:26,765 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-02-06 19:50:26,765 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-02-06 19:50:26,775 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:26,779 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:26,780 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:26,781 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:26,782 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:26,783 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:26,784 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:26,785 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:26,787 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:26,788 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:26,789 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:26,790 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:26,791 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:27,364 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:27,370 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:27,372 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:27,373 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:27,374 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:27,375 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:27,377 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:27,378 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:27,674 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-02-06 19:50:27,677 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-02-06 19:50:27,678 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:27,678 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:27,680 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)
[2025-02-06 19:50:27,682 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
[2025-02-06 19:50:27,684 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:27,696 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:27,696 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:27,697 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:27,697 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:27,697 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:27,699 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:27,699 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:27,701 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:27,709 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:27,710 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:27,710 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:27,716 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)
[2025-02-06 19:50:27,722 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
[2025-02-06 19:50:27,723 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:27,733 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:27,733 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:27,733 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:27,733 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:27,733 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:27,734 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:27,734 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:27,735 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:27,743 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:27,743 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:27,743 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:27,748 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)
[2025-02-06 19:50:27,749 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
[2025-02-06 19:50:27,750 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:27,760 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:27,760 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:27,760 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:27,760 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:27,760 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:27,761 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:27,761 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:27,762 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:27,768 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
[2025-02-06 19:50:27,768 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:27,768 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:27,774 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)
[2025-02-06 19:50:27,775 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
[2025-02-06 19:50:27,775 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:27,786 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:27,787 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:27,787 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:27,787 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:27,787 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:27,787 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:27,787 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:27,791 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:27,797 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
[2025-02-06 19:50:27,797 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:27,797 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:27,799 INFO  L229       MonitoredProcess]: Starting monitored process 13 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)
[2025-02-06 19:50:27,800 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process
[2025-02-06 19:50:27,801 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:27,812 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:27,812 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:27,813 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:27,813 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:27,813 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:27,813 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:27,813 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:27,814 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:27,823 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0
[2025-02-06 19:50:27,823 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:27,823 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:27,825 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)
[2025-02-06 19:50:27,826 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
[2025-02-06 19:50:27,827 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:27,837 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:27,837 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:27,837 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:27,837 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:27,837 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:27,838 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:27,838 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:27,839 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:27,844 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
[2025-02-06 19:50:27,845 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:27,845 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:27,846 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)
[2025-02-06 19:50:27,848 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
[2025-02-06 19:50:27,849 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:27,860 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:27,860 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:27,860 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:27,860 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:27,860 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:27,860 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:27,861 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:27,866 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:27,871 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:27,871 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:27,872 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:27,875 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)
[2025-02-06 19:50:27,877 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
[2025-02-06 19:50:27,878 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:27,888 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:27,888 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:27,888 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:27,888 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:27,888 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:27,889 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:27,889 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:27,892 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:27,898 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:27,898 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:27,898 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:27,900 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)
[2025-02-06 19:50:27,901 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
[2025-02-06 19:50:27,905 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:27,915 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:27,916 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:27,916 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:27,916 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:27,916 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:27,917 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:27,917 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:27,918 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:27,930 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
[2025-02-06 19:50:27,930 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:27,931 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:27,934 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)
[2025-02-06 19:50:27,935 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
[2025-02-06 19:50:27,937 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:27,948 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:27,948 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:27,948 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:27,948 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:27,948 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:27,948 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:27,948 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:27,951 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:27,957 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:27,957 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:27,957 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:27,959 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)
[2025-02-06 19:50:27,960 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
[2025-02-06 19:50:27,961 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:27,971 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:27,971 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:27,971 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:27,971 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:27,973 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:27,973 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:27,976 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:27,981 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:27,982 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:27,982 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:27,984 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)
[2025-02-06 19:50:27,985 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
[2025-02-06 19:50:27,985 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:27,995 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:27,995 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:27,995 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:27,995 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:27,998 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:27,998 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:28,000 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:28,006 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:28,006 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:28,006 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:28,008 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)
[2025-02-06 19:50:28,008 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
[2025-02-06 19:50:28,011 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:28,021 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:28,021 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:28,021 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:28,021 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:28,025 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:28,025 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:28,028 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:28,034 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
[2025-02-06 19:50:28,034 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:28,034 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:28,036 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)
[2025-02-06 19:50:28,037 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
[2025-02-06 19:50:28,038 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:28,049 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:28,050 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:28,050 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:28,050 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:28,052 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:28,053 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:28,056 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:28,061 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
[2025-02-06 19:50:28,061 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:28,062 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:28,063 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)
[2025-02-06 19:50:28,065 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
[2025-02-06 19:50:28,066 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:28,076 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:28,076 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:28,076 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:28,076 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:28,078 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:28,078 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:28,080 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:28,085 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:28,086 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:28,086 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:28,089 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)
[2025-02-06 19:50:28,090 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
[2025-02-06 19:50:28,091 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:28,101 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:28,102 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:28,102 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:28,102 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:28,106 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:28,106 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:28,111 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:28,117 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:28,117 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:28,117 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:28,119 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)
[2025-02-06 19:50:28,123 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
[2025-02-06 19:50:28,124 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:28,134 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:28,134 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:28,134 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:28,134 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:28,137 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:28,137 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:28,139 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:28,144 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
[2025-02-06 19:50:28,145 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:28,145 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:28,147 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)
[2025-02-06 19:50:28,149 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
[2025-02-06 19:50:28,150 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:28,160 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:28,160 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:28,160 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:28,160 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:28,163 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:28,163 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:28,165 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:28,171 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
[2025-02-06 19:50:28,171 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:28,171 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:28,173 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)
[2025-02-06 19:50:28,174 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
[2025-02-06 19:50:28,175 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:28,185 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:28,186 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:28,186 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:28,186 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:28,192 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:28,192 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:28,198 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:28,204 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:28,204 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:28,205 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:28,207 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)
[2025-02-06 19:50:28,208 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
[2025-02-06 19:50:28,209 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:28,219 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:28,219 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:28,219 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:28,219 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:28,221 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:28,221 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:28,224 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:28,230 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:28,230 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:28,230 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:28,232 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)
[2025-02-06 19:50:28,234 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
[2025-02-06 19:50:28,234 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:28,244 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:28,244 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:28,244 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:28,244 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:28,246 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:28,246 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:28,249 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:28,254 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
[2025-02-06 19:50:28,254 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:28,254 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:28,256 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)
[2025-02-06 19:50:28,258 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
[2025-02-06 19:50:28,259 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:28,268 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:28,268 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:28,268 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:28,268 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:28,270 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:28,270 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:28,273 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:28,279 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:28,279 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:28,279 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:28,280 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)
[2025-02-06 19:50:28,281 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
[2025-02-06 19:50:28,282 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:28,292 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:28,292 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:28,292 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:28,292 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:28,297 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:28,297 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:28,303 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:28,313 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:28,314 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:28,314 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:28,317 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)
[2025-02-06 19:50:28,318 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
[2025-02-06 19:50:28,320 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:28,329 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:28,329 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:28,329 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:28,329 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:28,332 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:28,332 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:28,335 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:28,340 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:28,340 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:28,340 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:28,342 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)
[2025-02-06 19:50:28,344 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
[2025-02-06 19:50:28,344 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:28,354 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:28,354 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:28,354 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:28,354 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:28,357 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:28,357 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:28,361 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-02-06 19:50:28,369 INFO  L443   ModelExtractionUtils]: Simplification made 5 calls to the SMT solver.
[2025-02-06 19:50:28,371 INFO  L444   ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero.
[2025-02-06 19:50:28,371 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:28,371 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:28,377 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)
[2025-02-06 19:50:28,378 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
[2025-02-06 19:50:28,385 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-02-06 19:50:28,396 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2025-02-06 19:50:28,396 INFO  L474          LassoAnalysis]: Proved termination.
[2025-02-06 19:50:28,397 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#1 func_to_recursive_line_21_to_22_0_#in~a.base) func_to_recursive_line_21_to_22_0_#in~a.offset)_1) = -2*v_rep(select (select #memory_int#1 func_to_recursive_line_21_to_22_0_#in~a.base) func_to_recursive_line_21_to_22_0_#in~a.offset)_1 + 11
Supporting invariants []
[2025-02-06 19:50:28,402 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
[2025-02-06 19:50:28,459 INFO  L156   tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed
[2025-02-06 19:50:28,463 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1
[2025-02-06 19:50:28,464 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
[2025-02-06 19:50:28,464 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,<IMPLEMENTATION_INPARAM,func_to_recursive_line_21_to_22_0>]]]
[2025-02-06 19:50:28,474 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:28,480 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:28,490 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:28,490 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:28,490 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:28,491 INFO  L256         TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:28,491 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:28,592 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes.
[2025-02-06 19:50:29,032 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements.
[2025-02-06 19:50:29,033 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:29,033 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:29,047 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2940 conjuncts, 117 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:29,063 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:30,099 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20
[2025-02-06 19:50:30,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 4203 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4203 trivial. 0 not checked.
[2025-02-06 19:50:30,124 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates 
[2025-02-06 19:50:30,125 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 48 transitions. cyclomatic complexity: 7 Second operand  has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-02-06 19:50:30,304 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0
[2025-02-06 19:50:30,372 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 48 transitions. cyclomatic complexity: 7. Second operand  has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 131 states and 145 transitions. Complement of second has 19 states.
[2025-02-06 19:50:30,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 
[2025-02-06 19:50:30,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-02-06 19:50:30,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions.
[2025-02-06 19:50:30,379 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 255 letters.
[2025-02-06 19:50:30,385 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:50:30,385 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 258 letters. Loop has 255 letters.
[2025-02-06 19:50:30,387 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:50:30,387 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 510 letters.
[2025-02-06 19:50:30,388 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:50:30,388 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 145 transitions.
[2025-02-06 19:50:30,394 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 8
[2025-02-06 19:50:30,395 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 87 states and 99 transitions.
[2025-02-06 19:50:30,395 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 33
[2025-02-06 19:50:30,395 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 35
[2025-02-06 19:50:30,395 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 87 states and 99 transitions.
[2025-02-06 19:50:30,395 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-06 19:50:30,395 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 87 states and 99 transitions.
[2025-02-06 19:50:30,395 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 87 states and 99 transitions.
[2025-02-06 19:50:30,403 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74.
[2025-02-06 19:50:30,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 74 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 12 states have call successors, (12), 7 states have call predecessors, (12), 21 states have return successors, (25), 22 states have call predecessors, (25), 8 states have call successors, (25)
[2025-02-06 19:50:30,405 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions.
[2025-02-06 19:50:30,405 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 74 states and 83 transitions.
[2025-02-06 19:50:30,405 INFO  L432   stractBuchiCegarLoop]: Abstraction has 74 states and 83 transitions.
[2025-02-06 19:50:30,405 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 11 ============
[2025-02-06 19:50:30,405 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 83 transitions.
[2025-02-06 19:50:30,406 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 8
[2025-02-06 19:50:30,406 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:50:30,406 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:50:30,406 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:30,406 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:30,406 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-02-06 19:50:30,406 INFO  L754   eck$LassoCheckResult]: Loop: "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-02-06 19:50:30,406 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:30,407 INFO  L85        PathProgramCache]: Analyzing trace with hash 1685787238, now seen corresponding path program 1 times
[2025-02-06 19:50:30,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:30,407 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622645642]
[2025-02-06 19:50:30,407 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:50:30,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:30,418 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes.
[2025-02-06 19:50:30,424 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements.
[2025-02-06 19:50:30,424 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:30,424 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:30,424 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:30,425 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes.
[2025-02-06 19:50:30,426 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements.
[2025-02-06 19:50:30,426 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:30,426 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:30,432 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:30,432 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:30,433 INFO  L85        PathProgramCache]: Analyzing trace with hash -1356371725, now seen corresponding path program 1 times
[2025-02-06 19:50:30,433 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:30,433 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137650334]
[2025-02-06 19:50:30,433 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:50:30,433 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:30,443 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-02-06 19:50:30,454 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-02-06 19:50:30,455 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:30,455 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:30,455 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:30,464 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-02-06 19:50:30,471 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-02-06 19:50:30,471 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:30,471 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:30,475 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:30,475 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:30,475 INFO  L85        PathProgramCache]: Analyzing trace with hash 794350, now seen corresponding path program 1 times
[2025-02-06 19:50:30,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:30,475 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951808021]
[2025-02-06 19:50:30,475 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:50:30,475 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:30,494 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-02-06 19:50:30,508 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-02-06 19:50:30,508 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:30,508 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:30,508 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:30,511 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-02-06 19:50:30,524 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-02-06 19:50:30,524 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:30,524 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:30,533 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:33,114 INFO  L204          LassoAnalysis]: Preferences:
[2025-02-06 19:50:33,114 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-02-06 19:50:33,114 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-02-06 19:50:33,115 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-02-06 19:50:33,115 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-02-06 19:50:33,115 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:33,115 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-02-06 19:50:33,115 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-02-06 19:50:33,115 INFO  L132   ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration11_Lasso
[2025-02-06 19:50:33,115 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-02-06 19:50:33,115 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-02-06 19:50:33,116 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,119 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,120 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,121 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,122 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,123 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,125 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,126 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,127 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,128 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,133 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,134 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,135 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,586 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,588 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,590 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,598 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,600 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,601 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,602 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,604 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,605 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,607 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,608 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,609 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,610 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,612 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,613 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,614 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,615 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,616 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:33,976 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-02-06 19:50:33,977 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-02-06 19:50:33,977 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:33,977 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:33,981 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)
[2025-02-06 19:50:33,982 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
[2025-02-06 19:50:33,982 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:33,992 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:33,992 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:33,992 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:33,992 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:33,992 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:33,992 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:33,992 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:33,993 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:33,998 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:33,998 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:33,999 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,000 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)
[2025-02-06 19:50:34,004 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
[2025-02-06 19:50:34,004 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,014 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,014 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:34,014 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,014 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,014 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,014 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:34,014 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:34,015 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,021 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
[2025-02-06 19:50:34,021 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,021 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,023 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)
[2025-02-06 19:50:34,023 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
[2025-02-06 19:50:34,025 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,035 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,035 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:34,035 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,035 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,035 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,036 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:34,036 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:34,037 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,042 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:34,042 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,042 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,045 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)
[2025-02-06 19:50:34,046 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
[2025-02-06 19:50:34,047 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,056 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,056 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:34,057 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,057 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,057 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,057 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:34,057 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:34,058 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,063 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:34,064 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,064 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,066 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)
[2025-02-06 19:50:34,067 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
[2025-02-06 19:50:34,068 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,078 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,078 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:34,078 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,078 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,078 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,078 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:34,078 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:34,079 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,085 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
[2025-02-06 19:50:34,085 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,085 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,087 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)
[2025-02-06 19:50:34,088 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
[2025-02-06 19:50:34,089 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,098 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,098 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:34,098 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,098 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,098 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,099 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:34,099 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:34,100 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,105 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0
[2025-02-06 19:50:34,106 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,106 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,111 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)
[2025-02-06 19:50:34,111 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
[2025-02-06 19:50:34,113 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,123 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,123 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:34,123 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,123 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,123 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,124 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:34,124 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:34,125 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,130 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:34,130 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,130 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,133 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)
[2025-02-06 19:50:34,134 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
[2025-02-06 19:50:34,135 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,144 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,144 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:34,144 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,144 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,144 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,144 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:34,145 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:34,146 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,151 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:34,151 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,151 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,153 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)
[2025-02-06 19:50:34,154 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
[2025-02-06 19:50:34,155 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,164 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,164 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:34,165 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,165 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,165 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,165 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:34,165 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:34,166 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,171 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:34,171 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,171 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,173 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)
[2025-02-06 19:50:34,175 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
[2025-02-06 19:50:34,176 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,186 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,186 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:34,186 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,186 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,186 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,187 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:34,187 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:34,188 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,193 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
[2025-02-06 19:50:34,194 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,194 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,195 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)
[2025-02-06 19:50:34,196 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
[2025-02-06 19:50:34,198 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,207 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,207 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,207 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,208 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,209 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:34,209 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:34,213 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,221 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
[2025-02-06 19:50:34,221 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,221 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,222 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)
[2025-02-06 19:50:34,223 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
[2025-02-06 19:50:34,225 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,234 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,235 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,235 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,235 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,237 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:34,237 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:34,240 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,245 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
[2025-02-06 19:50:34,246 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,246 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,248 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)
[2025-02-06 19:50:34,249 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
[2025-02-06 19:50:34,250 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,259 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,260 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,260 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,260 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,261 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:34,261 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:34,263 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,268 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:34,268 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,268 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,270 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)
[2025-02-06 19:50:34,272 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
[2025-02-06 19:50:34,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
[2025-02-06 19:50:34,282 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,283 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,283 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,283 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,284 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:34,284 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:34,287 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,294 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:34,294 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,295 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,296 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)
[2025-02-06 19:50:34,297 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
[2025-02-06 19:50:34,298 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,307 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,307 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,307 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,308 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,308 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:34,308 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:34,311 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,316 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
[2025-02-06 19:50:34,316 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,316 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,318 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)
[2025-02-06 19:50:34,319 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
[2025-02-06 19:50:34,320 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,330 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,330 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,330 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,330 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,331 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:34,331 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:34,334 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,339 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:34,340 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,340 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,341 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)
[2025-02-06 19:50:34,343 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
[2025-02-06 19:50:34,343 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,353 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,353 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,353 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,353 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,355 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:34,355 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:34,357 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,363 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:34,363 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,363 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,364 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)
[2025-02-06 19:50:34,365 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
[2025-02-06 19:50:34,366 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,376 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,376 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,376 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,376 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,378 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:34,378 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:34,381 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,386 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:34,386 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,386 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,388 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)
[2025-02-06 19:50:34,389 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
[2025-02-06 19:50:34,390 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,399 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,400 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,400 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,400 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,401 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:34,401 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:34,404 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:34,409 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:34,409 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,409 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,411 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)
[2025-02-06 19:50:34,412 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
[2025-02-06 19:50:34,414 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:34,424 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:34,424 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:34,424 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:34,424 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:34,427 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:34,427 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:34,434 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-02-06 19:50:34,453 INFO  L443   ModelExtractionUtils]: Simplification made 14 calls to the SMT solver.
[2025-02-06 19:50:34,453 INFO  L444   ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero.
[2025-02-06 19:50:34,453 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:34,453 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:34,455 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)
[2025-02-06 19:50:34,459 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
[2025-02-06 19:50:34,459 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-02-06 19:50:34,469 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2025-02-06 19:50:34,470 INFO  L474          LassoAnalysis]: Proved termination.
[2025-02-06 19:50:34,470 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#3 func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_1) = -2*v_rep(select (select #memory_int#3 func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_1 + 11
Supporting invariants []
[2025-02-06 19:50:34,475 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:34,499 INFO  L156   tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed
[2025-02-06 19:50:34,500 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3
[2025-02-06 19:50:34,500 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL]
[2025-02-06 19:50:34,500 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~b!base,<IMPLEMENTATION_INPARAM,func_to_recursive_line_22_to_23_0>]]]
[2025-02-06 19:50:34,508 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:34,516 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes.
[2025-02-06 19:50:34,533 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements.
[2025-02-06 19:50:34,533 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:34,533 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:34,534 INFO  L256         TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:34,535 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:34,556 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-02-06 19:50:34,604 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-02-06 19:50:34,604 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:34,604 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:34,607 INFO  L256         TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 118 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:34,612 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:34,629 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7
[2025-02-06 19:50:35,058 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20
[2025-02-06 19:50:35,088 INFO  L134       CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked.
[2025-02-06 19:50:35,088 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates 
[2025-02-06 19:50:35,088 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 14 Second operand  has 10 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 5 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-06 19:50:35,368 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 14. Second operand  has 10 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 5 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Result 254 states and 287 transitions. Complement of second has 39 states.
[2025-02-06 19:50:35,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states 
[2025-02-06 19:50:35,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 5 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-06 19:50:35,369 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions.
[2025-02-06 19:50:35,369 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 11 states and 24 transitions. Stem has 6 letters. Loop has 39 letters.
[2025-02-06 19:50:35,369 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:50:35,369 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 11 states and 24 transitions. Stem has 45 letters. Loop has 39 letters.
[2025-02-06 19:50:35,369 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:50:35,369 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 11 states and 24 transitions. Stem has 6 letters. Loop has 78 letters.
[2025-02-06 19:50:35,370 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:50:35,370 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 287 transitions.
[2025-02-06 19:50:35,372 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 11
[2025-02-06 19:50:35,373 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 155 states and 182 transitions.
[2025-02-06 19:50:35,373 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 39
[2025-02-06 19:50:35,373 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 41
[2025-02-06 19:50:35,373 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 155 states and 182 transitions.
[2025-02-06 19:50:35,374 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-06 19:50:35,374 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 155 states and 182 transitions.
[2025-02-06 19:50:35,374 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 155 states and 182 transitions.
[2025-02-06 19:50:35,378 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142.
[2025-02-06 19:50:35,378 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 142 states, 80 states have (on average 1.125) internal successors, (90), 88 states have internal predecessors, (90), 26 states have call successors, (26), 16 states have call predecessors, (26), 36 states have return successors, (50), 37 states have call predecessors, (50), 18 states have call successors, (50)
[2025-02-06 19:50:35,379 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions.
[2025-02-06 19:50:35,379 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 142 states and 166 transitions.
[2025-02-06 19:50:35,379 INFO  L432   stractBuchiCegarLoop]: Abstraction has 142 states and 166 transitions.
[2025-02-06 19:50:35,379 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 12 ============
[2025-02-06 19:50:35,379 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 166 transitions.
[2025-02-06 19:50:35,380 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 11
[2025-02-06 19:50:35,380 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:50:35,380 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:50:35,380 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:35,380 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2025-02-06 19:50:35,380 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< 
[2025-02-06 19:50:35,380 INFO  L754   eck$LassoCheckResult]: Loop: "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< 
[2025-02-06 19:50:35,380 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:35,380 INFO  L85        PathProgramCache]: Analyzing trace with hash 235025028, now seen corresponding path program 1 times
[2025-02-06 19:50:35,380 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:35,380 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290822620]
[2025-02-06 19:50:35,380 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:50:35,380 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:35,384 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-02-06 19:50:35,387 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-02-06 19:50:35,387 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:35,387 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:35,387 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:35,388 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-02-06 19:50:35,389 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-02-06 19:50:35,389 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:35,390 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:35,392 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:35,392 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:35,392 INFO  L85        PathProgramCache]: Analyzing trace with hash 32741, now seen corresponding path program 1 times
[2025-02-06 19:50:35,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:35,392 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776889176]
[2025-02-06 19:50:35,392 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:50:35,392 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:35,395 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:35,395 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:35,396 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:35,396 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:35,396 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:35,396 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:35,396 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:35,396 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:35,396 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:35,398 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:35,398 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:35,398 INFO  L85        PathProgramCache]: Analyzing trace with hash 833919618, now seen corresponding path program 1 times
[2025-02-06 19:50:35,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:35,398 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207278508]
[2025-02-06 19:50:35,398 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 19:50:35,398 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:35,402 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-02-06 19:50:35,404 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-02-06 19:50:35,404 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:35,404 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:35,404 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:35,405 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-02-06 19:50:35,407 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-02-06 19:50:35,407 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:35,407 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:35,409 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:37,025 INFO  L204          LassoAnalysis]: Preferences:
[2025-02-06 19:50:37,025 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-02-06 19:50:37,025 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-02-06 19:50:37,025 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-02-06 19:50:37,025 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-02-06 19:50:37,026 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,026 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-02-06 19:50:37,026 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-02-06 19:50:37,026 INFO  L132   ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration12_Lasso
[2025-02-06 19:50:37,026 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-02-06 19:50:37,026 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-02-06 19:50:37,031 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,032 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,034 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,035 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,036 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,040 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,042 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,043 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,044 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,045 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,046 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,047 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,281 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,282 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,284 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,285 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,286 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,287 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,289 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,290 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,300 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,302 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,303 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,304 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,306 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,307 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,308 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,310 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,311 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,312 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,314 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,315 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,316 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,318 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,320 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,321 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,323 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,324 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,326 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:37,600 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-02-06 19:50:37,600 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-02-06 19:50:37,600 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,600 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,603 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)
[2025-02-06 19:50:37,626 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
[2025-02-06 19:50:37,627 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,633 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0
[2025-02-06 19:50:37,637 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,638 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:37,638 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,638 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,638 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,638 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:37,638 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:37,639 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,644 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:37,644 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,644 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,647 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)
[2025-02-06 19:50:37,647 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
[2025-02-06 19:50:37,648 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,657 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,657 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:37,657 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,657 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,657 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,658 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:37,658 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:37,659 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,664 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:37,664 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,664 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,666 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)
[2025-02-06 19:50:37,667 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
[2025-02-06 19:50:37,668 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,677 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,677 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:37,677 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,677 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,677 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,677 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:37,677 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:37,678 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,683 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
[2025-02-06 19:50:37,684 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,684 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,686 INFO  L229       MonitoredProcess]: Starting monitored process 59 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)
[2025-02-06 19:50:37,687 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process
[2025-02-06 19:50:37,687 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,697 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,697 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:37,697 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,697 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,697 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,698 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:37,698 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:37,699 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,704 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:37,704 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,704 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,706 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)
[2025-02-06 19:50:37,707 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
[2025-02-06 19:50:37,709 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,719 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,719 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:37,720 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,720 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,720 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,720 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:37,720 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:37,721 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,727 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:37,727 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,727 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,729 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)
[2025-02-06 19:50:37,730 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
[2025-02-06 19:50:37,731 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,742 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,742 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:37,742 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,742 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,742 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,742 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:37,742 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:37,744 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,749 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
[2025-02-06 19:50:37,750 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,750 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,752 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)
[2025-02-06 19:50:37,752 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
[2025-02-06 19:50:37,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
[2025-02-06 19:50:37,763 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,763 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:37,763 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,763 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,763 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,763 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:37,763 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:37,765 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,770 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:37,770 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,770 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,772 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)
[2025-02-06 19:50:37,773 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
[2025-02-06 19:50:37,774 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,784 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,784 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:37,784 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,784 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,784 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,785 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:37,785 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:37,786 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,791 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:37,791 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,792 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,793 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)
[2025-02-06 19:50:37,794 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
[2025-02-06 19:50:37,795 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,805 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,805 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:37,805 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,805 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,805 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,805 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:37,805 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:37,806 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,812 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:37,812 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,812 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,814 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)
[2025-02-06 19:50:37,816 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
[2025-02-06 19:50:37,817 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,827 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,827 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:37,827 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,827 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,827 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,827 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:37,827 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:37,828 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,834 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
[2025-02-06 19:50:37,834 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,835 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,836 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)
[2025-02-06 19:50:37,838 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
[2025-02-06 19:50:37,838 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,848 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,848 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,848 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,848 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,850 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:37,850 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:37,852 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,857 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:37,858 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,858 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,860 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)
[2025-02-06 19:50:37,861 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
[2025-02-06 19:50:37,863 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,875 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,875 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,875 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,875 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,876 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:37,877 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:37,880 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,885 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:37,885 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,886 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,888 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)
[2025-02-06 19:50:37,889 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
[2025-02-06 19:50:37,890 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,900 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,900 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,900 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,900 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,902 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:37,902 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:37,905 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,911 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:37,911 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,911 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,913 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)
[2025-02-06 19:50:37,914 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
[2025-02-06 19:50:37,915 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,925 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,925 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,925 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,925 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,927 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:37,927 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:37,929 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,935 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:37,936 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,936 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,937 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)
[2025-02-06 19:50:37,938 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
[2025-02-06 19:50:37,939 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,949 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,949 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,949 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,949 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,951 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:37,951 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:37,953 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,958 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:37,959 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,959 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,961 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)
[2025-02-06 19:50:37,962 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
[2025-02-06 19:50:37,962 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,972 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,972 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,972 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,972 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,973 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:37,974 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:37,976 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:37,981 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
[2025-02-06 19:50:37,981 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:37,981 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:37,983 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)
[2025-02-06 19:50:37,983 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
[2025-02-06 19:50:37,985 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:37,995 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:37,995 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:37,995 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:37,995 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:37,997 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:37,997 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:37,999 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:38,005 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:38,005 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:38,005 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:38,007 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)
[2025-02-06 19:50:38,009 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
[2025-02-06 19:50:38,010 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:38,021 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:38,022 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:38,022 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:38,022 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:38,023 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:38,023 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:38,025 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:38,031 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
[2025-02-06 19:50:38,031 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:38,032 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:38,034 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)
[2025-02-06 19:50:38,034 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
[2025-02-06 19:50:38,035 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:38,045 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:38,045 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:38,045 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:38,045 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:38,046 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:38,046 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:38,049 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:38,054 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
[2025-02-06 19:50:38,055 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:38,055 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:38,058 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)
[2025-02-06 19:50:38,059 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
[2025-02-06 19:50:38,059 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:38,069 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:38,069 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:38,069 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:38,069 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:38,071 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:38,071 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:38,074 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:38,080 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
[2025-02-06 19:50:38,080 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:38,080 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:38,082 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)
[2025-02-06 19:50:38,086 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
[2025-02-06 19:50:38,087 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:38,096 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:38,096 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:38,096 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:38,096 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:38,102 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:38,102 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:38,108 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-02-06 19:50:38,142 INFO  L443   ModelExtractionUtils]: Simplification made 14 calls to the SMT solver.
[2025-02-06 19:50:38,142 INFO  L444   ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero.
[2025-02-06 19:50:38,143 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:38,143 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:38,145 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)
[2025-02-06 19:50:38,146 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
[2025-02-06 19:50:38,147 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-02-06 19:50:38,157 INFO  L438   nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2.
[2025-02-06 19:50:38,157 INFO  L474          LassoAnalysis]: Proved termination.
[2025-02-06 19:50:38,157 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select old(#memory_int#2) func_to_recursive_line_23_to_23_0_#in~c.base) func_to_recursive_line_23_to_23_0_#in~c.offset)_1) = -2*v_rep(select (select old(#memory_int#2) func_to_recursive_line_23_to_23_0_#in~c.base) func_to_recursive_line_23_to_23_0_#in~c.offset)_1 + 11
Supporting invariants [-1*v_rep(select (select old(#memory_int#2) func_to_recursive_line_23_to_23_0_#in~c.base) func_to_recursive_line_23_to_23_0_#in~c.offset)_1 + 1*v_rep(select (select #memory_int#2 func_to_recursive_line_23_to_23_0_#in~c.base) func_to_recursive_line_23_to_23_0_#in~c.offset)_1 >= 0, -1*v_rep(select (select old(#memory_int#2) func_to_recursive_line_23_to_23_0_#in~c.base) 0)_1 + 1*v_rep(select (select #memory_int#2 func_to_recursive_line_23_to_23_0_#in~c.base) 0)_1 >= 0]
[2025-02-06 19:50:38,164 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:38,189 INFO  L156   tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed
[2025-02-06 19:50:38,194 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2
[2025-02-06 19:50:38,194 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]]
[2025-02-06 19:50:38,194 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~c!base,<IMPLEMENTATION_INPARAM,func_to_recursive_line_23_to_23_0>]]]
[2025-02-06 19:50:38,210 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:38,228 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-02-06 19:50:38,245 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-02-06 19:50:38,245 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:38,245 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:38,247 INFO  L256         TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 21 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:38,247 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:38,325 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:38,332 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:38,332 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:38,332 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:38,337 INFO  L256         TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 22 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:38,337 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:38,347 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15
[2025-02-06 19:50:38,369 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20
[2025-02-06 19:50:38,387 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 19:50:38,388 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates 
[2025-02-06 19:50:38,388 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 166 transitions. cyclomatic complexity: 34 Second operand  has 9 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:50:38,529 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 166 transitions. cyclomatic complexity: 34. Second operand  has 9 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 184 states and 223 transitions. Complement of second has 19 states.
[2025-02-06 19:50:38,530 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 3 non-accepting loop states 1 accepting loop states 
[2025-02-06 19:50:38,530 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-06 19:50:38,530 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions.
[2025-02-06 19:50:38,530 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 9 letters. Loop has 3 letters.
[2025-02-06 19:50:38,530 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:50:38,531 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 12 letters. Loop has 3 letters.
[2025-02-06 19:50:38,531 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:50:38,531 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 9 letters. Loop has 6 letters.
[2025-02-06 19:50:38,531 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:50:38,531 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 223 transitions.
[2025-02-06 19:50:38,532 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 11
[2025-02-06 19:50:38,534 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 162 states and 200 transitions.
[2025-02-06 19:50:38,534 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 36
[2025-02-06 19:50:38,534 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 36
[2025-02-06 19:50:38,534 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 162 states and 200 transitions.
[2025-02-06 19:50:38,535 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-06 19:50:38,535 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions.
[2025-02-06 19:50:38,535 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 162 states and 200 transitions.
[2025-02-06 19:50:38,540 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162.
[2025-02-06 19:50:38,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 162 states, 93 states have (on average 1.118279569892473) internal successors, (104), 104 states have internal predecessors, (104), 31 states have call successors, (31), 20 states have call predecessors, (31), 38 states have return successors, (65), 37 states have call predecessors, (65), 23 states have call successors, (65)
[2025-02-06 19:50:38,541 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions.
[2025-02-06 19:50:38,542 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions.
[2025-02-06 19:50:38,542 INFO  L432   stractBuchiCegarLoop]: Abstraction has 162 states and 200 transitions.
[2025-02-06 19:50:38,542 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 13 ============
[2025-02-06 19:50:38,542 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 200 transitions.
[2025-02-06 19:50:38,543 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 11
[2025-02-06 19:50:38,543 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:50:38,543 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:50:38,543 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:38,543 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2025-02-06 19:50:38,543 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< 
[2025-02-06 19:50:38,543 INFO  L754   eck$LassoCheckResult]: Loop: "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< 
[2025-02-06 19:50:38,544 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:38,544 INFO  L85        PathProgramCache]: Analyzing trace with hash -2105313028, now seen corresponding path program 2 times
[2025-02-06 19:50:38,544 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:38,544 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014227782]
[2025-02-06 19:50:38,544 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:50:38,544 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:38,551 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes.
[2025-02-06 19:50:38,558 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements.
[2025-02-06 19:50:38,559 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-06 19:50:38,559 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:38,559 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:38,561 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes.
[2025-02-06 19:50:38,567 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements.
[2025-02-06 19:50:38,567 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:38,567 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:38,571 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:38,571 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:38,571 INFO  L85        PathProgramCache]: Analyzing trace with hash 32741, now seen corresponding path program 2 times
[2025-02-06 19:50:38,572 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:38,572 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830186577]
[2025-02-06 19:50:38,572 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:50:38,572 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:38,575 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:38,575 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:38,575 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-02-06 19:50:38,575 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:38,576 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:38,576 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:38,576 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:38,577 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:38,577 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:38,579 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:38,579 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:38,579 INFO  L85        PathProgramCache]: Analyzing trace with hash 27009290, now seen corresponding path program 3 times
[2025-02-06 19:50:38,579 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:38,579 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458172471]
[2025-02-06 19:50:38,579 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-06 19:50:38,580 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:38,586 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 8 equivalence classes.
[2025-02-06 19:50:38,599 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 51 of 51 statements.
[2025-02-06 19:50:38,599 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s)
[2025-02-06 19:50:38,599 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:38,599 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:38,602 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-02-06 19:50:38,608 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-02-06 19:50:38,608 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:38,609 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:38,613 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:41,380 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
[2025-02-06 19:50:41,530 INFO  L204          LassoAnalysis]: Preferences:
[2025-02-06 19:50:41,530 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-02-06 19:50:41,530 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-02-06 19:50:41,530 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-02-06 19:50:41,530 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-02-06 19:50:41,530 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:41,530 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-02-06 19:50:41,530 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-02-06 19:50:41,530 INFO  L132   ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration13_Lasso
[2025-02-06 19:50:41,530 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-02-06 19:50:41,531 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-02-06 19:50:41,532 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,536 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,537 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,539 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,540 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,541 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,787 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,788 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,790 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,791 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,792 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,793 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,795 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,796 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,797 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,801 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,802 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,810 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,811 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,813 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,814 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,815 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,817 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,818 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,819 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,821 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,822 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,823 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,824 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,826 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,827 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,828 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,830 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,831 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,832 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,833 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,835 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,840 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,841 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,843 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:41,844 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:42,163 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-02-06 19:50:42,163 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-02-06 19:50:42,163 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:42,164 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:42,166 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)
[2025-02-06 19:50:42,166 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
[2025-02-06 19:50:42,168 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:42,177 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:42,178 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:42,178 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:42,178 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:42,178 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:42,178 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:42,178 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:42,179 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:42,184 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
[2025-02-06 19:50:42,184 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:42,184 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:42,186 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)
[2025-02-06 19:50:42,187 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
[2025-02-06 19:50:42,188 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:42,197 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:42,198 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:42,198 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:42,198 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:42,198 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:42,198 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:42,198 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:42,201 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:42,207 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:42,207 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:42,207 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:42,209 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)
[2025-02-06 19:50:42,214 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
[2025-02-06 19:50:42,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
[2025-02-06 19:50:42,224 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:42,224 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:42,224 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:42,224 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:42,224 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:42,224 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:42,224 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:42,226 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:42,232 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
[2025-02-06 19:50:42,233 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:42,233 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:42,235 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)
[2025-02-06 19:50:42,236 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
[2025-02-06 19:50:42,237 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:42,247 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:42,247 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:42,247 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:42,247 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:42,247 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:42,248 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:42,248 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:42,249 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:42,255 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:42,255 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:42,255 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:42,257 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)
[2025-02-06 19:50:42,258 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
[2025-02-06 19:50:42,259 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:42,269 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:42,269 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:42,269 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:42,269 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:42,269 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:42,270 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:42,270 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:42,271 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:42,276 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:42,277 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:42,277 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:42,279 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)
[2025-02-06 19:50:42,279 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
[2025-02-06 19:50:42,280 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:42,290 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:42,290 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:42,291 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:42,291 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:42,292 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:42,292 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:42,295 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:42,301 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
[2025-02-06 19:50:42,301 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:42,301 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:42,303 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)
[2025-02-06 19:50:42,303 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
[2025-02-06 19:50:42,304 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:42,314 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:42,314 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:42,314 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:42,314 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:42,316 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:42,318 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:42,326 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:42,340 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:42,340 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:42,340 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:42,344 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)
[2025-02-06 19:50:42,345 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
[2025-02-06 19:50:42,347 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:42,357 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:42,357 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:42,357 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:42,357 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:42,358 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:42,358 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:42,362 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:42,367 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:42,367 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:42,367 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:42,369 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)
[2025-02-06 19:50:42,371 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
[2025-02-06 19:50:42,372 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:42,382 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:42,382 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:42,382 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:42,382 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:42,383 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:42,383 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:42,386 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:42,391 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:42,391 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:42,391 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:42,393 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)
[2025-02-06 19:50:42,394 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
[2025-02-06 19:50:42,395 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:42,405 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:42,405 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:42,405 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:42,405 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:42,406 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:42,406 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:42,409 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:42,414 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:42,415 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:42,415 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:42,417 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)
[2025-02-06 19:50:42,418 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
[2025-02-06 19:50:42,420 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:42,429 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:42,429 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:42,429 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:42,429 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:42,431 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:42,431 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:42,434 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:42,439 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:42,439 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:42,439 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:42,441 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)
[2025-02-06 19:50:42,442 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
[2025-02-06 19:50:42,443 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:42,453 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:42,453 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:42,453 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:42,453 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:42,456 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:42,457 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:42,463 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-02-06 19:50:42,483 INFO  L443   ModelExtractionUtils]: Simplification made 14 calls to the SMT solver.
[2025-02-06 19:50:42,483 INFO  L444   ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero.
[2025-02-06 19:50:42,483 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:42,483 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:42,486 INFO  L229       MonitoredProcess]: Starting monitored process 90 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)
[2025-02-06 19:50:42,487 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process
[2025-02-06 19:50:42,487 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-02-06 19:50:42,498 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2025-02-06 19:50:42,498 INFO  L474          LassoAnalysis]: Proved termination.
[2025-02-06 19:50:42,498 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#2 func_to_recursive_line_23_to_23_0_#in~c.base) 0)_2) = -2*v_rep(select (select #memory_int#2 func_to_recursive_line_23_to_23_0_#in~c.base) 0)_2 + 11
Supporting invariants []
[2025-02-06 19:50:42,504 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:42,517 INFO  L156   tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed
[2025-02-06 19:50:42,519 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2
[2025-02-06 19:50:42,519 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL]
[2025-02-06 19:50:42,519 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~c!base,<IMPLEMENTATION_INPARAM,func_to_recursive_line_23_to_23_0>]]]
[2025-02-06 19:50:42,536 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:42,556 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes.
[2025-02-06 19:50:42,647 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements.
[2025-02-06 19:50:42,647 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:42,647 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:42,651 INFO  L256         TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 34 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:42,652 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:42,969 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:42,975 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:42,975 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:42,975 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:42,976 INFO  L256         TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:42,977 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:43,001 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20
[2025-02-06 19:50:43,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 19:50:43,022 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 3 loop predicates 
[2025-02-06 19:50:43,023 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand  has 11 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 6 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-02-06 19:50:43,266 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand  has 11 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 6 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 176 states and 214 transitions. Complement of second has 20 states.
[2025-02-06 19:50:43,266 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 3 non-accepting loop states 1 accepting loop states 
[2025-02-06 19:50:43,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 6 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-02-06 19:50:43,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions.
[2025-02-06 19:50:43,267 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. Stem has 48 letters. Loop has 3 letters.
[2025-02-06 19:50:43,267 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:50:43,267 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-02-06 19:50:43,285 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:43,305 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes.
[2025-02-06 19:50:43,361 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements.
[2025-02-06 19:50:43,361 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:43,361 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:43,366 INFO  L256         TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 34 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:43,367 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:43,685 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:43,690 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:43,690 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:43,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:43,691 INFO  L256         TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:43,691 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:43,715 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20
[2025-02-06 19:50:43,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 19:50:43,735 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 3 loop predicates 
[2025-02-06 19:50:43,736 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand  has 11 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 6 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-02-06 19:50:43,972 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand  has 11 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 6 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 176 states and 214 transitions. Complement of second has 20 states.
[2025-02-06 19:50:43,973 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 3 non-accepting loop states 1 accepting loop states 
[2025-02-06 19:50:43,973 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 6 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-02-06 19:50:43,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions.
[2025-02-06 19:50:43,973 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. Stem has 48 letters. Loop has 3 letters.
[2025-02-06 19:50:43,973 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:50:43,973 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-02-06 19:50:43,991 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:44,010 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes.
[2025-02-06 19:50:44,067 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements.
[2025-02-06 19:50:44,067 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:44,067 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:44,070 INFO  L256         TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 34 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:44,072 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:44,384 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes.
[2025-02-06 19:50:44,389 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements.
[2025-02-06 19:50:44,389 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:44,389 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:44,390 INFO  L256         TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 22 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:44,390 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:44,415 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20
[2025-02-06 19:50:44,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 19:50:44,436 INFO  L141   lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 3 loop predicates 
[2025-02-06 19:50:44,436 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand  has 11 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 6 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-02-06 19:50:44,764 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand  has 11 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 6 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 254 states and 295 transitions. Complement of second has 28 states.
[2025-02-06 19:50:44,764 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 3 non-accepting loop states 1 accepting loop states 
[2025-02-06 19:50:44,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 6 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-02-06 19:50:44,765 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 32 transitions.
[2025-02-06 19:50:44,765 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 12 states and 32 transitions. Stem has 48 letters. Loop has 3 letters.
[2025-02-06 19:50:44,765 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:50:44,766 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 12 states and 32 transitions. Stem has 51 letters. Loop has 3 letters.
[2025-02-06 19:50:44,766 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:50:44,766 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 12 states and 32 transitions. Stem has 48 letters. Loop has 6 letters.
[2025-02-06 19:50:44,766 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:50:44,766 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 295 transitions.
[2025-02-06 19:50:44,768 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-06 19:50:44,769 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 138 states and 167 transitions.
[2025-02-06 19:50:44,769 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 33
[2025-02-06 19:50:44,770 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 34
[2025-02-06 19:50:44,773 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 138 states and 167 transitions.
[2025-02-06 19:50:44,773 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-06 19:50:44,773 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 138 states and 167 transitions.
[2025-02-06 19:50:44,774 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 138 states and 167 transitions.
[2025-02-06 19:50:44,778 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118.
[2025-02-06 19:50:44,778 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 118 states, 68 states have (on average 1.088235294117647) internal successors, (74), 74 states have internal predecessors, (74), 21 states have call successors, (21), 13 states have call predecessors, (21), 29 states have return successors, (42), 30 states have call predecessors, (42), 17 states have call successors, (42)
[2025-02-06 19:50:44,779 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions.
[2025-02-06 19:50:44,779 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 118 states and 137 transitions.
[2025-02-06 19:50:44,779 INFO  L432   stractBuchiCegarLoop]: Abstraction has 118 states and 137 transitions.
[2025-02-06 19:50:44,779 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 14 ============
[2025-02-06 19:50:44,779 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 137 transitions.
[2025-02-06 19:50:44,780 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-06 19:50:44,780 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:50:44,780 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:50:44,781 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:44,781 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:50:44,781 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-02-06 19:50:44,781 INFO  L754   eck$LassoCheckResult]: Loop: "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< 
[2025-02-06 19:50:44,782 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:44,782 INFO  L85        PathProgramCache]: Analyzing trace with hash 1550122481, now seen corresponding path program 2 times
[2025-02-06 19:50:44,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:44,782 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642798287]
[2025-02-06 19:50:44,782 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:50:44,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:44,807 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 261 statements into 2 equivalence classes.
[2025-02-06 19:50:44,858 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0
[2025-02-06 19:50:44,883 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 261 of 261 statements.
[2025-02-06 19:50:44,883 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-06 19:50:44,883 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:44,884 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:44,895 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes.
[2025-02-06 19:50:44,927 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements.
[2025-02-06 19:50:44,927 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:44,927 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:44,942 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:44,943 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:44,943 INFO  L85        PathProgramCache]: Analyzing trace with hash -1356371725, now seen corresponding path program 2 times
[2025-02-06 19:50:44,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:44,943 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434531943]
[2025-02-06 19:50:44,943 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-06 19:50:44,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:44,951 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes.
[2025-02-06 19:50:44,955 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements.
[2025-02-06 19:50:44,955 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-02-06 19:50:44,955 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:44,955 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:44,957 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-02-06 19:50:44,959 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-02-06 19:50:44,959 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:44,959 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:44,963 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:44,964 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:44,964 INFO  L85        PathProgramCache]: Analyzing trace with hash 761371907, now seen corresponding path program 3 times
[2025-02-06 19:50:44,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:50:44,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652870407]
[2025-02-06 19:50:44,964 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-06 19:50:44,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:50:44,986 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 300 statements into 44 equivalence classes.
[2025-02-06 19:50:45,161 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) and asserted 300 of 300 statements.
[2025-02-06 19:50:45,161 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s)
[2025-02-06 19:50:45,161 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:45,161 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-06 19:50:45,174 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes.
[2025-02-06 19:50:45,214 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements.
[2025-02-06 19:50:45,214 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:45,215 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-06 19:50:45,231 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-06 19:50:56,829 INFO  L204          LassoAnalysis]: Preferences:
[2025-02-06 19:50:56,830 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2025-02-06 19:50:56,830 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2025-02-06 19:50:56,830 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2025-02-06 19:50:56,830 INFO  L128   ssoRankerPreferences]: Use exernal solver: false
[2025-02-06 19:50:56,830 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:56,830 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2025-02-06 19:50:56,830 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2025-02-06 19:50:56,830 INFO  L132   ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration14_Lasso
[2025-02-06 19:50:56,830 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2025-02-06 19:50:56,830 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2025-02-06 19:50:56,832 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,838 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,839 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,841 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,856 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,858 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,859 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,860 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,861 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,863 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,864 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,865 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,867 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,868 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,869 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,870 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,872 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,873 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,874 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,876 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,877 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,878 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,879 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,881 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,882 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,883 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,884 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,885 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:56,889 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:57,357 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:57,359 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:57,360 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:57,362 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:57,363 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:57,364 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2025-02-06 19:50:57,710 INFO  L259          LassoAnalysis]: Preprocessing complete.
[2025-02-06 19:50:57,710 INFO  L451          LassoAnalysis]: Using template 'affine'.
[2025-02-06 19:50:57,710 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:57,710 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:57,712 INFO  L229       MonitoredProcess]: Starting monitored process 91 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)
[2025-02-06 19:50:57,713 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process
[2025-02-06 19:50:57,716 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:57,726 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:57,726 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:57,726 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:57,727 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:57,727 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:57,727 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:57,727 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:57,728 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:57,733 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0
[2025-02-06 19:50:57,734 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:57,734 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:57,736 INFO  L229       MonitoredProcess]: Starting monitored process 92 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)
[2025-02-06 19:50:57,736 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process
[2025-02-06 19:50:57,737 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:57,747 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:57,747 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:57,747 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:57,747 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:57,747 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:57,748 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:57,748 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:57,749 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:57,754 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:57,754 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:57,754 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:57,756 INFO  L229       MonitoredProcess]: Starting monitored process 93 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)
[2025-02-06 19:50:57,757 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process
[2025-02-06 19:50:57,758 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:57,767 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:57,767 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:57,767 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:57,767 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:57,767 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:57,768 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:57,768 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:57,769 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:57,774 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:57,774 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:57,775 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:57,776 INFO  L229       MonitoredProcess]: Starting monitored process 94 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)
[2025-02-06 19:50:57,777 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process
[2025-02-06 19:50:57,779 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:57,789 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:57,789 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:57,789 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:57,789 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:57,793 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:57,793 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:57,796 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:57,801 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0
[2025-02-06 19:50:57,802 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:57,802 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:57,803 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)
[2025-02-06 19:50:57,804 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
[2025-02-06 19:50:57,806 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:57,816 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:57,816 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:57,816 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:57,816 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:57,816 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:57,817 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:57,819 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:57,824 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:57,824 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:57,824 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:57,827 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)
[2025-02-06 19:50:57,827 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
[2025-02-06 19:50:57,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
[2025-02-06 19:50:57,838 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:57,838 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:57,838 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:57,838 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:57,838 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:57,838 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:57,839 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:57,840 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:57,845 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:57,845 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:57,845 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:57,847 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)
[2025-02-06 19:50:57,848 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
[2025-02-06 19:50:57,853 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:57,863 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:57,863 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:57,863 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:57,863 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:57,863 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:57,864 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:57,864 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:57,865 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:57,870 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:57,870 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:57,870 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:57,872 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)
[2025-02-06 19:50:57,873 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
[2025-02-06 19:50:57,874 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:57,883 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:57,884 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:57,884 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:57,884 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:57,884 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:57,884 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:57,884 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:57,885 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:57,890 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:57,890 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:57,890 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:57,892 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)
[2025-02-06 19:50:57,894 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
[2025-02-06 19:50:57,895 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:57,905 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:57,905 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:57,905 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:57,905 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:57,905 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:57,906 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:57,906 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:57,907 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:57,912 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:57,912 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:57,913 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:57,915 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)
[2025-02-06 19:50:57,915 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
[2025-02-06 19:50:57,916 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:57,926 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:57,926 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:57,926 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:57,926 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:57,926 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:57,926 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:57,927 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:57,928 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:57,933 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:57,933 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:57,933 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:57,935 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)
[2025-02-06 19:50:57,936 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
[2025-02-06 19:50:57,938 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:57,947 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:57,947 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:57,947 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:57,947 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:57,947 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:57,948 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:57,948 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:57,949 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:57,955 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:57,955 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:57,955 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:57,957 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)
[2025-02-06 19:50:57,958 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
[2025-02-06 19:50:57,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
[2025-02-06 19:50:57,969 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:57,970 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:57,970 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:57,970 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:57,970 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:57,970 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:57,970 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:57,971 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:57,977 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:57,977 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:57,978 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:57,979 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)
[2025-02-06 19:50:57,981 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
[2025-02-06 19:50:57,981 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:57,991 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:57,991 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:57,991 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:57,991 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:57,991 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:57,991 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:57,992 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:57,992 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:57,998 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:57,998 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:57,999 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,001 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)
[2025-02-06 19:50:58,002 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
[2025-02-06 19:50:58,003 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,013 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,013 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:58,013 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,013 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,013 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,013 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:58,013 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:58,014 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,020 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
[2025-02-06 19:50:58,020 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,020 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,022 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)
[2025-02-06 19:50:58,023 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
[2025-02-06 19:50:58,024 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,033 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,034 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:58,034 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,034 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,034 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,034 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:58,034 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:58,035 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,041 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
[2025-02-06 19:50:58,041 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,041 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,042 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)
[2025-02-06 19:50:58,044 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
[2025-02-06 19:50:58,044 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,059 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,059 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:58,059 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,059 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,059 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,060 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:58,060 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:58,061 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,067 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0
[2025-02-06 19:50:58,067 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,067 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,069 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)
[2025-02-06 19:50:58,070 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
[2025-02-06 19:50:58,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
[2025-02-06 19:50:58,080 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,080 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:58,080 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,080 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,080 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,081 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:58,081 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:58,082 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,087 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
[2025-02-06 19:50:58,088 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,088 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,090 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)
[2025-02-06 19:50:58,090 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
[2025-02-06 19:50:58,091 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,101 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,102 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:58,102 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,102 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,102 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,102 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:58,102 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:58,103 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,109 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,109 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,109 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,111 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)
[2025-02-06 19:50:58,112 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
[2025-02-06 19:50:58,113 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,122 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,122 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:58,122 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,122 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,122 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,123 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:58,123 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:58,124 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,129 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
[2025-02-06 19:50:58,129 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,130 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,132 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)
[2025-02-06 19:50:58,133 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
[2025-02-06 19:50:58,134 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,143 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,144 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:58,144 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,144 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,144 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,144 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:58,144 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:58,145 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,150 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,151 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,151 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,152 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)
[2025-02-06 19:50:58,153 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
[2025-02-06 19:50:58,154 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,163 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,163 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:58,163 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,163 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,163 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,164 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:58,164 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:58,165 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,170 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,170 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,171 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,172 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)
[2025-02-06 19:50:58,173 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
[2025-02-06 19:50:58,174 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,184 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,184 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:58,184 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,184 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,184 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,184 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:58,184 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:58,185 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,191 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,191 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,191 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,193 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)
[2025-02-06 19:50:58,193 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
[2025-02-06 19:50:58,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
[2025-02-06 19:50:58,205 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,205 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:58,205 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,205 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,205 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,205 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:58,205 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:58,206 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,212 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,212 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,212 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,214 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)
[2025-02-06 19:50:58,215 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
[2025-02-06 19:50:58,216 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,226 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,226 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:58,226 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,226 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,226 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,226 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:58,226 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:58,227 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,233 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,233 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,233 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,235 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)
[2025-02-06 19:50:58,236 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
[2025-02-06 19:50:58,237 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,247 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,247 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:58,247 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,247 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,247 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,247 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:58,247 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:58,248 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,254 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,255 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,255 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,256 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)
[2025-02-06 19:50:58,258 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
[2025-02-06 19:50:58,258 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,268 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,269 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2025-02-06 19:50:58,269 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,269 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,269 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,269 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2025-02-06 19:50:58,269 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2025-02-06 19:50:58,270 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,276 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,276 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,276 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,278 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)
[2025-02-06 19:50:58,279 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
[2025-02-06 19:50:58,280 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,290 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,291 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,291 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,291 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,292 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:58,292 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:58,294 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,300 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,300 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,300 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,302 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)
[2025-02-06 19:50:58,303 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
[2025-02-06 19:50:58,304 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,314 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,314 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,314 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,314 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,315 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:58,315 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:58,318 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,323 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
[2025-02-06 19:50:58,323 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,323 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,325 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)
[2025-02-06 19:50:58,326 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
[2025-02-06 19:50:58,327 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,337 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,337 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,337 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,337 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,341 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:58,341 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:58,351 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,356 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
[2025-02-06 19:50:58,357 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,357 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,359 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)
[2025-02-06 19:50:58,360 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
[2025-02-06 19:50:58,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
[2025-02-06 19:50:58,370 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,370 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,370 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,371 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,372 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:58,372 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:58,374 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,380 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,380 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,380 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,382 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)
[2025-02-06 19:50:58,383 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
[2025-02-06 19:50:58,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
[2025-02-06 19:50:58,393 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,393 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,393 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,394 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,396 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:58,396 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:58,399 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,404 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
[2025-02-06 19:50:58,404 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,404 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,406 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)
[2025-02-06 19:50:58,407 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
[2025-02-06 19:50:58,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
[2025-02-06 19:50:58,417 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,417 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,417 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,418 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,418 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:58,418 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:58,421 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,426 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,426 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,426 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,428 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)
[2025-02-06 19:50:58,430 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
[2025-02-06 19:50:58,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
[2025-02-06 19:50:58,441 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,441 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,441 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,441 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,442 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:58,442 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:58,444 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,451 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,451 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,452 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,453 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)
[2025-02-06 19:50:58,454 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
[2025-02-06 19:50:58,455 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,464 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,465 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,465 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,465 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,466 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:58,466 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:58,469 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,475 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,475 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,475 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,477 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)
[2025-02-06 19:50:58,478 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
[2025-02-06 19:50:58,479 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,488 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,489 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,489 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,489 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,490 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:58,490 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:58,492 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,497 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,498 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,498 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,499 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)
[2025-02-06 19:50:58,500 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
[2025-02-06 19:50:58,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
[2025-02-06 19:50:58,518 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,519 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,519 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,519 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,521 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:58,521 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:58,525 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,530 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,531 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,531 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,533 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)
[2025-02-06 19:50:58,559 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
[2025-02-06 19:50:58,560 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,569 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,570 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,570 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,570 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,571 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:58,571 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:58,575 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,581 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0
[2025-02-06 19:50:58,581 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,581 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,583 INFO  L229       MonitoredProcess]: Starting monitored process 128 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)
[2025-02-06 19:50:58,585 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process
[2025-02-06 19:50:58,585 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,595 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,596 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,596 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,596 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,598 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:58,598 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:58,608 INFO  L488          LassoAnalysis]: Proving termination failed for this template and these settings.
[2025-02-06 19:50:58,618 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0
[2025-02-06 19:50:58,618 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,618 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,621 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)
[2025-02-06 19:50:58,621 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
[2025-02-06 19:50:58,622 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2025-02-06 19:50:58,632 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2025-02-06 19:50:58,632 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2025-02-06 19:50:58,632 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2025-02-06 19:50:58,632 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2025-02-06 19:50:58,636 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2025-02-06 19:50:58,636 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2025-02-06 19:50:58,643 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2025-02-06 19:50:58,660 INFO  L443   ModelExtractionUtils]: Simplification made 6 calls to the SMT solver.
[2025-02-06 19:50:58,661 INFO  L444   ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero.
[2025-02-06 19:50:58,661 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2025-02-06 19:50:58,661 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:50:58,663 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)
[2025-02-06 19:50:58,664 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
[2025-02-06 19:50:58,665 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2025-02-06 19:50:58,676 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2025-02-06 19:50:58,676 INFO  L474          LassoAnalysis]: Proved termination.
[2025-02-06 19:50:58,676 INFO  L476          LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select (select #memory_int#3 func_to_recursive_line_22_to_23_0_#in~b.base) 0)_2) = -2*v_rep(select (select #memory_int#3 func_to_recursive_line_22_to_23_0_#in~b.base) 0)_2 + 11
Supporting invariants []
[2025-02-06 19:50:58,682 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
[2025-02-06 19:50:58,712 INFO  L156   tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed
[2025-02-06 19:50:58,714 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3
[2025-02-06 19:50:58,714 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL]
[2025-02-06 19:50:58,714 WARN  L970   BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~b!base,<IMPLEMENTATION_INPARAM,func_to_recursive_line_22_to_23_0>]]]
[2025-02-06 19:50:58,733 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:50:58,831 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes.
[2025-02-06 19:50:59,058 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements.
[2025-02-06 19:50:59,059 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:50:59,059 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:50:59,070 INFO  L256         TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 114 conjuncts are in the unsatisfiable core
[2025-02-06 19:50:59,079 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:50:59,530 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0
[2025-02-06 19:51:00,766 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-02-06 19:51:00,838 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-02-06 19:51:00,842 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:51:00,842 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:51:00,845 INFO  L256         TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 34 conjuncts are in the unsatisfiable core
[2025-02-06 19:51:00,847 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:51:01,018 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20
[2025-02-06 19:51:01,034 INFO  L134       CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked.
[2025-02-06 19:51:01,035 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates 
[2025-02-06 19:51:01,036 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 137 transitions. cyclomatic complexity: 26 Second operand  has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-02-06 19:51:01,226 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 137 transitions. cyclomatic complexity: 26. Second operand  has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 150 states and 172 transitions. Complement of second has 26 states.
[2025-02-06 19:51:01,228 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 5 stem states 5 non-accepting loop states 1 accepting loop states 
[2025-02-06 19:51:01,228 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-02-06 19:51:01,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions.
[2025-02-06 19:51:01,229 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 261 letters. Loop has 39 letters.
[2025-02-06 19:51:01,230 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:51:01,230 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-02-06 19:51:01,244 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:51:01,333 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes.
[2025-02-06 19:51:01,552 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements.
[2025-02-06 19:51:01,553 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:51:01,553 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:51:01,567 INFO  L256         TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 114 conjuncts are in the unsatisfiable core
[2025-02-06 19:51:01,577 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:51:02,980 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-02-06 19:51:03,014 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-02-06 19:51:03,015 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:51:03,015 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:51:03,017 INFO  L256         TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 35 conjuncts are in the unsatisfiable core
[2025-02-06 19:51:03,018 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:51:03,190 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20
[2025-02-06 19:51:03,207 INFO  L134       CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked.
[2025-02-06 19:51:03,207 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 5 loop predicates 
[2025-02-06 19:51:03,208 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 137 transitions. cyclomatic complexity: 26 Second operand  has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-02-06 19:51:03,417 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 137 transitions. cyclomatic complexity: 26. Second operand  has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 150 states and 172 transitions. Complement of second has 26 states.
[2025-02-06 19:51:03,417 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 5 stem states 5 non-accepting loop states 1 accepting loop states 
[2025-02-06 19:51:03,417 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-02-06 19:51:03,418 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions.
[2025-02-06 19:51:03,418 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 261 letters. Loop has 39 letters.
[2025-02-06 19:51:03,418 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:51:03,420 INFO  L689   stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2025-02-06 19:51:03,441 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:51:03,531 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes.
[2025-02-06 19:51:03,766 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements.
[2025-02-06 19:51:03,767 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:51:03,767 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:51:03,780 INFO  L256         TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 114 conjuncts are in the unsatisfiable core
[2025-02-06 19:51:03,786 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:51:05,280 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-02-06 19:51:05,322 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-02-06 19:51:05,323 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 19:51:05,323 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:51:05,327 INFO  L256         TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 136 conjuncts are in the unsatisfiable core
[2025-02-06 19:51:05,330 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:51:05,355 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7
[2025-02-06 19:51:05,900 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20
[2025-02-06 19:51:05,935 INFO  L134       CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked.
[2025-02-06 19:51:05,936 INFO  L141   lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 14 loop predicates 
[2025-02-06 19:51:05,936 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 137 transitions. cyclomatic complexity: 26 Second operand  has 20 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 17 states have internal predecessors, (29), 7 states have call successors, (10), 4 states have call predecessors, (10), 8 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11)
[2025-02-06 19:51:06,574 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 137 transitions. cyclomatic complexity: 26. Second operand  has 20 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 17 states have internal predecessors, (29), 7 states have call successors, (10), 4 states have call predecessors, (10), 8 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11) Result 318 states and 379 transitions. Complement of second has 54 states.
[2025-02-06 19:51:06,575 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 6 stem states 13 non-accepting loop states 1 accepting loop states 
[2025-02-06 19:51:06,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 17 states have internal predecessors, (29), 7 states have call successors, (10), 4 states have call predecessors, (10), 8 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11)
[2025-02-06 19:51:06,576 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 50 transitions.
[2025-02-06 19:51:06,576 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 20 states and 50 transitions. Stem has 261 letters. Loop has 39 letters.
[2025-02-06 19:51:06,578 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:51:06,578 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 20 states and 50 transitions. Stem has 300 letters. Loop has 39 letters.
[2025-02-06 19:51:06,582 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:51:06,582 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 20 states and 50 transitions. Stem has 261 letters. Loop has 78 letters.
[2025-02-06 19:51:06,582 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2025-02-06 19:51:06,582 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 379 transitions.
[2025-02-06 19:51:06,585 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-06 19:51:06,587 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 289 states and 350 transitions.
[2025-02-06 19:51:06,589 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 48
[2025-02-06 19:51:06,589 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 50
[2025-02-06 19:51:06,590 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 289 states and 350 transitions.
[2025-02-06 19:51:06,590 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2025-02-06 19:51:06,590 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 289 states and 350 transitions.
[2025-02-06 19:51:06,590 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 289 states and 350 transitions.
[2025-02-06 19:51:06,603 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 279.
[2025-02-06 19:51:06,603 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 279 states, 160 states have (on average 1.125) internal successors, (180), 178 states have internal predecessors, (180), 46 states have call successors, (46), 29 states have call predecessors, (46), 73 states have return successors, (112), 71 states have call predecessors, (112), 41 states have call successors, (112)
[2025-02-06 19:51:06,604 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 338 transitions.
[2025-02-06 19:51:06,605 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 279 states and 338 transitions.
[2025-02-06 19:51:06,605 INFO  L432   stractBuchiCegarLoop]: Abstraction has 279 states and 338 transitions.
[2025-02-06 19:51:06,605 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 15 ============
[2025-02-06 19:51:06,605 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 279 states and 338 transitions.
[2025-02-06 19:51:06,606 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2025-02-06 19:51:06,606 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2025-02-06 19:51:06,606 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2025-02-06 19:51:06,611 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [50, 50, 43, 43, 43, 8, 7, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:51:06,611 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 19:51:06,611 INFO  L752   eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);"< "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#39#return;" "assume true;" >"#47#return;" "call #t~mem11 := read~int#1(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);"< "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" 
[2025-02-06 19:51:06,611 INFO  L754   eck$LassoCheckResult]: Loop: "call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);"< "~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);"< "~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#37#return;" "assume true;" >"#41#return;" 
[2025-02-06 19:51:06,611 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:51:06,611 INFO  L85        PathProgramCache]: Analyzing trace with hash 1228283512, now seen corresponding path program 4 times
[2025-02-06 19:51:06,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:51:06,612 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486296081]
[2025-02-06 19:51:06,612 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-06 19:51:06,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:51:06,634 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 303 statements into 2 equivalence classes.
[2025-02-06 19:51:06,666 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 302 of 303 statements.
[2025-02-06 19:51:06,666 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-02-06 19:51:06,666 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:51:08,940 INFO  L134       CoverageAnalysis]: Checked inductivity of 5955 backedges. 1494 proven. 32 refuted. 0 times theorem prover too weak. 4429 trivial. 0 not checked.
[2025-02-06 19:51:08,940 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:51:08,940 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486296081]
[2025-02-06 19:51:08,940 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486296081] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 19:51:08,940 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510369106]
[2025-02-06 19:51:08,940 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-02-06 19:51:08,940 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 19:51:08,941 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:51:08,942 INFO  L229       MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 19:51:08,944 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process
[2025-02-06 19:51:09,155 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 303 statements into 2 equivalence classes.
[2025-02-06 19:51:09,344 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 302 of 303 statements.
[2025-02-06 19:51:09,344 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-02-06 19:51:09,344 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:51:09,355 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1774 conjuncts, 109 conjuncts are in the unsatisfiable core
[2025-02-06 19:51:09,361 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:51:09,368 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1
[2025-02-06 19:51:09,573 INFO  L134       CoverageAnalysis]: Checked inductivity of 5955 backedges. 1490 proven. 26 refuted. 0 times theorem prover too weak. 4439 trivial. 0 not checked.
[2025-02-06 19:51:09,573 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 19:51:12,347 INFO  L134       CoverageAnalysis]: Checked inductivity of 5955 backedges. 1490 proven. 77 refuted. 0 times theorem prover too weak. 4388 trivial. 0 not checked.
[2025-02-06 19:51:12,347 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510369106] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 19:51:12,347 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 19:51:12,347 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 29] total 41
[2025-02-06 19:51:12,347 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255086618]
[2025-02-06 19:51:12,347 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 19:51:12,348 INFO  L757   eck$LassoCheckResult]: stem already infeasible
[2025-02-06 19:51:12,348 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 19:51:12,348 INFO  L85        PathProgramCache]: Analyzing trace with hash 1621477672, now seen corresponding path program 3 times
[2025-02-06 19:51:12,348 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 19:51:12,348 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030124251]
[2025-02-06 19:51:12,348 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-06 19:51:12,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 19:51:12,354 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 8 equivalence classes.
[2025-02-06 19:51:12,360 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 44 of 44 statements.
[2025-02-06 19:51:12,360 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s)
[2025-02-06 19:51:12,360 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:51:12,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 133 backedges. 52 proven. 48 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2025-02-06 19:51:12,874 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 19:51:12,874 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030124251]
[2025-02-06 19:51:12,874 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030124251] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-06 19:51:12,874 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141913318]
[2025-02-06 19:51:12,874 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-02-06 19:51:12,874 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-06 19:51:12,874 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 19:51:12,876 INFO  L229       MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-06 19:51:12,877 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process
[2025-02-06 19:51:13,041 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 8 equivalence classes.
[2025-02-06 19:51:13,079 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 44 of 44 statements.
[2025-02-06 19:51:13,079 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s)
[2025-02-06 19:51:13,079 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 19:51:13,082 INFO  L256         TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 103 conjuncts are in the unsatisfiable core
[2025-02-06 19:51:13,084 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-06 19:51:13,091 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1
[2025-02-06 19:51:13,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 133 backedges. 56 proven. 26 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked.
[2025-02-06 19:51:13,303 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-06 19:51:15,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 133 backedges. 56 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-06 19:51:15,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [141913318] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-06 19:51:15,239 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-06 19:51:15,240 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 29] total 43
[2025-02-06 19:51:15,240 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746274606]
[2025-02-06 19:51:15,240 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-06 19:51:15,240 INFO  L769   eck$LassoCheckResult]: loop already infeasible
[2025-02-06 19:51:15,240 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 19:51:15,240 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2025-02-06 19:51:15,241 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1604, Unknown=0, NotChecked=0, Total=1892
[2025-02-06 19:51:15,241 INFO  L87              Difference]: Start difference. First operand 279 states and 338 transitions. cyclomatic complexity: 75 Second operand  has 44 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 35 states have internal predecessors, (41), 15 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (22), 10 states have call predecessors, (22), 14 states have call successors, (22)
[2025-02-06 19:51:15,775 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-06 19:51:15,775 INFO  L93              Difference]: Finished difference Result 204 states and 232 transitions.
[2025-02-06 19:51:15,775 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 232 transitions.
[2025-02-06 19:51:15,780 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2025-02-06 19:51:15,780 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 0 states and 0 transitions.
[2025-02-06 19:51:15,780 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2025-02-06 19:51:15,780 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2025-02-06 19:51:15,780 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2025-02-06 19:51:15,780 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2025-02-06 19:51:15,780 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-06 19:51:15,780 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-06 19:51:15,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-02-06 19:51:15,781 INFO  L432   stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-06 19:51:15,781 INFO  L338   stractBuchiCegarLoop]: ======== Iteration 16 ============
[2025-02-06 19:51:15,781 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions.
[2025-02-06 19:51:15,781 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2025-02-06 19:51:15,781 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is true
[2025-02-06 19:51:15,789 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:51:15 BoogieIcfgContainer
[2025-02-06 19:51:15,792 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2025-02-06 19:51:15,793 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-06 19:51:15,796 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-06 19:51:15,797 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-06 19:51:15,797 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:50:00" (3/4) ...
[2025-02-06 19:51:15,798 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-02-06 19:51:15,799 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-06 19:51:15,799 INFO  L158              Benchmark]: Toolchain (without parser) took 76000.67ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 112.0MB in the beginning and 265.0MB in the end (delta: -153.0MB). Peak memory consumption was 492.2MB. Max. memory is 16.1GB.
[2025-02-06 19:51:15,799 INFO  L158              Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 19:51:15,799 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 165.55ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 101.4MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-06 19:51:15,799 INFO  L158              Benchmark]: Boogie Procedure Inliner took 17.85ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 19:51:15,799 INFO  L158              Benchmark]: Boogie Preprocessor took 26.02ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 19:51:15,799 INFO  L158              Benchmark]: IcfgBuilder took 301.69ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 84.7MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-06 19:51:15,800 INFO  L158              Benchmark]: BuchiAutomizer took 75477.52ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 84.2MB in the beginning and 269.2MB in the end (delta: -185.0MB). Peak memory consumption was 467.0MB. Max. memory is 16.1GB.
[2025-02-06 19:51:15,800 INFO  L158              Benchmark]: Witness Printer took 5.97ms. Allocated memory is still 788.5MB. Free memory was 269.2MB in the beginning and 265.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 19:51:15,801 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 165.55ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 101.4MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 17.85ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 26.02ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 301.69ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 84.7MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * BuchiAutomizer took 75477.52ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 84.2MB in the beginning and 269.2MB in the end (delta: -185.0MB). Peak memory consumption was 467.0MB. Max. memory is 16.1GB.
 * Witness Printer took 5.97ms. Allocated memory is still 788.5MB. Free memory was 269.2MB in the beginning and 265.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_int#1
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~a!base,<IMPLEMENTATION_INPARAM,func_to_recursive_line_21_to_22_0>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_int#3
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~b!base,<IMPLEMENTATION_INPARAM,func_to_recursive_line_22_to_23_0>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_int#2
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~c!base,<IMPLEMENTATION_INPARAM,func_to_recursive_line_23_to_23_0>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_int#2
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~c!base,<IMPLEMENTATION_INPARAM,func_to_recursive_line_23_to_23_0>]]]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Unknown variable: #memory_int#3
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL]
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~b!base,<IMPLEMENTATION_INPARAM,func_to_recursive_line_22_to_23_0>]]]
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Constructed decomposition of program
    Your program was decomposed into 15 terminating modules (10 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 11 locations. One deterministic module has affine ranking function null and consists of 10 locations. One nondeterministic module has affine ranking function null and consists of 12 locations. One nondeterministic module has affine ranking function null and consists of 20 locations. 10 modules have a trivial ranking function, the largest among these consists of 44 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 75.4s and 16 iterations.  TraceHistogramMax:50. Analysis of lassos took 59.5s. Construction of modules took 1.9s. Büchi inclusion checks took 13.8s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 56 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1.	Nontrivial modules had stage [3, 0, 2, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 4336/4401	HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 614 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 603 mSDsluCounter, 1747 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1443 mSDsCounter, 610 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2667 IncrementalHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 610 mSolverCounterUnsat, 304 mSDtfsCounter, 2667 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks:   Lassos: inital273 mio100 ax100 hnf100 lsp94 ukn66 mio100 lsp21 div100 bol100 ite100 ukn100 eq215 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 0	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.0s	InitialAbstractionConstructionTime: 0.0s
  - TerminationAnalysisResult: Termination proven
    Buchi Automizer proved that your program is terminating
RESULT: Ultimate proved your program to be correct!
[2025-02-06 19:51:15,815 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Ended with exit code 0
[2025-02-06 19:51:16,024 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Ended with exit code 0
[2025-02-06 19:51:16,221 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-02-06 19:51:16,426 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2025-02-06 19:51:16,626 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-02-06 19:51:16,826 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-02-06 19:51:17,026 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-02-06 19:51:17,226 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-02-06 19:51:17,449 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-06 19:51:17,645 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE