./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/string-2.i --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/loops/string-2.i -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 fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:30:57,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:30:57,155 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:30:57,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:30:57,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:30:57,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:30:57,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:30:57,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:30:57,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:30:57,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:30:57,183 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:30:57,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:30:57,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:30:57,184 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:30:57,184 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:30:57,184 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:30:57,184 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:30:57,184 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:30:57,184 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:30:57,184 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:30:57,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:30:57,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:30:57,184 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:30:57,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:30:57,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:30:57,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:30:57,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:30:57,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:30:57,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:30:57,185 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:30:57,185 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:30:57,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:30:57,185 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:30:57,185 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:30:57,185 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:30:57,185 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:30:57,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:30:57,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:30:57,185 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:30:57,185 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:30:57,185 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 -> fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 [2025-02-06 19:30:57,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:30:57,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:30:57,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:30:57,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:30:57,467 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:30:57,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2025-02-06 19:30:58,926 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17de93b81/f34e332d36b24762980572817f879430/FLAGf4337a9e3 [2025-02-06 19:30:59,182 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:30:59,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2025-02-06 19:30:59,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17de93b81/f34e332d36b24762980572817f879430/FLAGf4337a9e3 [2025-02-06 19:30:59,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17de93b81/f34e332d36b24762980572817f879430 [2025-02-06 19:30:59,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:30:59,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:30:59,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:30:59,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:30:59,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:30:59,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:30:59" (1/1) ... [2025-02-06 19:30:59,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd397d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:30:59, skipping insertion in model container [2025-02-06 19:30:59,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:30:59" (1/1) ... [2025-02-06 19:30:59,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:30:59,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:30:59,364 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:30:59,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:30:59,384 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:30:59,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:30:59 WrapperNode [2025-02-06 19:30:59,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:30:59,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:30:59,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:30:59,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:30:59,390 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:30:59" (1/1) ... [2025-02-06 19:30:59,393 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:30:59" (1/1) ... [2025-02-06 19:30:59,403 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 118 [2025-02-06 19:30:59,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:30:59,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:30:59,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:30:59,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:30:59,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:30:59" (1/1) ... [2025-02-06 19:30:59,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:30:59" (1/1) ... [2025-02-06 19:30:59,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:30:59" (1/1) ... [2025-02-06 19:30:59,424 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-02-06 19:30:59,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:30:59" (1/1) ... [2025-02-06 19:30:59,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:30:59" (1/1) ... [2025-02-06 19:30:59,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:30:59" (1/1) ... [2025-02-06 19:30:59,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:30:59" (1/1) ... [2025-02-06 19:30:59,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:30:59" (1/1) ... [2025-02-06 19:30:59,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:30:59" (1/1) ... [2025-02-06 19:30:59,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:30:59,431 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:30:59,431 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:30:59,431 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:30:59,432 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:30:59" (1/1) ... [2025-02-06 19:30:59,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:30:59,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:30:59,457 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:30:59,461 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:30:59,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 19:30:59,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 19:30:59,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 19:30:59,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 19:30:59,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 19:30:59,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:30:59,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 19:30:59,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 19:30:59,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:30:59,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:30:59,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:30:59,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 19:30:59,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 19:30:59,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:30:59,523 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:30:59,525 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:30:59,663 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: call ULTIMATE.dealloc(main_~#string_A~0#1.base, main_~#string_A~0#1.offset);havoc main_~#string_A~0#1.base, main_~#string_A~0#1.offset;call ULTIMATE.dealloc(main_~#string_B~0#1.base, main_~#string_B~0#1.offset);havoc main_~#string_B~0#1.base, main_~#string_B~0#1.offset; [2025-02-06 19:30:59,670 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-06 19:30:59,670 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:30:59,679 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:30:59,679 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:30:59,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:30:59 BoogieIcfgContainer [2025-02-06 19:30:59,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:30:59,680 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:30:59,680 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:30:59,684 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:30:59,684 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:30:59,685 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:30:59" (1/3) ... [2025-02-06 19:30:59,685 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77d7f43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:30:59, skipping insertion in model container [2025-02-06 19:30:59,685 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:30:59,685 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:30:59" (2/3) ... [2025-02-06 19:30:59,686 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77d7f43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:30:59, skipping insertion in model container [2025-02-06 19:30:59,686 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:30:59,686 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:30:59" (3/3) ... [2025-02-06 19:30:59,687 INFO L363 chiAutomizerObserver]: Analyzing ICFG string-2.i [2025-02-06 19:30:59,722 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:30:59,722 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:30:59,722 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:30:59,722 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:30:59,722 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:30:59,722 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:30:59,722 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:30:59,722 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:30:59,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:30:59,752 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 8 [2025-02-06 19:30:59,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:30:59,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:30:59,760 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:30:59,760 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:30:59,761 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:30:59,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:30:59,766 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 8 [2025-02-06 19:30:59,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:30:59,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:30:59,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:30:59,767 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:30:59,770 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" [2025-02-06 19:30:59,775 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" [2025-02-06 19:30:59,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:59,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2656, now seen corresponding path program 1 times [2025-02-06 19:30:59,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:30:59,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26024225] [2025-02-06 19:30:59,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:30:59,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:30:59,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:30:59,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:30:59,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:59,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:59,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:30:59,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:30:59,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:30:59,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:59,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:59,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:30:59,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:59,899 INFO L85 PathProgramCache]: Analyzing trace with hash 82, now seen corresponding path program 1 times [2025-02-06 19:30:59,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:30:59,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877186137] [2025-02-06 19:30:59,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:30:59,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:30:59,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:30:59,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:30:59,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:59,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:59,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:30:59,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:30:59,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:30:59,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:59,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:59,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:30:59,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:30:59,928 INFO L85 PathProgramCache]: Analyzing trace with hash 82387, now seen corresponding path program 1 times [2025-02-06 19:30:59,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:30:59,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459291232] [2025-02-06 19:30:59,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:30:59,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:30:59,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:30:59,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:30:59,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:59,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:59,956 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:30:59,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:30:59,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:30:59,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:30:59,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:30:59,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:00,300 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:31:00,300 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:31:00,300 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:31:00,300 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:31:00,301 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:31:00,301 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:00,301 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:31:00,301 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:31:00,301 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration1_Lasso [2025-02-06 19:31:00,303 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:31:00,303 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:31:00,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:00,804 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:31:00,806 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:31:00,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:00,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:00,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:00,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-06 19:31:00,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:00,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:00,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:00,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:00,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:00,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:00,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:00,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:00,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:00,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-06 19:31:00,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:00,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:00,841 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:00,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-06 19:31:00,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:00,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:00,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:00,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:00,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:00,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:00,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:00,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:00,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:00,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-06 19:31:00,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:00,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:00,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:00,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-06 19:31:00,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:00,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:00,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:00,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:00,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:00,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:00,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:00,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:00,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-06 19:31:00,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:00,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:00,897 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:00,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-06 19:31:00,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:00,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:00,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:00,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:00,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:00,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:00,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:00,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:00,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:00,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:00,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:00,932 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:00,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-06 19:31:00,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:00,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:00,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:00,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:00,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:00,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:00,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:00,971 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:31:01,005 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-06 19:31:01,006 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-02-06 19:31:01,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:01,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:01,014 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:01,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-06 19:31:01,019 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:31:01,030 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:31:01,031 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:31:01,031 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 9*v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_1 - 2*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-06 19:31:01,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:01,061 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-02-06 19:31:01,068 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:31:01,068 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:31:01,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:01,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:01,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:01,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:01,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:01,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:31:01,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:01,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:31:01,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:31:01,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:01,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:01,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:31:01,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:01,114 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:31:01,130 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-06 19:31:01,132 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:01,150 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 40 transitions. Complement of second has 3 states. [2025-02-06 19:31:01,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:31:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-02-06 19:31:01,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-02-06 19:31:01,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:01,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-02-06 19:31:01,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:01,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-06 19:31:01,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:01,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 40 transitions. [2025-02-06 19:31:01,161 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-02-06 19:31:01,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 15 states and 23 transitions. [2025-02-06 19:31:01,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-02-06 19:31:01,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-02-06 19:31:01,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 23 transitions. [2025-02-06 19:31:01,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:31:01,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 23 transitions. [2025-02-06 19:31:01,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 23 transitions. [2025-02-06 19:31:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-06 19:31:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:01,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2025-02-06 19:31:01,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 23 transitions. [2025-02-06 19:31:01,177 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 23 transitions. [2025-02-06 19:31:01,177 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:31:01,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 23 transitions. [2025-02-06 19:31:01,178 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-02-06 19:31:01,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:01,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:01,178 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:31:01,178 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:31:01,178 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" [2025-02-06 19:31:01,178 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-02-06 19:31:01,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:01,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2554015, now seen corresponding path program 1 times [2025-02-06 19:31:01,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:01,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825735443] [2025-02-06 19:31:01,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:01,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:01,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:31:01,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:31:01,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:01,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:01,252 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:31:01,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:31:01,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825735443] [2025-02-06 19:31:01,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825735443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:31:01,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:31:01,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:31:01,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006362093] [2025-02-06 19:31:01,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:31:01,254 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:31:01,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash 75, now seen corresponding path program 1 times [2025-02-06 19:31:01,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:01,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156861053] [2025-02-06 19:31:01,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:01,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:01,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:31:01,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:31:01,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:01,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:01,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:01,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:31:01,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:31:01,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:01,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:01,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:01,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:31:01,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:31:01,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:31:01,318 INFO L87 Difference]: Start difference. First operand 15 states and 23 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:31:01,334 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2025-02-06 19:31:01,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2025-02-06 19:31:01,335 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-02-06 19:31:01,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 24 transitions. [2025-02-06 19:31:01,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-06 19:31:01,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-06 19:31:01,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2025-02-06 19:31:01,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:31:01,336 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-02-06 19:31:01,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2025-02-06 19:31:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-02-06 19:31:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-02-06 19:31:01,358 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-02-06 19:31:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:31:01,359 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-02-06 19:31:01,359 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:31:01,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2025-02-06 19:31:01,360 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-02-06 19:31:01,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:01,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:01,360 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:31:01,360 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:31:01,360 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-02-06 19:31:01,360 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-02-06 19:31:01,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:01,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1840526566, now seen corresponding path program 1 times [2025-02-06 19:31:01,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:01,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565564204] [2025-02-06 19:31:01,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:01,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:31:01,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:01,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:31:01,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:01,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:31:01,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:31:01,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565564204] [2025-02-06 19:31:01,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565564204] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:31:01,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010689822] [2025-02-06 19:31:01,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:01,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:31:01,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:01,414 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:31:01,415 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:31:01,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:31:01,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:31:01,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:01,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:01,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 19:31:01,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:31:01,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:31:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:31:01,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010689822] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:31:01,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:31:01,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 19:31:01,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762209124] [2025-02-06 19:31:01,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:31:01,476 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:31:01,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash 75, now seen corresponding path program 2 times [2025-02-06 19:31:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:01,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350381460] [2025-02-06 19:31:01,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:31:01,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:01,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:31:01,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:31:01,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:31:01,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:01,481 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:01,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:31:01,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:31:01,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:01,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:01,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:01,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:31:01,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 19:31:01,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 19:31:01,516 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:01,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:31:01,557 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2025-02-06 19:31:01,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2025-02-06 19:31:01,557 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-02-06 19:31:01,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 39 transitions. [2025-02-06 19:31:01,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-06 19:31:01,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-02-06 19:31:01,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2025-02-06 19:31:01,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:31:01,559 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-02-06 19:31:01,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2025-02-06 19:31:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2025-02-06 19:31:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-02-06 19:31:01,560 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-02-06 19:31:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:31:01,564 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-02-06 19:31:01,564 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:31:01,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2025-02-06 19:31:01,565 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-02-06 19:31:01,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:01,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:01,568 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2025-02-06 19:31:01,569 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:31:01,569 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-02-06 19:31:01,569 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-02-06 19:31:01,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:01,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1932168993, now seen corresponding path program 2 times [2025-02-06 19:31:01,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:01,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333988727] [2025-02-06 19:31:01,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:31:01,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:01,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 19:31:01,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:31:01,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:31:01,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 19:31:01,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:31:01,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333988727] [2025-02-06 19:31:01,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333988727] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:31:01,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183704771] [2025-02-06 19:31:01,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:31:01,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:31:01,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:01,728 INFO L229 MonitoredProcess]: Starting monitored process 9 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:31:01,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 19:31:01,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 19:31:01,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:31:01,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:31:01,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:01,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:31:01,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 19:31:01,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:31:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 19:31:01,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183704771] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:31:01,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:31:01,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-02-06 19:31:01,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919256501] [2025-02-06 19:31:01,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:31:01,854 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:31:01,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:01,855 INFO L85 PathProgramCache]: Analyzing trace with hash 75, now seen corresponding path program 3 times [2025-02-06 19:31:01,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:01,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814303228] [2025-02-06 19:31:01,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:31:01,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:01,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:31:01,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:31:01,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:31:01,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:01,860 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:01,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:31:01,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:31:01,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:01,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:01,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:01,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:31:01,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 19:31:01,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-06 19:31:01,900 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 10 Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:31:01,948 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2025-02-06 19:31:01,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2025-02-06 19:31:01,948 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-02-06 19:31:01,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 44 transitions. [2025-02-06 19:31:01,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-02-06 19:31:01,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-02-06 19:31:01,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2025-02-06 19:31:01,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:31:01,949 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2025-02-06 19:31:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2025-02-06 19:31:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2025-02-06 19:31:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-02-06 19:31:01,950 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-02-06 19:31:01,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:31:01,953 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-02-06 19:31:01,953 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:31:01,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2025-02-06 19:31:01,954 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-02-06 19:31:01,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:01,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:01,954 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2025-02-06 19:31:01,954 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:31:01,954 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-02-06 19:31:01,954 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-02-06 19:31:01,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:01,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1384930778, now seen corresponding path program 3 times [2025-02-06 19:31:01,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:01,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983250593] [2025-02-06 19:31:01,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:31:01,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:01,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 4 equivalence classes. [2025-02-06 19:31:01,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:31:01,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 19:31:01,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:01,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:02,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:31:02,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:31:02,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:02,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:02,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:02,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash 75, now seen corresponding path program 4 times [2025-02-06 19:31:02,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:02,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825221881] [2025-02-06 19:31:02,026 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:31:02,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:02,029 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-02-06 19:31:02,030 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:31:02,030 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:31:02,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:02,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:02,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:31:02,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:31:02,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:02,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:02,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:02,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:02,039 INFO L85 PathProgramCache]: Analyzing trace with hash -16818798, now seen corresponding path program 4 times [2025-02-06 19:31:02,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:02,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817710500] [2025-02-06 19:31:02,039 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:31:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:02,056 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-02-06 19:31:02,071 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-02-06 19:31:02,071 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:31:02,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 19:31:02,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:31:02,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817710500] [2025-02-06 19:31:02,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817710500] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:31:02,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754047959] [2025-02-06 19:31:02,224 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:31:02,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:31:02,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:02,226 INFO L229 MonitoredProcess]: Starting monitored process 10 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:31:02,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 19:31:02,270 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-02-06 19:31:02,286 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-02-06 19:31:02,286 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:31:02,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:02,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 19:31:02,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 19:31:02,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 19:31:02,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754047959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:31:02,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 19:31:02,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2025-02-06 19:31:02,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978863086] [2025-02-06 19:31:02,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:31:02,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:31:02,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 19:31:02,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-02-06 19:31:02,341 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 10 Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:31:02,406 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2025-02-06 19:31:02,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2025-02-06 19:31:02,407 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-02-06 19:31:02,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 45 transitions. [2025-02-06 19:31:02,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-02-06 19:31:02,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-02-06 19:31:02,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2025-02-06 19:31:02,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:31:02,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2025-02-06 19:31:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2025-02-06 19:31:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 24. [2025-02-06 19:31:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-02-06 19:31:02,408 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-02-06 19:31:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 19:31:02,409 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-02-06 19:31:02,409 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:31:02,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2025-02-06 19:31:02,409 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-02-06 19:31:02,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:02,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:02,410 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2025-02-06 19:31:02,410 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:31:02,410 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" [2025-02-06 19:31:02,410 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" [2025-02-06 19:31:02,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:02,414 INFO L85 PathProgramCache]: Analyzing trace with hash -521382727, now seen corresponding path program 1 times [2025-02-06 19:31:02,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:02,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416614417] [2025-02-06 19:31:02,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:02,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:02,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:31:02,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:31:02,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:02,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:02,428 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:02,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:31:02,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:31:02,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:02,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:02,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:02,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:02,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2112, now seen corresponding path program 1 times [2025-02-06 19:31:02,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:02,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321464385] [2025-02-06 19:31:02,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:02,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:02,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:02,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:02,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:02,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:02,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:02,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:02,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:02,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:02,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:02,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:02,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:02,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1462374136, now seen corresponding path program 1 times [2025-02-06 19:31:02,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:02,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114920474] [2025-02-06 19:31:02,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:02,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:02,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:31:02,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:31:02,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:02,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:02,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:02,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:31:02,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:31:02,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:02,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:02,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:05,509 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:31:05,509 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:31:05,509 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:31:05,509 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:31:05,509 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:31:05,509 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:05,510 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:31:05,510 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:31:05,510 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration6_Lasso [2025-02-06 19:31:05,510 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:31:05,510 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:31:05,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:05,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:06,081 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:31:06,081 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:31:06,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,086 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:31:06,087 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:31:06,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:31:06,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:06,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:06,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:06,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,121 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:31:06,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,123 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:31:06,124 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:31:06,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:06,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:06,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:06,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:06,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,147 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:31:06,148 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:31:06,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:06,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:06,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:06,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,167 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:31:06,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,169 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:31:06,170 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:31:06,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:06,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:06,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:06,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:06,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,192 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:31:06,193 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:31:06,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:06,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:06,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:06,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,210 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:31:06,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,212 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:31:06,213 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:31:06,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:31:06,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:06,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:06,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:06,225 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,231 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:31:06,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,233 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:31:06,234 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:31:06,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:06,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:06,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:06,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:06,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,254 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:31:06,255 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:31:06,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:06,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:06,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:06,268 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,274 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:31:06,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,276 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:31:06,285 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:31:06,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:06,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:06,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,308 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:31:06,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,311 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:31:06,313 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:31:06,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:06,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:06,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,341 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:31:06,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,343 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:31:06,344 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:31:06,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:06,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:06,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:06,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:06,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:06,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,365 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:31:06,365 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:31:06,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:06,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:06,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:06,378 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-06 19:31:06,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,386 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:31:06,387 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:31:06,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:06,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:06,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:06,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,405 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:31:06,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,407 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:31:06,408 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:31:06,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:06,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:06,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:06,422 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-06 19:31:06,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,437 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:31:06,438 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:31:06,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:06,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:06,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-06 19:31:06,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,466 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:31:06,467 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:31:06,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:06,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:06,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:06,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-06 19:31:06,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,493 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:31:06,494 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:31:06,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:06,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:06,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:06,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-06 19:31:06,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,529 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:31:06,530 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:31:06,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:06,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:06,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:06,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-06 19:31:06,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,574 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:31:06,581 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:31:06,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:06,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:06,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:06,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,602 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:31:06,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,605 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:31:06,607 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:31:06,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:06,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:06,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:06,629 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-06 19:31:06,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,649 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:31:06,650 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:31:06,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:06,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:06,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:06,666 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,672 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:31:06,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,674 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:31:06,678 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:31:06,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:06,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:06,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:06,692 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:06,699 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:31:06,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,701 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:31:06,705 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:31:06,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:06,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:06,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:06,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:06,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:06,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:06,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:06,722 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:31:06,729 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-06 19:31:06,729 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-06 19:31:06,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:06,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:06,732 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:31:06,733 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:31:06,734 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:31:06,745 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-06 19:31:06,745 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:31:06,745 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_2, ULTIMATE.start_main_~nc_A~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_2 - 1*ULTIMATE.start_main_~nc_A~0#1 Supporting invariants [1*ULTIMATE.start_main_~#string_A~0#1.offset >= 0] [2025-02-06 19:31:06,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-06 19:31:06,775 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-02-06 19:31:06,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:31:06,776 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:31:06,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:06,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:31:06,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:31:06,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:06,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:06,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 19:31:06,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:06,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:06,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:06,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:06,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:06,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:31:06,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:06,941 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:31:06,941 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-02-06 19:31:06,941 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:06,984 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 39 transitions. Complement of second has 5 states. [2025-02-06 19:31:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:31:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2025-02-06 19:31:06,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 2 letters. [2025-02-06 19:31:06,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:06,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 2 letters. [2025-02-06 19:31:06,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:06,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2025-02-06 19:31:06,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:06,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2025-02-06 19:31:06,986 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:31:06,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 30 transitions. [2025-02-06 19:31:06,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-02-06 19:31:06,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-02-06 19:31:06,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2025-02-06 19:31:06,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:31:06,987 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-02-06 19:31:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2025-02-06 19:31:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-06 19:31:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-02-06 19:31:06,988 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-02-06 19:31:06,988 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-02-06 19:31:06,988 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:31:06,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2025-02-06 19:31:06,988 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:31:06,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:06,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:06,989 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:31:06,989 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:31:06,989 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" [2025-02-06 19:31:06,989 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" [2025-02-06 19:31:06,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:06,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1911042040, now seen corresponding path program 1 times [2025-02-06 19:31:06,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:06,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941570583] [2025-02-06 19:31:06,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:06,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:06,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 19:31:07,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:31:07,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:07,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:07,006 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:07,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 19:31:07,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:31:07,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:07,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:07,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:07,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:07,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1888, now seen corresponding path program 1 times [2025-02-06 19:31:07,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:07,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905081253] [2025-02-06 19:31:07,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:07,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:07,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:07,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:07,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:07,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:07,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:07,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:07,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:07,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:07,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:07,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:07,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:07,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1734603175, now seen corresponding path program 1 times [2025-02-06 19:31:07,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:07,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037914252] [2025-02-06 19:31:07,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:07,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:07,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 19:31:07,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:31:07,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:07,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:07,048 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:07,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 19:31:07,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:31:07,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:07,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:07,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:10,067 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:31:10,415 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:31:10,415 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:31:10,415 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:31:10,415 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:31:10,415 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:31:10,415 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:10,415 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:31:10,415 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:31:10,415 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration7_Lasso [2025-02-06 19:31:10,415 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:31:10,415 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:31:10,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:10,961 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:31:10,961 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:31:10,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:10,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:10,964 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:31:10,966 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:31:10,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:10,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:10,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:10,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:10,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:10,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:10,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:10,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:10,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:10,983 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:31:10,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:10,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:10,985 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:31:10,986 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:31:10,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:10,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:10,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:10,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:10,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:10,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:10,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:11,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:11,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:11,010 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:31:11,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,019 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:31:11,019 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:31:11,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:11,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:11,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:11,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:11,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:11,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:11,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:11,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:11,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:11,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-06 19:31:11,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,040 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:31:11,041 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:31:11,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:11,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:11,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:11,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:11,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:11,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:11,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:11,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:11,054 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:11,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:31:11,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,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:31:11,068 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:31:11,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:11,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:11,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:11,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:11,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:11,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:11,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:11,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:11,084 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:11,089 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:31:11,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,092 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:31:11,093 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:31:11,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:11,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:11,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:11,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:11,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:11,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:11,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:11,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:11,115 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:31:11,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,117 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:31:11,118 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:31:11,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:11,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:11,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:11,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:11,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:11,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:11,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:11,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:11,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-06 19:31:11,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,139 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:31:11,141 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:31:11,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:11,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:11,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:11,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:11,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:11,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:11,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:11,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:11,160 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:31:11,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,163 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:31:11,164 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:31:11,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:11,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:11,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:11,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:11,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:11,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:11,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:11,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:11,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:11,188 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:31:11,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,190 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:31:11,192 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:31:11,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:11,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:11,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:11,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:11,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:11,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:11,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:11,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:11,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:11,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,214 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:31:11,215 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:31:11,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:11,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:11,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:11,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:11,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:11,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:11,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:11,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:11,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:11,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,240 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:31:11,242 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:31:11,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:11,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:11,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:11,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:11,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:11,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:11,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:11,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:11,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:11,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,265 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:31:11,266 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:31:11,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:11,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:11,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:11,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:11,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:11,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:11,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:11,280 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:11,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-02-06 19:31:11,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,287 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:31:11,289 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:31:11,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:11,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:11,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:11,299 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:31:11,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:11,302 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-02-06 19:31:11,302 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:31:11,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:11,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-02-06 19:31:11,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,317 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:31:11,317 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:31:11,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:11,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:11,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:11,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:11,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:11,330 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:11,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:11,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:11,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:11,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,341 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:31:11,342 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:31:11,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:31:11,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:11,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:11,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:11,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:11,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:11,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:11,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:11,363 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:31:11,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,367 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:31:11,367 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:31:11,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:11,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:11,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:11,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:11,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:11,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:11,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:11,385 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:31:11,398 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-02-06 19:31:11,398 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-06 19:31:11,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:11,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,400 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:31:11,402 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:31:11,402 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:31:11,413 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:31:11,413 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:31:11,413 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_B~0#1.base)_3, ULTIMATE.start_main_~nc_B~0#1, ULTIMATE.start_main_~#string_B~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0#1.base)_3 - 1*ULTIMATE.start_main_~nc_B~0#1 - 1*ULTIMATE.start_main_~#string_B~0#1.offset Supporting invariants [] [2025-02-06 19:31:11,420 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:31:11,438 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-02-06 19:31:11,440 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:31:11,440 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:31:11,440 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#string_B~0!offset [2025-02-06 19:31:11,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:11,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 19:31:11,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:31:11,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:11,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:11,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:31:11,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:11,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:11,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:11,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:11,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:11,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:31:11,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:11,505 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:31:11,506 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 19:31:11,506 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:11,518 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 38 transitions. Complement of second has 4 states. [2025-02-06 19:31:11,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:31:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2025-02-06 19:31:11,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 19 letters. Loop has 2 letters. [2025-02-06 19:31:11,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:11,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 2 letters. [2025-02-06 19:31:11,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:11,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 19 letters. Loop has 4 letters. [2025-02-06 19:31:11,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:11,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2025-02-06 19:31:11,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:11,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 33 transitions. [2025-02-06 19:31:11,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-02-06 19:31:11,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-02-06 19:31:11,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2025-02-06 19:31:11,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:31:11,520 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-02-06 19:31:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2025-02-06 19:31:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-06 19:31:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-02-06 19:31:11,521 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-02-06 19:31:11,521 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-02-06 19:31:11,522 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:31:11,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2025-02-06 19:31:11,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:11,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:11,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:11,522 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:31:11,522 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:31:11,522 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" [2025-02-06 19:31:11,522 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:31:11,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:11,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2061876430, now seen corresponding path program 1 times [2025-02-06 19:31:11,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:11,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832794852] [2025-02-06 19:31:11,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:11,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:11,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:31:11,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:31:11,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:11,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:11,536 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:11,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:31:11,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:31:11,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:11,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:11,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:11,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:11,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1535, now seen corresponding path program 1 times [2025-02-06 19:31:11,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:11,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849420102] [2025-02-06 19:31:11,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:11,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:11,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:11,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:11,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:11,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:11,555 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:11,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:11,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:11,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:11,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:11,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:11,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:11,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1483325200, now seen corresponding path program 1 times [2025-02-06 19:31:11,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:11,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799660735] [2025-02-06 19:31:11,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:11,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:11,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-02-06 19:31:11,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:31:11,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:31:11,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:11,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 19:31:11,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:31:11,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799660735] [2025-02-06 19:31:11,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799660735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:31:11,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:31:11,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:31:11,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235066133] [2025-02-06 19:31:11,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:31:11,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:31:11,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:31:11,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:31:11,720 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:31:11,731 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-02-06 19:31:11,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2025-02-06 19:31:11,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:11,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 29 states and 33 transitions. [2025-02-06 19:31:11,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-02-06 19:31:11,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-02-06 19:31:11,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2025-02-06 19:31:11,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:31:11,732 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-02-06 19:31:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2025-02-06 19:31:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-02-06 19:31:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-02-06 19:31:11,733 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-02-06 19:31:11,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:31:11,735 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-02-06 19:31:11,735 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:31:11,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2025-02-06 19:31:11,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:11,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:11,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:11,736 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:31:11,736 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:31:11,736 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" [2025-02-06 19:31:11,736 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:31:11,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:11,738 INFO L85 PathProgramCache]: Analyzing trace with hash -447933903, now seen corresponding path program 1 times [2025-02-06 19:31:11,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:11,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238130568] [2025-02-06 19:31:11,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:11,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:11,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:31:11,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:31:11,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:11,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 19:31:11,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:31:11,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238130568] [2025-02-06 19:31:11,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238130568] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:31:11,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236030239] [2025-02-06 19:31:11,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:11,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:31:11,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:11,809 INFO L229 MonitoredProcess]: Starting monitored process 53 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:31:11,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-02-06 19:31:11,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 19:31:11,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 19:31:11,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:11,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:11,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:31:11,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 19:31:11,902 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 19:31:11,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236030239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:31:11,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 19:31:11,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 19:31:11,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869830244] [2025-02-06 19:31:11,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:31:11,903 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:31:11,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:11,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1535, now seen corresponding path program 2 times [2025-02-06 19:31:11,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:11,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700120134] [2025-02-06 19:31:11,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:31:11,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:11,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:11,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:11,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:31:11,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:11,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:11,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:11,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:11,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:11,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:11,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:11,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:31:11,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 19:31:11,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 19:31:11,975 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:31:11,988 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2025-02-06 19:31:11,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2025-02-06 19:31:11,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:11,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 33 transitions. [2025-02-06 19:31:11,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-02-06 19:31:11,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-02-06 19:31:11,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2025-02-06 19:31:11,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:31:11,989 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-02-06 19:31:11,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2025-02-06 19:31:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-02-06 19:31:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:11,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-02-06 19:31:11,990 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-02-06 19:31:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 19:31:11,994 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-02-06 19:31:11,994 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:31:11,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2025-02-06 19:31:11,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:11,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:11,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:11,995 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:31:11,995 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:31:11,995 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" [2025-02-06 19:31:11,995 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:31:11,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash -967715726, now seen corresponding path program 1 times [2025-02-06 19:31:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:11,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549602113] [2025-02-06 19:31:11,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:12,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 19:31:12,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 19:31:12,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:12,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:12,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:12,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 19:31:12,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 19:31:12,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:12,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:12,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:12,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:12,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1535, now seen corresponding path program 3 times [2025-02-06 19:31:12,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:12,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473094592] [2025-02-06 19:31:12,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:31:12,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:12,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:12,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:12,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:31:12,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:12,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:12,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:12,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:12,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:12,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:12,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:12,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2033091120, now seen corresponding path program 1 times [2025-02-06 19:31:12,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:12,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053995179] [2025-02-06 19:31:12,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:12,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:12,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 19:31:12,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:31:12,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:12,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:12,076 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:12,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 19:31:12,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:31:12,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:12,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:12,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:17,161 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:31:17,162 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:31:17,162 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:31:17,162 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:31:17,162 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:31:17,162 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:17,162 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:31:17,162 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:31:17,162 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration10_Lasso [2025-02-06 19:31:17,162 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:31:17,162 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:31:17,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:17,799 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:31:17,799 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:31:17,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:17,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:17,802 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:31:17,805 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:31:17,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:31:17,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:17,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:17,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:17,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:17,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:17,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:17,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:17,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:17,825 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:31:17,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:17,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:17,827 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:31:17,829 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:31:17,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:17,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:17,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:17,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:17,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:17,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:17,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:17,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:17,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:17,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:17,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:17,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:17,852 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:31:17,853 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:31:17,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:17,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:17,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:17,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:17,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:17,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:17,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:17,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:17,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:17,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-02-06 19:31:17,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:17,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:17,875 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:31:17,876 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:31:17,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:17,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:17,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:17,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:17,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:17,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:17,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:17,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:17,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:17,896 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:31:17,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:17,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:17,900 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:31:17,901 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:31:17,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:17,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:17,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:17,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:17,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:17,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:17,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:17,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:17,920 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:17,926 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:31:17,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:17,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:17,929 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:31:17,930 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:31:17,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:17,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:17,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:17,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:17,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:17,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:17,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:17,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:17,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:17,948 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:31:17,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:17,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:17,950 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:31:17,951 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:31:17,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:17,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:17,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:17,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:17,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:17,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:17,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:17,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:17,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:17,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-02-06 19:31:17,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:17,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:17,970 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:31:17,971 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:31:17,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:17,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:17,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:17,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:17,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:17,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:17,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:17,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:17,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:17,990 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:31:17,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:17,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:17,992 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:31:17,993 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:31:17,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:18,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:18,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:18,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:18,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:18,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:18,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:18,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:18,014 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:31:18,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:18,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:18,017 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:31:18,018 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:31:18,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:18,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:18,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:18,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:18,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:18,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:18,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:18,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:18,038 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:31:18,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:18,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:18,040 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:31:18,041 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:31:18,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:18,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:18,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:18,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:18,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:18,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:18,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:18,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:18,054 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:18,059 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:31:18,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:18,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:18,062 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:31:18,064 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:31:18,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:18,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:18,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:18,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:18,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:18,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:18,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:18,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:18,077 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:18,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-02-06 19:31:18,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:18,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:18,086 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:31:18,088 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:31:18,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:31:18,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:18,099 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-02-06 19:31:18,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:18,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:18,103 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-06 19:31:18,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:18,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:18,115 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:31:18,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:18,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:18,117 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:31:18,118 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:31:18,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:18,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:18,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:18,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:18,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:18,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:18,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:18,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:18,139 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:31:18,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:18,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:18,145 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:31:18,146 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:31:18,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:31:18,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:18,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:18,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:18,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:18,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:18,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:18,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:18,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-02-06 19:31:18,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:18,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:18,172 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:31:18,173 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:31:18,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:31:18,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:18,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:18,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:18,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:18,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:18,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:18,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:18,194 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:31:18,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:18,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:18,196 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:31:18,198 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:31:18,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:18,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:18,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:18,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:18,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:18,212 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:18,212 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:18,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:18,230 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:31:18,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:18,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:18,233 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:31:18,234 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:31:18,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:31:18,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:18,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:18,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:18,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:18,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:18,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:18,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:18,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:18,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:18,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:18,260 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:31:18,261 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:31:18,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:18,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:18,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:18,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:18,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:18,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:18,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:18,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:18,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-02-06 19:31:18,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:18,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:18,285 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:31:18,286 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:31:18,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:18,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:18,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:18,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:18,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:18,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:18,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:18,307 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:31:18,322 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-02-06 19:31:18,322 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-06 19:31:18,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:18,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:18,325 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:31:18,326 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:31:18,326 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:31:18,337 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:31:18,337 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:31:18,337 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_A~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~nc_A~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-06 19:31:18,343 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:31:18,366 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-02-06 19:31:18,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:18,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 19:31:18,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 19:31:18,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:18,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:18,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:31:18,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:18,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:18,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:18,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:18,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:18,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:31:18,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:18,480 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:31:18,481 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 19:31:18,481 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 31 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:18,494 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 31 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 37 transitions. Complement of second has 5 states. [2025-02-06 19:31:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:31:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2025-02-06 19:31:18,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 26 letters. Loop has 2 letters. [2025-02-06 19:31:18,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:18,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 28 letters. Loop has 2 letters. [2025-02-06 19:31:18,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:18,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 26 letters. Loop has 4 letters. [2025-02-06 19:31:18,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:18,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2025-02-06 19:31:18,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:18,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2025-02-06 19:31:18,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-02-06 19:31:18,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-02-06 19:31:18,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2025-02-06 19:31:18,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:31:18,497 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-02-06 19:31:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2025-02-06 19:31:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-06 19:31:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-02-06 19:31:18,498 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-02-06 19:31:18,498 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-02-06 19:31:18,498 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-06 19:31:18,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2025-02-06 19:31:18,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:18,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:18,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:18,498 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:31:18,498 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:31:18,499 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-02-06 19:31:18,500 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:31:18,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:18,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2033091121, now seen corresponding path program 1 times [2025-02-06 19:31:18,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:18,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763473481] [2025-02-06 19:31:18,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:18,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:18,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 19:31:18,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:31:18,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:18,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:18,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:18,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 19:31:18,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:31:18,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:18,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:18,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:18,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1535, now seen corresponding path program 4 times [2025-02-06 19:31:18,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:18,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690088560] [2025-02-06 19:31:18,542 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:31:18,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:18,544 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-06 19:31:18,545 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:18,545 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:31:18,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:18,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:18,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:18,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:18,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:18,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:18,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:18,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:18,555 INFO L85 PathProgramCache]: Analyzing trace with hash -409551825, now seen corresponding path program 1 times [2025-02-06 19:31:18,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:18,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669535316] [2025-02-06 19:31:18,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:18,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:18,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 19:31:18,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 19:31:18,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:18,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:18,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-02-06 19:31:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 19:31:18,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:31:18,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669535316] [2025-02-06 19:31:18,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669535316] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:31:18,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326082583] [2025-02-06 19:31:18,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:18,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:31:18,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:18,836 INFO L229 MonitoredProcess]: Starting monitored process 75 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:31:18,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-02-06 19:31:18,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 19:31:18,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 19:31:18,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:18,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:18,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:31:18,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 19:31:18,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:31:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 19:31:18,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326082583] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:31:18,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:31:18,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2025-02-06 19:31:18,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26526003] [2025-02-06 19:31:18,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:31:19,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:31:19,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 19:31:19,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-06 19:31:19,053 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:31:19,168 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2025-02-06 19:31:19,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 63 transitions. [2025-02-06 19:31:19,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:19,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 35 states and 40 transitions. [2025-02-06 19:31:19,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-06 19:31:19,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-02-06 19:31:19,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2025-02-06 19:31:19,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:31:19,169 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-02-06 19:31:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2025-02-06 19:31:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2025-02-06 19:31:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-02-06 19:31:19,170 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-02-06 19:31:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 19:31:19,174 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-02-06 19:31:19,174 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-06 19:31:19,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2025-02-06 19:31:19,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:19,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:19,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:19,175 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:31:19,175 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:31:19,175 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-02-06 19:31:19,175 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:31:19,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:19,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1625544176, now seen corresponding path program 2 times [2025-02-06 19:31:19,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:19,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777044970] [2025-02-06 19:31:19,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:31:19,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:19,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 19:31:19,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 19:31:19,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:31:19,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 19:31:19,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:31:19,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777044970] [2025-02-06 19:31:19,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777044970] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:31:19,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787381324] [2025-02-06 19:31:19,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:31:19,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:31:19,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:19,270 INFO L229 MonitoredProcess]: Starting monitored process 76 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:31:19,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-02-06 19:31:19,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 19:31:19,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 19:31:19,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:31:19,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:19,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:31:19,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 19:31:19,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:31:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 19:31:19,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787381324] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:31:19,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:31:19,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-06 19:31:19,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522353159] [2025-02-06 19:31:19,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:31:19,440 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:31:19,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1535, now seen corresponding path program 5 times [2025-02-06 19:31:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:19,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688172559] [2025-02-06 19:31:19,440 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:31:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:19,442 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:19,443 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:19,443 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:31:19,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:19,443 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:19,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:19,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:19,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:19,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:19,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:19,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:31:19,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 19:31:19,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-02-06 19:31:19,509 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. cyclomatic complexity: 9 Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:31:19,545 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2025-02-06 19:31:19,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2025-02-06 19:31:19,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:19,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 43 transitions. [2025-02-06 19:31:19,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-06 19:31:19,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-02-06 19:31:19,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2025-02-06 19:31:19,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:31:19,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-02-06 19:31:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2025-02-06 19:31:19,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-02-06 19:31:19,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2025-02-06 19:31:19,547 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-02-06 19:31:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:31:19,547 INFO L432 stractBuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-02-06 19:31:19,547 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-06 19:31:19,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2025-02-06 19:31:19,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:19,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:19,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:19,548 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:31:19,548 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:31:19,548 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-02-06 19:31:19,548 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:31:19,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:19,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1186620431, now seen corresponding path program 3 times [2025-02-06 19:31:19,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:19,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137966629] [2025-02-06 19:31:19,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:31:19,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:19,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-02-06 19:31:19,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 19:31:19,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 19:31:19,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:19,584 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:19,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 19:31:19,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 19:31:19,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:19,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:19,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:19,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1535, now seen corresponding path program 6 times [2025-02-06 19:31:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:19,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584324011] [2025-02-06 19:31:19,602 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:31:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:19,604 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:19,605 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:19,605 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:31:19,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:19,605 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:19,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:19,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:19,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:19,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:19,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:19,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2119067119, now seen corresponding path program 2 times [2025-02-06 19:31:19,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:19,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466397278] [2025-02-06 19:31:19,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:31:19,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:19,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 19:31:19,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 19:31:19,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:31:19,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:19,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:19,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 19:31:19,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 19:31:19,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:19,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:19,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:23,454 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:31:23,454 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:31:23,454 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:31:23,455 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:31:23,455 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:31:23,455 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:23,455 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:31:23,455 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:31:23,455 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration13_Lasso [2025-02-06 19:31:23,455 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:31:23,455 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:31:23,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:23,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:24,288 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:31:24,288 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:31:24,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,291 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:31:24,292 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:31:24,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:24,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:24,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:24,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:24,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:24,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,313 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:31:24,315 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:31:24,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:24,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:24,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:24,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,336 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:31:24,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,339 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:31:24,341 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:31:24,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:24,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:24,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:24,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,360 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:31:24,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,367 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:31:24,368 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:31:24,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:24,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:24,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:24,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:24,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,388 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:31:24,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,391 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:31:24,417 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:31:24,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:24,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:24,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:24,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:24,430 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-02-06 19:31:24,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,437 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:31:24,439 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:31:24,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:24,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:24,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:24,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:24,451 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,461 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:31:24,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,463 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:31:24,464 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:31:24,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:24,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:24,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:24,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:24,477 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:24,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,486 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:31:24,487 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:31:24,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:24,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:24,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:24,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:24,499 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,505 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:31:24,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,507 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:31:24,509 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:31:24,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:24,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:24,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:24,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:24,522 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,527 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:31:24,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,530 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:31:24,531 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:31:24,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:24,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:24,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:24,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:24,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-02-06 19:31:24,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,551 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:31:24,553 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:31:24,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:24,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:24,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:24,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:24,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,570 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:31:24,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,572 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:31:24,573 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:31:24,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:24,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:24,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:24,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:24,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,593 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:31:24,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,595 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:31:24,596 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:31:24,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:24,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:24,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:24,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:24,609 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,614 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:31:24,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,617 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:31:24,618 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:31:24,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:24,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:24,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:24,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:24,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:24,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,648 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:31:24,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:24,649 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:31:24,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,671 INFO L203 nArgumentSynthesizer]: 12 stem disjuncts [2025-02-06 19:31:24,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,685 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2025-02-06 19:31:24,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:24,714 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:24,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,726 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:31:24,726 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:31:24,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:24,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:24,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:24,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:24,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-02-06 19:31:24,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,755 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:31:24,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:31:24,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:31:24,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:24,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:24,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:24,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:24,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:24,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:24,778 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:31:24,789 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-02-06 19:31:24,790 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-06 19:31:24,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:24,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:24,794 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:31:24,795 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:31:24,796 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:31:24,808 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:31:24,808 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:31:24,808 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_A~0#1, ULTIMATE.start_main_~i~0#1) = 3*ULTIMATE.start_main_~nc_A~0#1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-06 19:31:24,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-02-06 19:31:24,843 INFO L156 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2025-02-06 19:31:24,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:24,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 19:31:24,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 19:31:24,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:24,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:24,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:31:24,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:24,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:24,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:24,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:24,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:24,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:31:24,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:24,972 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:31:24,973 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-02-06 19:31:24,973 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 9 Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:25,030 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 9. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 58 states and 70 transitions. Complement of second has 9 states. [2025-02-06 19:31:25,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2025-02-06 19:31:25,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2025-02-06 19:31:25,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 32 letters. Loop has 2 letters. [2025-02-06 19:31:25,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:25,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 34 letters. Loop has 2 letters. [2025-02-06 19:31:25,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:25,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 32 letters. Loop has 4 letters. [2025-02-06 19:31:25,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:25,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 70 transitions. [2025-02-06 19:31:25,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:25,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 70 transitions. [2025-02-06 19:31:25,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-02-06 19:31:25,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-02-06 19:31:25,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 70 transitions. [2025-02-06 19:31:25,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:31:25,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 70 transitions. [2025-02-06 19:31:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 70 transitions. [2025-02-06 19:31:25,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2025-02-06 19:31:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2025-02-06 19:31:25,034 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-02-06 19:31:25,034 INFO L432 stractBuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-02-06 19:31:25,034 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-06 19:31:25,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2025-02-06 19:31:25,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:25,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:25,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:25,035 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:31:25,035 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:31:25,035 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-02-06 19:31:25,036 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:31:25,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1520236592, now seen corresponding path program 4 times [2025-02-06 19:31:25,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:25,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361908084] [2025-02-06 19:31:25,036 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:31:25,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:25,043 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-02-06 19:31:25,048 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 34 statements. [2025-02-06 19:31:25,048 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:31:25,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 19:31:25,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:31:25,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361908084] [2025-02-06 19:31:25,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361908084] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:31:25,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608888081] [2025-02-06 19:31:25,155 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:31:25,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:31:25,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:25,157 INFO L229 MonitoredProcess]: Starting monitored process 95 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:31:25,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2025-02-06 19:31:25,272 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-02-06 19:31:25,297 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 34 statements. [2025-02-06 19:31:25,297 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:31:25,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:25,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 19:31:25,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 19:31:25,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:31:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 19:31:25,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608888081] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:31:25,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:31:25,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-02-06 19:31:25,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385303337] [2025-02-06 19:31:25,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:31:25,452 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:31:25,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:25,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1535, now seen corresponding path program 7 times [2025-02-06 19:31:25,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:25,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401829686] [2025-02-06 19:31:25,453 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:31:25,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:25,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:25,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:25,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:25,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:25,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:25,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:25,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:25,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:25,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:25,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:25,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:31:25,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 19:31:25,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-06 19:31:25,525 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. cyclomatic complexity: 15 Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:31:25,603 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-02-06 19:31:25,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2025-02-06 19:31:25,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:31:25,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 62 states and 74 transitions. [2025-02-06 19:31:25,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-02-06 19:31:25,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-02-06 19:31:25,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 74 transitions. [2025-02-06 19:31:25,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:31:25,605 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 74 transitions. [2025-02-06 19:31:25,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 74 transitions. [2025-02-06 19:31:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2025-02-06 19:31:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.169811320754717) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2025-02-06 19:31:25,609 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 62 transitions. [2025-02-06 19:31:25,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 19:31:25,614 INFO L432 stractBuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2025-02-06 19:31:25,614 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-02-06 19:31:25,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2025-02-06 19:31:25,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:25,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:25,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:25,616 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:31:25,617 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:31:25,617 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-02-06 19:31:25,617 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:31:25,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:25,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2119067120, now seen corresponding path program 5 times [2025-02-06 19:31:25,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:25,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317764563] [2025-02-06 19:31:25,618 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:31:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:25,627 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 4 equivalence classes. [2025-02-06 19:31:25,657 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 19:31:25,657 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 19:31:25,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:25,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:25,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 19:31:25,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 19:31:25,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:25,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:25,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:25,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:25,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1535, now seen corresponding path program 8 times [2025-02-06 19:31:25,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:25,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076642758] [2025-02-06 19:31:25,675 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:31:25,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:25,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:25,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:25,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:31:25,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:25,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:25,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:25,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:25,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:25,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:25,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:25,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash 609004590, now seen corresponding path program 3 times [2025-02-06 19:31:25,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:25,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217825803] [2025-02-06 19:31:25,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:31:25,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:25,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 4 equivalence classes. [2025-02-06 19:31:25,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 36 statements. [2025-02-06 19:31:25,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 19:31:25,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:25,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 19:31:25,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:31:25,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217825803] [2025-02-06 19:31:25,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217825803] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:31:25,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454598286] [2025-02-06 19:31:25,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:31:25,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:31:25,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:25,893 INFO L229 MonitoredProcess]: Starting monitored process 96 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:31:25,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2025-02-06 19:31:25,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 4 equivalence classes. [2025-02-06 19:31:25,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 36 statements. [2025-02-06 19:31:25,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 19:31:25,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:25,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:31:25,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 19:31:26,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:31:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 19:31:26,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454598286] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:31:26,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:31:26,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-02-06 19:31:26,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895289494] [2025-02-06 19:31:26,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:31:26,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:31:26,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 19:31:26,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-06 19:31:26,155 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 15 Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:31:26,233 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2025-02-06 19:31:26,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 69 transitions. [2025-02-06 19:31:26,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:26,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 41 states and 46 transitions. [2025-02-06 19:31:26,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-06 19:31:26,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-02-06 19:31:26,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2025-02-06 19:31:26,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:31:26,234 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-02-06 19:31:26,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2025-02-06 19:31:26,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2025-02-06 19:31:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-02-06 19:31:26,235 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-02-06 19:31:26,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 19:31:26,236 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-02-06 19:31:26,236 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-02-06 19:31:26,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2025-02-06 19:31:26,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:26,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:26,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:26,236 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:31:26,236 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:31:26,236 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-02-06 19:31:26,236 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:31:26,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:26,237 INFO L85 PathProgramCache]: Analyzing trace with hash 692006449, now seen corresponding path program 6 times [2025-02-06 19:31:26,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:26,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317720230] [2025-02-06 19:31:26,237 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:31:26,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:26,244 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 4 equivalence classes. [2025-02-06 19:31:26,257 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 19:31:26,258 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-06 19:31:26,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:26,258 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:26,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 19:31:26,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 19:31:26,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:26,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:26,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:26,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:26,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1535, now seen corresponding path program 9 times [2025-02-06 19:31:26,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:26,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049739920] [2025-02-06 19:31:26,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:31:26,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:26,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:26,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:26,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:31:26,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:26,277 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:26,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:26,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:26,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:26,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:26,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:26,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:26,279 INFO L85 PathProgramCache]: Analyzing trace with hash -701732817, now seen corresponding path program 4 times [2025-02-06 19:31:26,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:26,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651589425] [2025-02-06 19:31:26,279 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:31:26,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:26,286 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-02-06 19:31:26,298 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 19:31:26,298 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:31:26,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:26,298 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:26,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 19:31:26,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 19:31:26,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:26,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:26,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:30,374 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:31:30,374 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:31:30,374 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:31:30,374 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:31:30,374 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:31:30,374 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:30,374 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:31:30,375 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:31:30,375 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration16_Lasso [2025-02-06 19:31:30,375 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:31:30,375 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:31:30,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:30,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:31,289 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:31:31,289 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:31:31,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,296 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:31:31,297 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:31:31,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:31,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,314 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:31:31,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,317 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:31:31,318 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:31:31,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,331 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,337 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:31:31,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,339 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:31:31,341 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:31:31,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:31,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:31,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,362 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:31:31,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,364 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:31:31,364 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:31:31,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:31,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:31,379 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-02-06 19:31:31,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,387 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:31:31,388 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:31:31,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:31:31,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,408 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:31:31,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,410 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:31:31,411 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:31:31,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,429 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:31:31,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,432 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:31:31,433 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:31:31,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,450 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:31:31,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,453 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:31:31,453 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:31:31,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,472 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:31:31,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,476 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:31:31,477 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:31:31,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,495 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:31:31,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,499 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:31:31,499 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:31:31,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,512 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:31,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,521 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:31:31,522 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:31:31,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,534 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:31,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,543 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:31:31,544 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:31:31,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,556 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,562 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:31:31,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,565 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:31:31,566 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:31:31,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:31,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,589 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:31:31,590 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:31:31,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:31,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,608 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:31:31,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,611 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:31:31,611 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:31:31,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,632 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:31:31,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,635 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:31:31,637 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:31:31,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,651 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,658 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:31:31,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,660 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:31:31,661 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:31:31,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,681 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:31:31,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,684 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:31:31,685 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:31:31,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:31,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:31,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:31,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:31,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-02-06 19:31:31,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,707 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:31:31,708 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:31:31,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:31:31,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,719 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:31:31,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,720 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:31:31,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:31,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,730 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:31:31,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,733 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:31:31,734 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:31:31,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:31,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:31,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:31,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2025-02-06 19:31:31,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,765 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:31:31,766 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:31:31,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:31,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,777 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:31:31,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,778 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:31:31,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:31,781 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,786 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:31:31,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,789 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:31:31,790 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:31:31,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:31,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:31,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:31,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:31,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,814 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:31:31,815 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:31:31,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:31,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:31,830 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:31,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,840 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:31:31,840 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:31:31,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:31,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:31,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:31,862 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:31:31,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,865 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:31:31,866 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:31:31,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:31,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:31,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:31,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:31,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:31,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:31,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:31,886 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:31:31,907 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-02-06 19:31:31,908 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-06 19:31:31,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:31,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:31,910 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:31:31,911 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:31:31,912 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:31:31,923 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:31:31,924 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:31:31,924 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_B~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~nc_B~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2025-02-06 19:31:31,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:31,954 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2025-02-06 19:31:31,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:32,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2025-02-06 19:31:32,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 19:31:32,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 19:31:32,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:32,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:32,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:31:32,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:32,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:32,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:32,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:32,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:32,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:31:32,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:32,084 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:31:32,084 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 19:31:32,084 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:32,098 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 51 transitions. Complement of second has 5 states. [2025-02-06 19:31:32,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:31:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2025-02-06 19:31:32,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 36 letters. Loop has 2 letters. [2025-02-06 19:31:32,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:32,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 38 letters. Loop has 2 letters. [2025-02-06 19:31:32,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:32,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 36 letters. Loop has 4 letters. [2025-02-06 19:31:32,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:32,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 51 transitions. [2025-02-06 19:31:32,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:32,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 51 transitions. [2025-02-06 19:31:32,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-02-06 19:31:32,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-02-06 19:31:32,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 51 transitions. [2025-02-06 19:31:32,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:31:32,102 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-02-06 19:31:32,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 51 transitions. [2025-02-06 19:31:32,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-06 19:31:32,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2025-02-06 19:31:32,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-02-06 19:31:32,104 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-02-06 19:31:32,104 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-02-06 19:31:32,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2025-02-06 19:31:32,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:31:32,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:32,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:32,105 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:31:32,105 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:31:32,105 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-02-06 19:31:32,105 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:31:32,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:32,106 INFO L85 PathProgramCache]: Analyzing trace with hash -701732816, now seen corresponding path program 7 times [2025-02-06 19:31:32,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:32,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488188947] [2025-02-06 19:31:32,106 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:31:32,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:32,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 19:31:32,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 19:31:32,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:32,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:32,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:32,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 19:31:32,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 19:31:32,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:32,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:32,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:32,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:32,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1535, now seen corresponding path program 10 times [2025-02-06 19:31:32,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:32,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504415286] [2025-02-06 19:31:32,171 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:31:32,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:32,174 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-06 19:31:32,175 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:32,175 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:31:32,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:32,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:32,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:32,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:32,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:32,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:32,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:32,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:32,180 INFO L85 PathProgramCache]: Analyzing trace with hash -55370130, now seen corresponding path program 5 times [2025-02-06 19:31:32,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:32,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253207167] [2025-02-06 19:31:32,180 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:31:32,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:32,190 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 4 equivalence classes. [2025-02-06 19:31:32,209 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 19:31:32,209 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 19:31:32,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:32,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:32,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 19:31:32,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 19:31:32,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:32,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:32,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:38,933 WARN L286 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 383 DAG size of output: 292 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-06 19:31:39,901 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:31:39,902 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:31:39,902 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:31:39,902 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:31:39,902 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:31:39,902 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:39,902 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:31:39,902 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:31:39,902 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration17_Lasso [2025-02-06 19:31:39,902 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:31:39,902 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:31:39,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:39,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:39,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:39,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:39,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:39,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:40,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:40,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:40,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:40,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:40,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:40,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:40,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:40,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:40,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:40,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:40,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:40,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:40,850 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-02-06 19:31:42,106 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:31:42,106 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:31:42,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:42,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:42,108 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:31:42,109 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:31:42,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:42,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:42,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:42,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:42,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:42,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:42,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:42,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:42,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:42,127 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:31:42,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:42,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:42,130 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:31:42,131 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:31:42,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:42,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:42,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:42,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:42,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:42,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:42,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:42,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:42,145 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:42,150 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:31:42,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:42,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:42,153 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:31:42,155 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:31:42,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:42,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:42,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:42,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:42,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:42,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:42,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:42,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:42,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:42,182 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:31:42,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:42,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:42,185 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:31:42,186 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:31:42,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:42,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:42,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:42,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:42,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:42,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:42,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:42,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:42,199 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:42,206 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:31:42,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:42,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:42,208 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:31:42,208 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:31:42,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:42,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:42,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:42,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:42,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:42,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:42,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:42,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:42,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:42,228 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:31:42,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:42,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:42,231 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:31:42,233 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:31:42,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:42,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:42,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:42,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:42,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:42,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:42,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:42,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:42,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:42,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:42,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:42,255 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:31:42,256 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:31:42,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:31:42,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:42,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:42,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:42,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:42,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:42,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:42,277 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:31:42,291 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-02-06 19:31:42,291 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-02-06 19:31:42,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:42,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:42,295 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:31:42,296 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:31:42,297 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:31:42,308 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:31:42,308 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:31:42,308 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2025-02-06 19:31:42,314 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:31:42,347 INFO L156 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2025-02-06 19:31:42,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:42,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 19:31:42,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-02-06 19:31:42,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 19:31:42,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:42,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:42,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 19:31:42,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:42,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:42,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:42,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:42,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:42,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:31:42,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:42,527 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:31:42,527 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-06 19:31:42,528 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:42,597 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 12. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 85 transitions. Complement of second has 10 states. [2025-02-06 19:31:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2025-02-06 19:31:42,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2025-02-06 19:31:42,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 38 letters. Loop has 2 letters. [2025-02-06 19:31:42,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:42,598 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:31:42,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:42,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 19:31:42,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 19:31:42,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:42,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:42,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 19:31:42,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:42,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:42,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:42,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:42,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:42,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:31:42,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:42,746 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:31:42,746 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-06 19:31:42,747 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:42,806 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 12. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 85 transitions. Complement of second has 10 states. [2025-02-06 19:31:42,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2025-02-06 19:31:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2025-02-06 19:31:42,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 38 letters. Loop has 2 letters. [2025-02-06 19:31:42,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:42,807 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:31:42,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:42,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 19:31:42,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 19:31:42,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:42,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:42,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 19:31:42,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:42,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:42,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:42,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:42,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:42,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:31:42,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:42,954 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:31:42,955 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-06 19:31:42,955 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:43,021 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 12. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 76 states and 94 transitions. Complement of second has 9 states. [2025-02-06 19:31:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2025-02-06 19:31:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2025-02-06 19:31:43,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 38 letters. Loop has 2 letters. [2025-02-06 19:31:43,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:43,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 40 letters. Loop has 2 letters. [2025-02-06 19:31:43,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:43,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 38 letters. Loop has 4 letters. [2025-02-06 19:31:43,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:43,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 94 transitions. [2025-02-06 19:31:43,024 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-02-06 19:31:43,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 74 states and 90 transitions. [2025-02-06 19:31:43,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-02-06 19:31:43,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-02-06 19:31:43,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 90 transitions. [2025-02-06 19:31:43,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:31:43,025 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 90 transitions. [2025-02-06 19:31:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 90 transitions. [2025-02-06 19:31:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2025-02-06 19:31:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.180327868852459) internal successors, (72), 60 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-02-06 19:31:43,032 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-02-06 19:31:43,033 INFO L432 stractBuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-02-06 19:31:43,033 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-02-06 19:31:43,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 72 transitions. [2025-02-06 19:31:43,033 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-02-06 19:31:43,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:43,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:43,034 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:31:43,034 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:31:43,034 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" [2025-02-06 19:31:43,034 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-02-06 19:31:43,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:43,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1520271474, now seen corresponding path program 2 times [2025-02-06 19:31:43,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:43,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241703662] [2025-02-06 19:31:43,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:31:43,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:43,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 19:31:43,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 19:31:43,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:31:43,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:43,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:43,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 19:31:43,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 19:31:43,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:43,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:43,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:43,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1536, now seen corresponding path program 1 times [2025-02-06 19:31:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:43,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620288434] [2025-02-06 19:31:43,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:31:43,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:43,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:43,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:43,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:43,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:43,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:43,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:43,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:43,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:43,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:43,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:43,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:43,087 INFO L85 PathProgramCache]: Analyzing trace with hash 692006449, now seen corresponding path program 8 times [2025-02-06 19:31:43,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:43,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263797026] [2025-02-06 19:31:43,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:31:43,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:43,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 19:31:43,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 19:31:43,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:31:43,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:43,105 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:43,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 19:31:43,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 19:31:43,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:43,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:43,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:48,321 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 335 DAG size of output: 258 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-06 19:31:48,799 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:31:48,799 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:31:48,799 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:31:48,799 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:31:48,799 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:31:48,799 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:48,799 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:31:48,799 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:31:48,799 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration18_Lasso [2025-02-06 19:31:48,799 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:31:48,799 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:31:48,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:48,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:48,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:48,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:48,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:48,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:48,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:48,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:48,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:48,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:48,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:48,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:48,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:48,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:49,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:49,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:49,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:49,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:31:49,680 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:31:49,680 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:31:49,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:49,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:49,685 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:49,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-02-06 19:31:49,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:31:49,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:49,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:49,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:49,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:49,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:49,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:49,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:49,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:49,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:49,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:49,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:49,706 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:49,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-02-06 19:31:49,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:49,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:49,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:49,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:49,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:49,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:49,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:49,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:49,720 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:49,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2025-02-06 19:31:49,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:49,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:49,729 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:49,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-02-06 19:31:49,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:49,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:49,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:49,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:49,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:49,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:49,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:49,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:49,743 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:49,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:49,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:49,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:49,751 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:49,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-02-06 19:31:49,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:31:49,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:49,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:49,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:49,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:49,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:49,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:49,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:49,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:49,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:49,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:49,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:49,771 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:49,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-02-06 19:31:49,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:49,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:49,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:49,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:49,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:49,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:49,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:49,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:49,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:49,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:49,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:49,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:49,792 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:49,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-02-06 19:31:49,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:49,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:49,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:49,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:49,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:49,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:49,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:49,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:49,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:49,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2025-02-06 19:31:49,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:49,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:49,813 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:49,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-02-06 19:31:49,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:49,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:49,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:49,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:49,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:49,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:49,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:49,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:49,826 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:49,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2025-02-06 19:31:49,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:49,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:49,836 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:49,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2025-02-06 19:31:49,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:31:49,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:49,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:49,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:49,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:49,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:49,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:49,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:49,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:49,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2025-02-06 19:31:49,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:49,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:49,858 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:49,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2025-02-06 19:31:49,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:49,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:49,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:49,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:49,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:49,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:49,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:49,872 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:49,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2025-02-06 19:31:49,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:49,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:49,880 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:49,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2025-02-06 19:31:49,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:49,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:49,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:49,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:49,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:49,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:49,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:49,895 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:49,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2025-02-06 19:31:49,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:49,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:49,902 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:49,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-02-06 19:31:49,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:49,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:49,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:49,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:49,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:49,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:49,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:49,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:49,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:49,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2025-02-06 19:31:49,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:49,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:49,924 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:49,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-02-06 19:31:49,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:49,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:49,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:49,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:49,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:49,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:49,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:49,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:49,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:49,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2025-02-06 19:31:49,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:49,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:49,946 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:49,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2025-02-06 19:31:49,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:49,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:49,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:49,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:49,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:49,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:49,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:49,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:49,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:49,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:49,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:49,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:49,966 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:49,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-02-06 19:31:49,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:49,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:49,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:31:49,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:49,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:49,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:49,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:31:49,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:31:49,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:49,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:49,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:49,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:49,987 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:49,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-02-06 19:31:49,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:49,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:49,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:49,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:49,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:50,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:50,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:50,003 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:50,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:50,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:50,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:50,011 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:50,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-02-06 19:31:50,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:50,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:50,022 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:31:50,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:50,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:50,024 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:31:50,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:50,026 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:50,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2025-02-06 19:31:50,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:50,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:50,035 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:50,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-02-06 19:31:50,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:50,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:50,048 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-02-06 19:31:50,048 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:31:50,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:50,058 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2025-02-06 19:31:50,058 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:31:50,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:50,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:50,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:50,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:50,086 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:50,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-02-06 19:31:50,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:31:50,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:50,110 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:31:50,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:50,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:50,111 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:31:50,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:50,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:50,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:50,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:50,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:50,122 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:50,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-02-06 19:31:50,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:31:50,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:50,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:50,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:50,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:50,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:50,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:50,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:50,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-02-06 19:31:50,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:50,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:50,158 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/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:31:50,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:50,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-02-06 19:31:50,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:50,171 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:31:50,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:50,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:50,172 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:31:50,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:50,175 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:31:50,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:50,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:50,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:50,189 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:50,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-02-06 19:31:50,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:31:50,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:31:50,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:31:50,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:31:50,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:31:50,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:31:50,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:31:50,223 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:31:50,252 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2025-02-06 19:31:50,252 INFO L444 ModelExtractionUtils]: 3 out of 28 variables were initially zero. Simplification set additionally 22 variables to zero. [2025-02-06 19:31:50,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:31:50,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:31:50,255 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:31:50,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-02-06 19:31:50,257 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:31:50,268 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:31:50,268 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:31:50,268 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_8) = -2*ULTIMATE.start_main_~i~0#1 + 5*v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_8 Supporting invariants [] [2025-02-06 19:31:50,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:50,319 INFO L156 tatePredicateManager]: 16 out of 18 supporting invariants were superfluous and have been removed [2025-02-06 19:31:50,322 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:31:50,322 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:31:50,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:50,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 19:31:50,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 19:31:50,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:50,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:50,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:31:50,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:50,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:50,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:50,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:50,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:31:50,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:31:50,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:31:50,489 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:31:50,490 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-06 19:31:50,490 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 72 transitions. cyclomatic complexity: 18 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:50,561 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 72 transitions. cyclomatic complexity: 18. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 89 transitions. Complement of second has 10 states. [2025-02-06 19:31:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2025-02-06 19:31:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2025-02-06 19:31:50,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 34 letters. Loop has 2 letters. [2025-02-06 19:31:50,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:50,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 36 letters. Loop has 2 letters. [2025-02-06 19:31:50,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:50,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 34 letters. Loop has 4 letters. [2025-02-06 19:31:50,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:31:50,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 89 transitions. [2025-02-06 19:31:50,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-02-06 19:31:50,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 71 states and 85 transitions. [2025-02-06 19:31:50,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-02-06 19:31:50,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-02-06 19:31:50,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 85 transitions. [2025-02-06 19:31:50,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:31:50,564 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 85 transitions. [2025-02-06 19:31:50,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 85 transitions. [2025-02-06 19:31:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2025-02-06 19:31:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.203125) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:31:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2025-02-06 19:31:50,567 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 77 transitions. [2025-02-06 19:31:50,567 INFO L432 stractBuchiCegarLoop]: Abstraction has 64 states and 77 transitions. [2025-02-06 19:31:50,567 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-02-06 19:31:50,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 77 transitions. [2025-02-06 19:31:50,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-02-06 19:31:50,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:31:50,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:31:50,568 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:31:50,568 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:31:50,568 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" [2025-02-06 19:31:50,568 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" [2025-02-06 19:31:50,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:50,568 INFO L85 PathProgramCache]: Analyzing trace with hash -22636574, now seen corresponding path program 2 times [2025-02-06 19:31:50,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:50,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102878619] [2025-02-06 19:31:50,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:31:50,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:50,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 19:31:50,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 19:31:50,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:31:50,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:50,593 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:50,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 19:31:50,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 19:31:50,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:50,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:50,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:50,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:50,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1506, now seen corresponding path program 2 times [2025-02-06 19:31:50,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:50,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074469307] [2025-02-06 19:31:50,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:31:50,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:50,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:50,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:50,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:31:50,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:50,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:50,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:31:50,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:31:50,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:50,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:50,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:50,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:31:50,627 INFO L85 PathProgramCache]: Analyzing trace with hash -278910589, now seen corresponding path program 6 times [2025-02-06 19:31:50,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:31:50,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253481299] [2025-02-06 19:31:50,627 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:31:50,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:31:50,635 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-02-06 19:31:50,650 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 19:31:50,651 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-06 19:31:50,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:50,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:31:50,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 19:31:50,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 19:31:50,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:31:50,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:31:50,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:31:52,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2025-02-06 19:31:59,835 WARN L286 SmtUtils]: Spent 9.09s on a formula simplification. DAG size of input: 374 DAG size of output: 281 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-06 19:32:00,435 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:32:00,436 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:32:00,436 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:32:00,436 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:32:00,436 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:32:00,436 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:00,436 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:32:00,436 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:32:00,436 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration19_Lasso [2025-02-06 19:32:00,436 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:32:00,436 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:32:00,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:00,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:01,316 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:32:01,317 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:32:01,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:01,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:01,319 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:01,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2025-02-06 19:32:01,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:01,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:01,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:01,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:01,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:01,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:01,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:01,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:01,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:01,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:01,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:01,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:01,349 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:01,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2025-02-06 19:32:01,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:01,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:01,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:01,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:01,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:01,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:01,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:01,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:01,363 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:01,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:01,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:01,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:01,371 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:01,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-02-06 19:32:01,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:32:01,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:01,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:01,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:01,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:01,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:01,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:01,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:01,390 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:01,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:01,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:01,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:01,398 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:01,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-02-06 19:32:01,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:01,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:01,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:01,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:01,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:01,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:01,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:01,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:01,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:01,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2025-02-06 19:32:01,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:01,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:01,421 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:01,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-02-06 19:32:01,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:32:01,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:01,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:01,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:01,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:01,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:01,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:01,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:01,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:01,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:01,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:01,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:01,444 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:01,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-02-06 19:32:01,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:01,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:01,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:01,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:01,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:01,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:01,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:01,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:01,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:01,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:01,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:01,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:01,467 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:01,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-02-06 19:32:01,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:01,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:01,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:01,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:01,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:01,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:01,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:01,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:01,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:01,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:01,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:01,494 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:01,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2025-02-06 19:32:01,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:01,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:01,506 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:32:01,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:01,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:01,508 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:32:01,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:01,511 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:01,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2025-02-06 19:32:01,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:01,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:01,519 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:01,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2025-02-06 19:32:01,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:01,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:01,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:01,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:01,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:01,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:01,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:01,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:01,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2025-02-06 19:32:01,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:01,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:01,545 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:01,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2025-02-06 19:32:01,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:01,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:01,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:01,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:01,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:01,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:01,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:01,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:01,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2025-02-06 19:32:01,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:01,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:01,571 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:01,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-02-06 19:32:01,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:01,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:01,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:01,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:01,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:01,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:01,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:01,594 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:32:01,608 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-06 19:32:01,608 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-02-06 19:32:01,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:01,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:01,611 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:01,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-02-06 19:32:01,612 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:32:01,623 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:32:01,623 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:32:01,623 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_A~0#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~nc_A~0#1 + 1*ULTIMATE.start_main_~j~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-06 19:32:01,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:01,660 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2025-02-06 19:32:01,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:32:01,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 19:32:01,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 19:32:01,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:01,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:32:01,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:32:01,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:32:01,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:32:01,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:32:01,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:01,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:32:01,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:32:01,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:32:01,744 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:32:01,744 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 19:32:01,744 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 77 transitions. cyclomatic complexity: 21 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:01,770 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 77 transitions. cyclomatic complexity: 21. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 97 states and 121 transitions. Complement of second has 6 states. [2025-02-06 19:32:01,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 19:32:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2025-02-06 19:32:01,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 37 letters. Loop has 2 letters. [2025-02-06 19:32:01,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:32:01,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 39 letters. Loop has 2 letters. [2025-02-06 19:32:01,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:32:01,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 37 letters. Loop has 4 letters. [2025-02-06 19:32:01,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:32:01,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 121 transitions. [2025-02-06 19:32:01,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:32:01,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 55 states and 64 transitions. [2025-02-06 19:32:01,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-02-06 19:32:01,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-02-06 19:32:01,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 64 transitions. [2025-02-06 19:32:01,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:32:01,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 64 transitions. [2025-02-06 19:32:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 64 transitions. [2025-02-06 19:32:01,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2025-02-06 19:32:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.163265306122449) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-02-06 19:32:01,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-02-06 19:32:01,777 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-02-06 19:32:01,777 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-02-06 19:32:01,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 57 transitions. [2025-02-06 19:32:01,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:32:01,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:32:01,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:32:01,777 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:32:01,777 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:32:01,778 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:32:01,778 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:32:01,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:32:01,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1808124845, now seen corresponding path program 7 times [2025-02-06 19:32:01,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:32:01,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674692684] [2025-02-06 19:32:01,778 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:32:01,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:32:01,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:01,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 19:32:01,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 19:32:01,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:01,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:32:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 19:32:01,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:32:01,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674692684] [2025-02-06 19:32:01,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674692684] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:32:01,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650804707] [2025-02-06 19:32:01,987 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:32:01,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:32:01,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:01,992 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:32:01,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2025-02-06 19:32:02,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 19:32:02,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 19:32:02,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:02,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:32:02,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 19:32:02,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:32:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 19:32:02,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:32:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 19:32:02,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650804707] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:32:02,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:32:02,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-02-06 19:32:02,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995907829] [2025-02-06 19:32:02,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:32:02,303 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:32:02,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:32:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1535, now seen corresponding path program 11 times [2025-02-06 19:32:02,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:32:02,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37169905] [2025-02-06 19:32:02,303 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:32:02,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:32:02,306 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:32:02,307 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:32:02,307 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:32:02,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:02,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:32:02,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:32:02,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:32:02,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:02,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:02,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:32:02,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:32:02,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 19:32:02,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-02-06 19:32:02,385 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. cyclomatic complexity: 14 Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:02,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:32:02,432 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2025-02-06 19:32:02,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 63 transitions. [2025-02-06 19:32:02,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:32:02,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 53 states and 61 transitions. [2025-02-06 19:32:02,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-06 19:32:02,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-02-06 19:32:02,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 61 transitions. [2025-02-06 19:32:02,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:32:02,436 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-02-06 19:32:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 61 transitions. [2025-02-06 19:32:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-02-06 19:32:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-02-06 19:32:02,438 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-02-06 19:32:02,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 19:32:02,438 INFO L432 stractBuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-02-06 19:32:02,438 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-02-06 19:32:02,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 59 transitions. [2025-02-06 19:32:02,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:32:02,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:32:02,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:32:02,443 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:32:02,443 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:32:02,443 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:32:02,443 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:32:02,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:32:02,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2074646226, now seen corresponding path program 8 times [2025-02-06 19:32:02,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:32:02,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311625321] [2025-02-06 19:32:02,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:32:02,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:32:02,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-06 19:32:02,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 19:32:02,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:32:02,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:02,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:32:02,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 19:32:02,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 19:32:02,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:02,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:02,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:32:02,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:32:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1535, now seen corresponding path program 12 times [2025-02-06 19:32:02,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:32:02,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750019095] [2025-02-06 19:32:02,518 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:32:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:32:02,520 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:32:02,521 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:32:02,521 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:32:02,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:02,521 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:32:02,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:32:02,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:32:02,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:02,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:02,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:32:02,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:32:02,524 INFO L85 PathProgramCache]: Analyzing trace with hash -870197268, now seen corresponding path program 9 times [2025-02-06 19:32:02,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:32:02,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870951165] [2025-02-06 19:32:02,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:32:02,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:32:02,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 5 equivalence classes. [2025-02-06 19:32:02,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 19:32:02,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-06 19:32:02,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:02,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:32:02,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 19:32:02,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 19:32:02,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:02,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:02,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:32:08,159 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 434 DAG size of output: 320 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-06 19:32:08,658 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:32:08,658 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:32:08,658 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:32:08,659 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:32:08,659 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:32:08,659 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:08,659 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:32:08,659 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:32:08,659 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration21_Lasso [2025-02-06 19:32:08,659 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:32:08,659 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:32:08,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:08,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:08,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:08,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:08,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:08,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:08,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:08,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:08,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:08,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:08,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:09,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:09,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:09,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:09,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:09,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:09,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:09,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:10,287 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:32:10,288 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:32:10,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:10,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:10,290 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:10,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2025-02-06 19:32:10,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:10,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:10,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:10,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:10,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:10,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:10,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:10,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:10,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:10,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2025-02-06 19:32:10,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:10,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:10,311 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:10,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2025-02-06 19:32:10,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:10,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:10,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:10,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:10,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:10,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:10,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:10,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:10,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:10,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:10,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:10,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:10,332 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:10,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2025-02-06 19:32:10,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:32:10,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:10,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:10,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:10,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:10,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:10,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:10,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:10,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:10,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2025-02-06 19:32:10,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:10,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:10,353 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:10,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2025-02-06 19:32:10,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:10,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:10,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:10,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:10,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:10,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:10,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:10,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:10,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:10,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2025-02-06 19:32:10,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:10,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:10,374 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:10,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2025-02-06 19:32:10,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:10,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:10,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:10,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:10,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:10,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:10,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:10,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:10,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:10,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2025-02-06 19:32:10,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:10,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:10,395 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:10,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2025-02-06 19:32:10,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:10,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:10,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:10,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:10,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:10,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:10,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:10,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:10,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:10,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2025-02-06 19:32:10,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:10,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:10,434 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:10,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2025-02-06 19:32:10,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:32:10,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:10,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:10,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:10,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:10,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:10,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:10,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:10,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:10,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:10,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:10,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:10,456 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:10,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2025-02-06 19:32:10,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:32:10,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:10,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:10,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:10,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:10,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:10,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:10,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:10,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:10,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:10,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:10,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:10,480 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:10,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2025-02-06 19:32:10,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:32:10,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:10,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:10,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:10,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:10,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:10,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:10,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:10,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:10,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:10,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:10,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:10,502 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:10,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2025-02-06 19:32:10,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:32:10,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:10,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:10,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:10,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:10,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:10,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:10,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:10,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:10,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:10,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:10,525 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:10,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2025-02-06 19:32:10,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:32:10,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:10,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:10,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:10,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:10,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:10,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:10,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:10,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:10,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:10,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:10,549 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:10,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2025-02-06 19:32:10,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:10,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:10,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:10,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:10,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:10,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:10,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:10,568 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:32:10,582 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-02-06 19:32:10,582 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-02-06 19:32:10,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:10,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:10,585 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:10,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2025-02-06 19:32:10,586 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:32:10,596 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:32:10,596 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:32:10,596 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~nc_B~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~nc_B~0#1 Supporting invariants [] [2025-02-06 19:32:10,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2025-02-06 19:32:10,662 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2025-02-06 19:32:10,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:32:10,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 19:32:10,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 19:32:10,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:10,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:32:10,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:32:10,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:32:10,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:32:10,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:32:10,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:10,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:32:10,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:32:10,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:32:10,764 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:32:10,765 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 19:32:10,765 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 59 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:10,777 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 59 transitions. cyclomatic complexity: 14. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 72 states and 86 transitions. Complement of second has 5 states. [2025-02-06 19:32:10,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:32:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2025-02-06 19:32:10,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 44 letters. Loop has 2 letters. [2025-02-06 19:32:10,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:32:10,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 46 letters. Loop has 2 letters. [2025-02-06 19:32:10,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:32:10,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 44 letters. Loop has 4 letters. [2025-02-06 19:32:10,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:32:10,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 86 transitions. [2025-02-06 19:32:10,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:32:10,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 64 states and 76 transitions. [2025-02-06 19:32:10,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-02-06 19:32:10,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-02-06 19:32:10,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 76 transitions. [2025-02-06 19:32:10,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:32:10,779 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 76 transitions. [2025-02-06 19:32:10,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 76 transitions. [2025-02-06 19:32:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2025-02-06 19:32:10,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 55 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-02-06 19:32:10,783 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-02-06 19:32:10,783 INFO L432 stractBuchiCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-02-06 19:32:10,783 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-02-06 19:32:10,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 66 transitions. [2025-02-06 19:32:10,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:32:10,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:32:10,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:32:10,784 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:32:10,784 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:32:10,784 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:32:10,784 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:32:10,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:32:10,784 INFO L85 PathProgramCache]: Analyzing trace with hash -871119828, now seen corresponding path program 10 times [2025-02-06 19:32:10,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:32:10,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927950520] [2025-02-06 19:32:10,785 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:32:10,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:32:10,792 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-02-06 19:32:10,808 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 19:32:10,809 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:32:10,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:10,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:32:10,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 19:32:10,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 19:32:10,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:10,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:10,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:32:10,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:32:10,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1535, now seen corresponding path program 13 times [2025-02-06 19:32:10,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:32:10,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451705692] [2025-02-06 19:32:10,833 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:32:10,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:32:10,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:32:10,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:32:10,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:10,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:10,836 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:32:10,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:32:10,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:32:10,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:10,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:10,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:32:10,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:32:10,838 INFO L85 PathProgramCache]: Analyzing trace with hash 372468586, now seen corresponding path program 11 times [2025-02-06 19:32:10,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:32:10,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176851341] [2025-02-06 19:32:10,838 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:32:10,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:32:10,847 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 5 equivalence classes. [2025-02-06 19:32:10,864 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 19:32:10,865 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 19:32:10,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:10,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:32:10,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 19:32:10,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 19:32:10,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:10,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:10,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:32:16,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2025-02-06 19:32:20,417 WARN L286 SmtUtils]: Spent 9.47s on a formula simplification. DAG size of input: 457 DAG size of output: 340 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-06 19:32:21,572 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:32:21,573 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:32:21,573 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:32:21,573 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:32:21,573 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:32:21,573 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:21,573 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:32:21,573 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:32:21,573 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-2.i_Iteration22_Lasso [2025-02-06 19:32:21,573 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:32:21,573 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:32:21,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:21,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:21,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:21,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:21,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:21,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:21,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:21,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:21,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:21,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:21,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:21,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:21,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:21,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:22,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:22,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:22,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:22,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:32:22,608 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-02-06 19:32:25,508 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:32:25,508 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:32:25,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,512 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2025-02-06 19:32:25,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:25,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:25,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:25,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:25,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:25,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,543 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2025-02-06 19:32:25,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:25,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:25,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:25,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:25,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:25,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,573 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2025-02-06 19:32:25,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:25,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:25,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:25,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:25,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:25,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,609 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2025-02-06 19:32:25,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:25,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:25,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:25,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:25,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:25,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,639 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2025-02-06 19:32:25,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:25,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:25,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:25,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:25,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2025-02-06 19:32:25,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,663 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2025-02-06 19:32:25,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:25,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:25,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:25,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:25,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:25,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,685 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2025-02-06 19:32:25,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:32:25,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:25,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:25,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:25,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2025-02-06 19:32:25,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,709 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2025-02-06 19:32:25,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:32:25,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:25,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:25,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:25,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2025-02-06 19:32:25,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,732 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/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:32:25,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2025-02-06 19:32:25,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:25,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:25,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:25,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:25,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2025-02-06 19:32:25,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,755 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2025-02-06 19:32:25,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:25,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:25,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:25,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:25,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:25,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,784 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2025-02-06 19:32:25,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:32:25,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:25,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:25,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:25,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2025-02-06 19:32:25,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,810 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2025-02-06 19:32:25,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:25,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:32:25,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:32:25,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:32:25,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2025-02-06 19:32:25,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,837 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2025-02-06 19:32:25,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:25,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:25,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:25,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2025-02-06 19:32:25,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,862 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2025-02-06 19:32:25,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:25,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,876 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:25,876 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:25,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:25,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,887 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2025-02-06 19:32:25,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:25,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,898 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:32:25,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,899 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:32:25,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:25,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2025-02-06 19:32:25,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,910 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2025-02-06 19:32:25,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:25,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:25,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:25,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2025-02-06 19:32:25,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,934 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2025-02-06 19:32:25,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:32:25,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:25,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:25,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2025-02-06 19:32:25,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,972 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2025-02-06 19:32:25,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:32:25,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:25,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:25,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:25,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:25,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:25,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:25,989 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:25,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:25,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:25,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:25,997 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:25,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2025-02-06 19:32:25,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:32:26,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:26,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:26,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:26,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:26,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:26,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:26,014 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:26,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2025-02-06 19:32:26,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:26,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:26,023 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:26,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2025-02-06 19:32:26,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:32:26,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:26,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:26,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:26,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:26,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:26,036 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:26,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:26,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2025-02-06 19:32:26,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:26,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:26,046 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:26,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2025-02-06 19:32:26,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:32:26,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:26,060 INFO L203 nArgumentSynthesizer]: 36 stem disjuncts [2025-02-06 19:32:26,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:26,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:26,155 INFO L401 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2025-02-06 19:32:26,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:26,263 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:26,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2025-02-06 19:32:26,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:26,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:26,274 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:26,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2025-02-06 19:32:26,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:26,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:26,286 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:32:26,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:26,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:26,287 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:32:26,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:26,290 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:26,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:26,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:26,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:26,298 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:26,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2025-02-06 19:32:26,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:26,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:26,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:26,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:26,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:26,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:26,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:26,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:32:26,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:26,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:26,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:26,321 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:26,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2025-02-06 19:32:26,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:32:26,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:32:26,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:32:26,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:32:26,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:32:26,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:32:26,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:32:26,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:32:26,364 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2025-02-06 19:32:26,364 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-02-06 19:32:26,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:32:26,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:26,366 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:32:26,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2025-02-06 19:32:26,368 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:32:26,380 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:32:26,380 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:32:26,380 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#string_B~0#1.base)_11) = -2*ULTIMATE.start_main_~j~0#1 + 7*v_rep(select #length ULTIMATE.start_main_~#string_B~0#1.base)_11 Supporting invariants [] [2025-02-06 19:32:26,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Ended with exit code 0 [2025-02-06 19:32:26,460 INFO L156 tatePredicateManager]: 22 out of 23 supporting invariants were superfluous and have been removed [2025-02-06 19:32:26,462 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:32:26,462 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:32:26,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:32:26,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 19:32:26,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 19:32:26,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:26,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:32:26,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:32:26,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:32:26,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:32:26,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:32:26,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:26,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:32:26,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:32:26,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:32:26,687 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:32:26,688 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2025-02-06 19:32:26,688 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 66 transitions. cyclomatic complexity: 17 Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:26,795 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 66 transitions. cyclomatic complexity: 17. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 83 states and 101 transitions. Complement of second has 11 states. [2025-02-06 19:32:26,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2025-02-06 19:32:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2025-02-06 19:32:26,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 46 letters. Loop has 2 letters. [2025-02-06 19:32:26,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:32:26,796 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:32:26,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:32:26,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 19:32:26,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 19:32:26,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:26,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:32:26,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:32:26,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:32:26,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:32:26,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:32:26,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:26,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:32:26,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:32:26,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:32:26,985 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:32:26,986 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2025-02-06 19:32:26,986 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 66 transitions. cyclomatic complexity: 17 Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:27,087 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 66 transitions. cyclomatic complexity: 17. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 83 states and 101 transitions. Complement of second has 11 states. [2025-02-06 19:32:27,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2025-02-06 19:32:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2025-02-06 19:32:27,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 46 letters. Loop has 2 letters. [2025-02-06 19:32:27,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:32:27,089 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:32:27,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:32:27,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 19:32:27,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 19:32:27,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:27,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:32:27,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:32:27,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:32:27,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:32:27,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:32:27,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:27,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:32:27,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:32:27,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:32:27,255 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:32:27,256 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 2 loop predicates [2025-02-06 19:32:27,256 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 66 transitions. cyclomatic complexity: 17 Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:27,350 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 66 transitions. cyclomatic complexity: 17. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 91 states and 113 transitions. Complement of second has 10 states. [2025-02-06 19:32:27,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2025-02-06 19:32:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2025-02-06 19:32:27,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 46 letters. Loop has 2 letters. [2025-02-06 19:32:27,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:32:27,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 48 letters. Loop has 2 letters. [2025-02-06 19:32:27,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:32:27,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 46 letters. Loop has 4 letters. [2025-02-06 19:32:27,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:32:27,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 113 transitions. [2025-02-06 19:32:27,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:32:27,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 60 states and 71 transitions. [2025-02-06 19:32:27,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-06 19:32:27,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-02-06 19:32:27,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 71 transitions. [2025-02-06 19:32:27,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:32:27,353 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 71 transitions. [2025-02-06 19:32:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 71 transitions. [2025-02-06 19:32:27,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-02-06 19:32:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 57 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-02-06 19:32:27,353 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-02-06 19:32:27,353 INFO L432 stractBuchiCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-02-06 19:32:27,353 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-02-06 19:32:27,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 68 transitions. [2025-02-06 19:32:27,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:32:27,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:32:27,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:32:27,354 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:32:27,354 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:32:27,354 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);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_#t~bitwise15#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:32:27,356 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:32:27,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:32:27,356 INFO L85 PathProgramCache]: Analyzing trace with hash -542590675, now seen corresponding path program 12 times [2025-02-06 19:32:27,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:32:27,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637058700] [2025-02-06 19:32:27,356 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:32:27,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:32:27,365 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 6 equivalence classes. [2025-02-06 19:32:27,378 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 19:32:27,380 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-06 19:32:27,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:32:27,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2025-02-06 19:32:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-06 19:32:27,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:32:27,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637058700] [2025-02-06 19:32:27,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637058700] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:32:27,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149642554] [2025-02-06 19:32:27,645 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:32:27,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:32:27,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:32:27,648 INFO L229 MonitoredProcess]: Starting monitored process 204 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:32:27,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (204)] Waiting until timeout for monitored process [2025-02-06 19:32:27,757 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 6 equivalence classes. [2025-02-06 19:32:27,816 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 19:32:27,816 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-06 19:32:27,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:32:27,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 19:32:27,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:32:27,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-06 19:32:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-06 19:32:27,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 19:32:27,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149642554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:32:27,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 19:32:27,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2025-02-06 19:32:27,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768402719] [2025-02-06 19:32:27,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:32:27,998 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:32:27,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:32:27,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1535, now seen corresponding path program 14 times [2025-02-06 19:32:27,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:32:27,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458999391] [2025-02-06 19:32:27,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:32:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:32:28,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:32:28,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:32:28,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:32:28,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:28,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:32:28,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:32:28,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:32:28,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:32:28,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:32:28,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:32:28,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:32:28,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 19:32:28,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-02-06 19:32:28,061 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. cyclomatic complexity: 17 Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:32:28,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:32:28,087 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2025-02-06 19:32:28,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 38 transitions. [2025-02-06 19:32:28,088 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:32:28,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2025-02-06 19:32:28,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-06 19:32:28,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-06 19:32:28,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-06 19:32:28,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:32:28,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:32:28,088 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:32:28,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 19:32:28,089 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:32:28,089 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-02-06 19:32:28,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-06 19:32:28,089 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:32:28,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-06 19:32:28,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:32:28 BoogieIcfgContainer [2025-02-06 19:32:28,094 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:32:28,095 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:32:28,095 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:32:28,095 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:32:28,095 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:30:59" (3/4) ... [2025-02-06 19:32:28,097 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 19:32:28,097 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:32:28,097 INFO L158 Benchmark]: Toolchain (without parser) took 88885.94ms. Allocated memory was 545.3MB in the beginning and 536.9MB in the end (delta: -8.4MB). Free memory was 502.1MB in the beginning and 399.7MB in the end (delta: 102.4MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2025-02-06 19:32:28,098 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:32:28,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.66ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 96.7MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:32:28,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.72ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 94.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:32:28,098 INFO L158 Benchmark]: Boogie Preprocessor took 26.32ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:32:28,098 INFO L158 Benchmark]: IcfgBuilder took 248.56ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 78.1MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 19:32:28,098 INFO L158 Benchmark]: BuchiAutomizer took 88414.47ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 78.1MB in the beginning and 399.8MB in the end (delta: -321.7MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. [2025-02-06 19:32:28,099 INFO L158 Benchmark]: Witness Printer took 2.37ms. Allocated memory is still 536.9MB. Free memory was 399.8MB in the beginning and 399.7MB in the end (delta: 105.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:32:28,099 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.45ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.66ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 96.7MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.72ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 94.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.32ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 248.56ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 78.1MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 88414.47ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 78.1MB in the beginning and 399.8MB in the end (delta: -321.7MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. * Witness Printer took 2.37ms. Allocated memory is still 536.9MB. Free memory was 399.8MB in the beginning and 399.7MB in the end (delta: 105.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#string_B~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 23 terminating modules (12 trivial, 9 deterministic, 2 nondeterministic). One deterministic module has affine ranking function null and consists of 2 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function (((long long) -1 * i) + nc_A) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -4 * i) + ((long long) 3 * nc_A)) and consists of 7 locations. One deterministic module has affine ranking function (((long long) -1 * j) + nc_B) and consists of 3 locations. One deterministic module has affine ranking function null and consists of 8 locations. One deterministic module has affine ranking function ((((long long) -1 * i) + j) + nc_A) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -1 * j) + nc_B) and consists of 3 locations. One nondeterministic module has affine ranking function (((long long) -2 * i) + 5) and consists of 8 locations. One nondeterministic module has affine ranking function null and consists of 9 locations. 12 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 88.3s and 24 iterations. TraceHistogramMax:6. Analysis of lassos took 84.6s. Construction of modules took 0.7s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 17. Automata minimization 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 93 StatesRemovedByMinimization, 17 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 [9, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 554 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 548 mSDsluCounter, 1208 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 832 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1267 IncrementalHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 376 mSDtfsCounter, 1267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU8 SILI0 SILT0 lasso11 LassoPreprocessingBenchmarks: Lassos: inital350 mio100 ax100 hnf100 lsp94 ukn49 mio100 lsp26 div100 bol100 ite100 ukn100 eq176 hnf91 smp100 dnf938 smp79 tf100 neg100 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 218ms VariablesStem: 12 VariablesLoop: 10 DisjunctsStem: 36 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 76 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:32:28,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (204)] Ended with exit code 0 [2025-02-06 19:32:28,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Ended with exit code 0 [2025-02-06 19:32:28,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2025-02-06 19:32:28,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:28,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:29,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2025-02-06 19:32:29,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-02-06 19:32:29,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:29,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:29,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 19:32:30,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE