./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/strrchr.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-dietlibc/strrchr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b850f5453e922b3972aa9b5b79a1b07337c08d581cc5e6a2a56803408dc479cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:03:51,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:03:51,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-06 19:03:51,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:03:51,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:03:51,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:03:51,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:03:51,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:03:51,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:03:51,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:03:51,741 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:03:51,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:03:51,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:03:51,741 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:03:51,741 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:03:51,741 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:03:51,741 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:03:51,741 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:03:51,741 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:03:51,742 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:03:51,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:03:51,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:03:51,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:03:51,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:03:51,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:03:51,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:03:51,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:03:51,742 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:03:51,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:03:51,742 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:03:51,742 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:03:51,742 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:03:51,743 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:03:51,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:03:51,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:03:51,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:03:51,743 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:03:51,743 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b850f5453e922b3972aa9b5b79a1b07337c08d581cc5e6a2a56803408dc479cf [2025-02-06 19:03:51,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:03:51,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:03:51,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:03:51,981 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:03:51,981 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:03:51,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strrchr.i [2025-02-06 19:03:53,125 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da48f1449/b1143656fef84b3792fcee3198e59654/FLAG8c2f7125a [2025-02-06 19:03:53,444 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:03:53,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strrchr.i [2025-02-06 19:03:53,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da48f1449/b1143656fef84b3792fcee3198e59654/FLAG8c2f7125a [2025-02-06 19:03:53,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da48f1449/b1143656fef84b3792fcee3198e59654 [2025-02-06 19:03:53,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:03:53,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:03:53,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:03:53,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:03:53,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:03:53,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:03:53" (1/1) ... [2025-02-06 19:03:53,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a274b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:53, skipping insertion in model container [2025-02-06 19:03:53,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:03:53" (1/1) ... [2025-02-06 19:03:53,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:03:53,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:03:53,704 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:03:53,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:03:53,750 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:03:53,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:53 WrapperNode [2025-02-06 19:03:53,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:03:53,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:03:53,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:03:53,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:03:53,756 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:03:53" (1/1) ... [2025-02-06 19:03:53,763 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:03:53" (1/1) ... [2025-02-06 19:03:53,775 INFO L138 Inliner]: procedures = 114, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2025-02-06 19:03:53,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:03:53,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:03:53,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:03:53,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:03:53,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:53" (1/1) ... [2025-02-06 19:03:53,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:53" (1/1) ... [2025-02-06 19:03:53,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:53" (1/1) ... [2025-02-06 19:03:53,791 INFO L175 MemorySlicer]: Split 10 memory accesses to 1 slices as follows [10]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-02-06 19:03:53,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:53" (1/1) ... [2025-02-06 19:03:53,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:53" (1/1) ... [2025-02-06 19:03:53,795 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:53" (1/1) ... [2025-02-06 19:03:53,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:53" (1/1) ... [2025-02-06 19:03:53,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:53" (1/1) ... [2025-02-06 19:03:53,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:53" (1/1) ... [2025-02-06 19:03:53,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:03:53,801 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:03:53,801 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:03:53,801 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:03:53,802 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:53" (1/1) ... [2025-02-06 19:03:53,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:53,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:53,832 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:03:53,839 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:03:53,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:03:53,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:03:53,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 19:03:53,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:03:53,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:03:53,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:03:53,916 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:03:53,917 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:03:54,074 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: havoc main_#t~ret19#1.base, main_#t~ret19#1.offset;call ULTIMATE.dealloc(main_#t~malloc15#1.base, main_#t~malloc15#1.offset);havoc main_#t~malloc15#1.base, main_#t~malloc15#1.offset; [2025-02-06 19:03:54,081 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-06 19:03:54,081 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:03:54,086 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:03:54,087 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:03:54,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:03:54 BoogieIcfgContainer [2025-02-06 19:03:54,087 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:03:54,088 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:03:54,088 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:03:54,092 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:03:54,092 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:03:54,092 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:03:53" (1/3) ... [2025-02-06 19:03:54,093 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@832d78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:03:54, skipping insertion in model container [2025-02-06 19:03:54,093 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:03:54,094 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:53" (2/3) ... [2025-02-06 19:03:54,094 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@832d78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:03:54, skipping insertion in model container [2025-02-06 19:03:54,094 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:03:54,094 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:03:54" (3/3) ... [2025-02-06 19:03:54,095 INFO L363 chiAutomizerObserver]: Analyzing ICFG strrchr.i [2025-02-06 19:03:54,127 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:03:54,128 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:03:54,128 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:03:54,128 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:03:54,128 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:03:54,128 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:03:54,128 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:03:54,128 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:03:54,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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:03:54,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-02-06 19:03:54,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:03:54,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:03:54,155 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:03:54,155 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:03:54,155 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:03:54,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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:03:54,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-02-06 19:03:54,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:03:54,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:03:54,157 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:03:54,157 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:03:54,160 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" [2025-02-06 19:03:54,161 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" [2025-02-06 19:03:54,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash 76429, now seen corresponding path program 1 times [2025-02-06 19:03:54,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:54,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926437636] [2025-02-06 19:03:54,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:54,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:54,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:03:54,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:03:54,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:54,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:54,234 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:54,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:03:54,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:03:54,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:54,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:54,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:54,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:54,259 INFO L85 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 1 times [2025-02-06 19:03:54,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:54,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788193810] [2025-02-06 19:03:54,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:54,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:54,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:03:54,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:03:54,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:54,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:54,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:54,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:03:54,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:03:54,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:54,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:54,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:54,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:54,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2369339, now seen corresponding path program 1 times [2025-02-06 19:03:54,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:54,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142922926] [2025-02-06 19:03:54,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:54,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:54,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:03:54,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:03:54,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:54,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:54,312 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:54,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:03:54,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:03:54,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:54,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:54,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:54,566 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:03:54,567 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:03:54,569 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:03:54,569 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:03:54,569 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:03:54,569 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:54,569 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:03:54,569 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:03:54,569 INFO L132 ssoRankerPreferences]: Filename of dumped script: strrchr.i_Iteration1_Lasso [2025-02-06 19:03:54,569 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:03:54,569 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:03:54,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:54,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:54,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:54,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:54,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:54,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:54,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:54,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:54,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:54,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:54,919 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:03:54,922 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:03:54,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:54,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:54,927 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:03:54,932 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:03:54,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:54,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:54,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:03:54,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:54,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:54,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:54,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:03:54,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:03:54,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:54,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:54,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:54,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:54,960 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:03:54,960 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:03:54,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:54,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:54,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:54,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:54,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:54,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:03:54,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:03:54,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:54,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:54,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:54,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:54,989 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:03:54,989 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:03:54,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:55,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:55,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:03:55,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:55,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:55,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:55,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:03:55,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:03:55,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:55,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:55,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:55,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:55,013 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:03:55,014 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:03:55,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:55,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:55,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:55,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:55,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:55,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:03:55,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:03:55,034 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:55,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-06 19:03:55,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:55,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:55,043 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:03:55,047 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:03:55,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:55,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:55,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:55,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:55,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:55,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:03:55,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:03:55,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:55,071 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:03:55,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:55,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:55,075 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:03:55,075 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:03:55,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:55,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:55,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:55,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:55,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:55,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:03:55,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:03:55,107 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:03:55,132 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-02-06 19:03:55,133 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-02-06 19:03:55,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:55,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:55,138 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:55,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-06 19:03:55,139 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:03:55,150 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:03:55,150 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:03:55,151 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~in_len~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~in_len~0#1 Supporting invariants [] [2025-02-06 19:03:55,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-06 19:03:55,166 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-02-06 19:03:55,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:55,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:03:55,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:03:55,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:55,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:55,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:03:55,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:55,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:03:55,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:03:55,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:55,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:55,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:03:55,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:55,210 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:03:55,232 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:03:55,234 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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:03:55,258 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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). Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) Result 26 states and 37 transitions. Complement of second has 3 states. [2025-02-06 19:03:55,262 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:03:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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:03:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2025-02-06 19:03:55,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 3 letters. Loop has 1 letters. [2025-02-06 19:03:55,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:03:55,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 4 letters. Loop has 1 letters. [2025-02-06 19:03:55,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:03:55,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-06 19:03:55,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:03:55,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 37 transitions. [2025-02-06 19:03:55,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:03:55,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 19 states and 25 transitions. [2025-02-06 19:03:55,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-06 19:03:55,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-02-06 19:03:55,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2025-02-06 19:03:55,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:03:55,279 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-02-06 19:03:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2025-02-06 19:03:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-02-06 19:03:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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:03:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-02-06 19:03:55,295 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-02-06 19:03:55,295 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-02-06 19:03:55,295 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:03:55,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2025-02-06 19:03:55,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:03:55,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:03:55,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:03:55,296 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:03:55,296 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:03:55,297 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" [2025-02-06 19:03:55,297 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" [2025-02-06 19:03:55,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:55,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2369338, now seen corresponding path program 1 times [2025-02-06 19:03:55,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:55,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600512976] [2025-02-06 19:03:55,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:55,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:55,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:03:55,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:03:55,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:55,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:55,310 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:55,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:03:55,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:03:55,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:55,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:55,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:55,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:55,326 INFO L85 PathProgramCache]: Analyzing trace with hash -635149067, now seen corresponding path program 1 times [2025-02-06 19:03:55,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:55,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518750633] [2025-02-06 19:03:55,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:55,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:55,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:03:55,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:03:55,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:55,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:55,345 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:55,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:03:55,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:03:55,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:55,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:55,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:55,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:55,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1218019932, now seen corresponding path program 1 times [2025-02-06 19:03:55,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:55,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074681899] [2025-02-06 19:03:55,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:55,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:55,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:03:55,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:03:55,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:55,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:55,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-06 19:03:55,727 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:03:55,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:03:55,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074681899] [2025-02-06 19:03:55,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074681899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:03:55,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:03:55,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 19:03:55,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502797245] [2025-02-06 19:03:55,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:03:55,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:03:55,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:03:55,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 19:03:55,945 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:03:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:03:55,984 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-02-06 19:03:55,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2025-02-06 19:03:55,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:03:55,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 18 states and 23 transitions. [2025-02-06 19:03:55,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-06 19:03:55,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-06 19:03:55,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2025-02-06 19:03:55,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:03:55,986 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-02-06 19:03:55,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2025-02-06 19:03:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-06 19:03:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 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:03:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2025-02-06 19:03:55,987 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-02-06 19:03:55,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:03:55,987 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-02-06 19:03:55,988 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:03:55,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2025-02-06 19:03:55,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:03:55,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:03:55,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:03:55,988 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:03:55,988 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:03:55,988 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" [2025-02-06 19:03:55,988 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" [2025-02-06 19:03:55,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:55,989 INFO L85 PathProgramCache]: Analyzing trace with hash 73449548, now seen corresponding path program 1 times [2025-02-06 19:03:55,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:55,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772031210] [2025-02-06 19:03:55,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:55,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:56,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:03:56,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:03:56,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:56,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:56,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:56,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:03:56,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:03:56,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:56,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:56,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:56,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:56,026 INFO L85 PathProgramCache]: Analyzing trace with hash -635149067, now seen corresponding path program 2 times [2025-02-06 19:03:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905912008] [2025-02-06 19:03:56,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:03:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:56,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:03:56,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:03:56,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:03:56,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:56,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:56,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:03:56,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:03:56,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:56,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:56,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:56,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:56,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1962260106, now seen corresponding path program 1 times [2025-02-06 19:03:56,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:56,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131122648] [2025-02-06 19:03:56,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:56,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:56,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:03:56,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:03:56,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:56,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:56,274 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:03:56,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:03:56,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131122648] [2025-02-06 19:03:56,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131122648] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:03:56,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343432725] [2025-02-06 19:03:56,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:56,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:03:56,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:56,278 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:03:56,279 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:03:56,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:03:56,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:03:56,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:56,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:56,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 19:03:56,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:56,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 19:03:56,521 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:03:56,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:03:56,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 19:03:56,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 128 [2025-02-06 19:03:56,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2025-02-06 19:03:56,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 19:03:56,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 113 [2025-02-06 19:03:56,911 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:03:56,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343432725] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:03:56,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:03:56,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 11] total 23 [2025-02-06 19:03:56,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466583136] [2025-02-06 19:03:56,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:03:57,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:03:57,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 19:03:57,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-02-06 19:03:57,150 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 7 Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 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:03:57,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:03:57,631 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2025-02-06 19:03:57,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2025-02-06 19:03:57,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:03:57,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 19 states and 24 transitions. [2025-02-06 19:03:57,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-06 19:03:57,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-06 19:03:57,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2025-02-06 19:03:57,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:03:57,632 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-02-06 19:03:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2025-02-06 19:03:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-06 19:03:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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:03:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-02-06 19:03:57,634 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-02-06 19:03:57,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 19:03:57,634 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-02-06 19:03:57,634 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:03:57,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2025-02-06 19:03:57,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:03:57,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:03:57,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:03:57,635 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2025-02-06 19:03:57,635 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:03:57,635 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" [2025-02-06 19:03:57,636 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" [2025-02-06 19:03:57,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:57,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2018031238, now seen corresponding path program 2 times [2025-02-06 19:03:57,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:57,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631130933] [2025-02-06 19:03:57,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:03:57,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:57,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-02-06 19:03:57,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:03:57,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:03:57,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:57,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:57,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:03:57,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:03:57,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:57,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:57,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:57,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:57,658 INFO L85 PathProgramCache]: Analyzing trace with hash -635149067, now seen corresponding path program 3 times [2025-02-06 19:03:57,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:57,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422940196] [2025-02-06 19:03:57,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:03:57,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:57,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:03:57,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:03:57,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:03:57,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:57,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:57,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:03:57,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:03:57,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:57,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:57,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:57,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:57,669 INFO L85 PathProgramCache]: Analyzing trace with hash -736098276, now seen corresponding path program 2 times [2025-02-06 19:03:57,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:57,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398721263] [2025-02-06 19:03:57,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:03:57,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:57,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-06 19:03:57,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:03:57,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:03:57,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:03:57,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:03:57,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398721263] [2025-02-06 19:03:57,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398721263] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:03:57,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591136171] [2025-02-06 19:03:57,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:03:57,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:03:57,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:57,961 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:03:57,962 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:03:57,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-06 19:03:58,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:03:58,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:03:58,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:58,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 19:03:58,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:58,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 19:03:58,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:03:58,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:03:58,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 19:03:58,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 98 [2025-02-06 19:03:58,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-02-06 19:03:58,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 19:03:58,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 53 [2025-02-06 19:03:58,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:03:58,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591136171] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:03:58,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:03:58,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 13] total 28 [2025-02-06 19:03:58,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670623759] [2025-02-06 19:03:58,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:03:58,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:03:58,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 19:03:58,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2025-02-06 19:03:58,699 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 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:03:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:03:59,137 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-02-06 19:03:59,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. [2025-02-06 19:03:59,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:03:59,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 20 states and 25 transitions. [2025-02-06 19:03:59,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-06 19:03:59,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-06 19:03:59,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2025-02-06 19:03:59,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:03:59,139 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-02-06 19:03:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2025-02-06 19:03:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-06 19:03:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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:03:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-02-06 19:03:59,140 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-02-06 19:03:59,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 19:03:59,140 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-02-06 19:03:59,140 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:03:59,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2025-02-06 19:03:59,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:03:59,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:03:59,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:03:59,145 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2025-02-06 19:03:59,145 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:03:59,145 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" [2025-02-06 19:03:59,145 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" [2025-02-06 19:03:59,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:59,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1865541132, now seen corresponding path program 3 times [2025-02-06 19:03:59,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:59,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679952451] [2025-02-06 19:03:59,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:03:59,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:59,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 3 equivalence classes. [2025-02-06 19:03:59,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:03:59,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 19:03:59,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:59,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:59,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:03:59,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:03:59,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:59,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:59,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:59,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:59,167 INFO L85 PathProgramCache]: Analyzing trace with hash -635149067, now seen corresponding path program 4 times [2025-02-06 19:03:59,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:59,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604502615] [2025-02-06 19:03:59,167 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:03:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:59,170 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13 statements into 2 equivalence classes. [2025-02-06 19:03:59,173 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:03:59,174 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:03:59,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:59,174 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:59,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:03:59,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:03:59,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:59,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:59,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:59,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:59,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1514137802, now seen corresponding path program 3 times [2025-02-06 19:03:59,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:59,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292112765] [2025-02-06 19:03:59,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:03:59,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:59,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-02-06 19:03:59,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:03:59,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 19:03:59,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:59,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:03:59,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:03:59,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292112765] [2025-02-06 19:03:59,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292112765] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:03:59,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854192834] [2025-02-06 19:03:59,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:03:59,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:03:59,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:59,590 INFO L229 MonitoredProcess]: Starting monitored process 11 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:03:59,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 19:03:59,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-02-06 19:03:59,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:03:59,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 19:03:59,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:59,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 19:03:59,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:59,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 19:03:59,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:03:59,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:03:59,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-02-06 19:03:59,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 19:03:59,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 53 [2025-02-06 19:04:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:04:00,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854192834] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:04:00,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:04:00,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2025-02-06 19:04:00,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465890004] [2025-02-06 19:04:00,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:04:00,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:04:00,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 19:04:00,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2025-02-06 19:04:00,210 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 7 Second operand has 32 states, 32 states have (on average 1.40625) internal successors, (45), 32 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:04:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:04:00,430 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2025-02-06 19:04:00,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2025-02-06 19:04:00,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:04:00,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 45 transitions. [2025-02-06 19:04:00,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2025-02-06 19:04:00,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-02-06 19:04:00,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2025-02-06 19:04:00,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:04:00,431 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2025-02-06 19:04:00,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2025-02-06 19:04:00,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-02-06 19:04:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 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:04:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2025-02-06 19:04:00,433 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2025-02-06 19:04:00,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 19:04:00,434 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2025-02-06 19:04:00,434 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:04:00,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2025-02-06 19:04:00,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:04:00,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:04:00,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:04:00,435 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1] [2025-02-06 19:04:00,435 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:04:00,435 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" [2025-02-06 19:04:00,436 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" [2025-02-06 19:04:00,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:00,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1997200314, now seen corresponding path program 4 times [2025-02-06 19:04:00,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:00,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357723586] [2025-02-06 19:04:00,436 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:04:00,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:00,457 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-02-06 19:04:00,460 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:04:00,461 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:04:00,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:00,461 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:00,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:04:00,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:04:00,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:00,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:00,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:00,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash -635149067, now seen corresponding path program 5 times [2025-02-06 19:04:00,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:00,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658162173] [2025-02-06 19:04:00,467 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:04:00,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:00,470 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:04:00,472 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:04:00,472 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:04:00,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:00,473 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:00,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:04:00,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:04:00,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:00,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:00,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:00,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:00,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1742987812, now seen corresponding path program 4 times [2025-02-06 19:04:00,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:00,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937359880] [2025-02-06 19:04:00,479 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:04:00,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:00,484 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-02-06 19:04:00,491 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:04:00,492 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:04:00,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:00,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:00,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 19:04:00,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:04:00,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:00,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:00,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:01,192 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:04:01,192 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:04:01,192 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:04:01,192 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:04:01,192 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:04:01,192 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:01,192 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:04:01,192 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:04:01,192 INFO L132 ssoRankerPreferences]: Filename of dumped script: strrchr.i_Iteration6_Lasso [2025-02-06 19:04:01,192 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:04:01,192 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:04:01,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:01,678 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:04:01,678 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:04:01,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:01,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:01,681 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:04:01,681 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:04:01,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:04:01,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:01,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:01,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:01,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:01,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:01,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:01,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:01,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:01,718 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:04:01,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:01,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:01,720 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:04:01,722 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:04:01,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:01,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:01,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:01,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:01,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:01,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:01,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:01,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:01,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:01,740 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:04:01,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:01,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:01,742 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:04:01,743 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:04:01,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:01,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:01,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:01,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:01,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:01,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:01,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:01,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:01,756 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:01,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-06 19:04:01,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:01,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:01,764 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:04:01,766 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:04:01,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:01,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:01,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:01,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:01,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:01,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:01,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:01,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:01,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:01,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-06 19:04:01,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:01,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:01,786 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:04:01,787 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:04:01,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:01,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:01,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:01,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:01,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:01,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:01,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:01,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:01,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:01,806 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:04:01,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:01,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:01,809 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:04:01,810 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:04:01,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:04:01,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:01,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:01,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:01,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:01,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:01,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:01,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:01,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:01,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-06 19:04:01,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:01,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:01,829 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:04:01,831 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:04:01,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:01,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:01,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:01,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:01,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:01,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:01,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:01,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:01,844 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:01,849 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:04:01,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:01,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:01,851 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:04:01,852 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:04:01,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:04:01,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:01,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:01,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:01,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:01,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:01,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:01,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:01,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:01,871 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:04:01,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:01,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:01,873 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:04:01,875 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:04:01,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:01,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:01,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:01,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:01,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:01,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:01,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:01,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:01,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:01,898 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:04:01,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:01,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:01,899 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:04:01,901 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:04:01,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:04:01,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:01,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:01,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:01,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:01,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:01,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:01,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:01,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:01,919 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:04:01,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:01,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:01,921 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:04:01,922 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:04:01,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:01,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:01,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:01,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:01,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:01,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:01,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:01,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:01,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:01,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:01,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:01,944 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:04:01,945 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:04:01,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:04:01,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:01,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:01,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:01,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:01,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:01,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:01,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:01,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-06 19:04:01,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:01,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:01,971 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:04:01,974 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:04:01,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:01,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:01,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:01,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:01,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:01,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:01,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:01,989 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:01,995 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:04:01,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:01,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:01,998 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:04:02,012 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:04:02,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:04:02,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:02,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:02,023 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:04:02,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:02,035 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-02-06 19:04:02,035 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:04:02,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:02,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:02,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:02,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:02,061 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:04:02,062 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:04:02,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:04:02,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:02,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:02,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:02,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:02,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:02,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:02,101 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:04:02,127 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-02-06 19:04:02,127 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-02-06 19:04:02,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:02,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:02,129 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:04:02,131 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:04:02,132 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:04:02,145 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-06 19:04:02,146 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:04:02,146 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strrchr_~l~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc15#1.base)_2) = -1*ULTIMATE.start_strrchr_~l~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc15#1.base)_2 Supporting invariants [-1*ULTIMATE.start_strrchr_~l~0#1.offset + 1*ULTIMATE.start_strrchr_~t#1.offset >= 0] [2025-02-06 19:04:02,152 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:04:02,172 INFO L156 tatePredicateManager]: 7 out of 9 supporting invariants were superfluous and have been removed [2025-02-06 19:04:02,176 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~l~0!offset [2025-02-06 19:04:02,177 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:04:02,177 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:04:02,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:02,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:04:02,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:04:02,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:02,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:02,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 19:04:02,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:04:02,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:04:02,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:04:02,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:02,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:02,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:04:02,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:04:02,446 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:04:02,447 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2025-02-06 19:04:02,448 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 11 Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:04:02,815 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 11. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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 141 states and 170 transitions. Complement of second has 17 states. [2025-02-06 19:04:02,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2025-02-06 19:04:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:04:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2025-02-06 19:04:02,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 8 letters. Loop has 13 letters. [2025-02-06 19:04:02,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:04:02,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 21 letters. Loop has 13 letters. [2025-02-06 19:04:02,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:04:02,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 68 transitions. Stem has 8 letters. Loop has 26 letters. [2025-02-06 19:04:02,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:04:02,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 170 transitions. [2025-02-06 19:04:02,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:04:02,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 141 states and 170 transitions. [2025-02-06 19:04:02,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2025-02-06 19:04:02,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2025-02-06 19:04:02,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 170 transitions. [2025-02-06 19:04:02,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:04:02,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 141 states and 170 transitions. [2025-02-06 19:04:02,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 170 transitions. [2025-02-06 19:04:02,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 54. [2025-02-06 19:04:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 53 states have internal predecessors, (73), 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:04:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2025-02-06 19:04:02,824 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-02-06 19:04:02,824 INFO L432 stractBuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-02-06 19:04:02,824 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:04:02,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 73 transitions. [2025-02-06 19:04:02,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:04:02,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:04:02,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:04:02,826 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2025-02-06 19:04:02,826 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:04:02,826 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1;" [2025-02-06 19:04:02,826 INFO L754 eck$LassoCheckResult]: Loop: "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem5#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem5#1;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem8#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem8#1;" "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem11#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem11#1;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1;" [2025-02-06 19:04:02,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:02,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1783666635, now seen corresponding path program 1 times [2025-02-06 19:04:02,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:02,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269616528] [2025-02-06 19:04:02,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:02,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:02,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:04:02,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:04:02,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:02,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:02,844 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:02,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:04:02,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:04:02,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:02,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:02,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:02,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:02,852 INFO L85 PathProgramCache]: Analyzing trace with hash -973290669, now seen corresponding path program 1 times [2025-02-06 19:04:02,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:02,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937555582] [2025-02-06 19:04:02,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:02,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:02,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:04:02,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:04:02,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:02,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:02,856 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:02,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:04:02,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:04:02,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:02,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:02,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:02,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:02,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1466260535, now seen corresponding path program 1 times [2025-02-06 19:04:02,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:02,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927932318] [2025-02-06 19:04:02,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:02,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:02,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:04:02,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:04:02,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:02,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:04:03,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:04:03,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927932318] [2025-02-06 19:04:03,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927932318] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:04:03,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739360162] [2025-02-06 19:04:03,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:04:03,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:04:03,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:03,167 INFO L229 MonitoredProcess]: Starting monitored process 28 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:04:03,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-02-06 19:04:03,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:04:03,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:04:03,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:03,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:04:03,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 19:04:03,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:04:03,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 19:04:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:04:03,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:04:03,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 19:04:03,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 19:04:03,420 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:04:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:04:03,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739360162] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:04:03,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:04:03,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-02-06 19:04:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033904978] [2025-02-06 19:04:03,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:04:03,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:04:03,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 19:04:03,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2025-02-06 19:04:03,581 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. cyclomatic complexity: 22 Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 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:04:03,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:04:03,845 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2025-02-06 19:04:03,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 104 transitions. [2025-02-06 19:04:03,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:04:03,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 41 states and 53 transitions. [2025-02-06 19:04:03,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-02-06 19:04:03,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-02-06 19:04:03,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2025-02-06 19:04:03,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:04:03,847 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-02-06 19:04:03,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2025-02-06 19:04:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-06 19:04:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 40 states have internal predecessors, (53), 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:04:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2025-02-06 19:04:03,848 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-02-06 19:04:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 19:04:03,849 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-02-06 19:04:03,849 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:04:03,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2025-02-06 19:04:03,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:04:03,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:04:03,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:04:03,850 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1] [2025-02-06 19:04:03,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:04:03,850 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume main_~i~0#1 < main_~in_len~0#1 - 1;havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1;" "assume !(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256);" "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1;" [2025-02-06 19:04:03,850 INFO L754 eck$LassoCheckResult]: Loop: "call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem5#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem5#1;" "call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem8#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem8#1;" "call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem11#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem11#1;" "call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset;" "assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1);" "assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1;" [2025-02-06 19:04:03,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash -540878343, now seen corresponding path program 2 times [2025-02-06 19:04:03,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:03,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444424540] [2025-02-06 19:04:03,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:04:03,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:03,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-06 19:04:03,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:04:03,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:04:03,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:03,858 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:03,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:04:03,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:04:03,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:03,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:03,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:03,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:03,864 INFO L85 PathProgramCache]: Analyzing trace with hash -973290669, now seen corresponding path program 2 times [2025-02-06 19:04:03,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:03,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225474167] [2025-02-06 19:04:03,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:04:03,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:03,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:04:03,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:04:03,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:04:03,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:03,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:03,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:04:03,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:04:03,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:03,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:03,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:03,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:04:03,870 INFO L85 PathProgramCache]: Analyzing trace with hash -532816805, now seen corresponding path program 2 times [2025-02-06 19:04:03,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:04:03,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376303194] [2025-02-06 19:04:03,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:04:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:04:03,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-06 19:04:03,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:04:03,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:04:03,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:03,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:04:03,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 19:04:03,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:04:03,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:04:03,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:04:03,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:04:04,652 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:04:04,652 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:04:04,652 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:04:04,652 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:04:04,652 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:04:04,652 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:04,652 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:04:04,652 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:04:04,652 INFO L132 ssoRankerPreferences]: Filename of dumped script: strrchr.i_Iteration8_Lasso [2025-02-06 19:04:04,652 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:04:04,652 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:04:04,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:04,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:04:05,026 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-02-06 19:04:23,256 WARN L286 SmtUtils]: Spent 18.16s on a formula simplification. DAG size of input: 298 DAG size of output: 226 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2025-02-06 19:04:23,328 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:04:23,328 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:04:23,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,335 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:04:23,335 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:04:23,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,360 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:04:23,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,365 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:04:23,366 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:04:23,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:04:23,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,379 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,385 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:04:23,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,388 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:04:23,389 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:04:23,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:04:23,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,407 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:04:23,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,410 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:04:23,411 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:04:23,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:04:23,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,429 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:04:23,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,432 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:04:23,433 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:04:23,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:04:23,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,450 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:04:23,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,453 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:04:23,453 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:04:23,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:04:23,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,471 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:04:23,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,475 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:04:23,475 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:04:23,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,488 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-06 19:04:23,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,495 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:04:23,496 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:04:23,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:04:23,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-02-06 19:04:23,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,516 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:04:23,517 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:04:23,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:23,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,539 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:04:23,541 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:04:23,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,555 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,560 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:04:23,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,563 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:04:23,564 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:04:23,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,582 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:04:23,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,584 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:04:23,585 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:04:23,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,598 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:23,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,606 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:04:23,607 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:04:23,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:04:23,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:23,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,627 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:04:23,628 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:04:23,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,641 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-06 19:04:23,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,649 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:04:23,650 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:04:23,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:04:23,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,665 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,671 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:04:23,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,674 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:04:23,676 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:04:23,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,688 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,694 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:04:23,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,697 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:04:23,698 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:04:23,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,716 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:04:23,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,718 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:04:23,719 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:04:23,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,732 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,738 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:04:23,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,740 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:04:23,742 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:04:23,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:23,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,763 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:04:23,764 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:04:23,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,781 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:04:23,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,783 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:04:23,784 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:04:23,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,797 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,802 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:04:23,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,805 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:04:23,806 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:04:23,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-02-06 19:04:23,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,827 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:04:23,829 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:04:23,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,846 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:04:23,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,848 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:04:23,849 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:04:23,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:04:23,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:04:23,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:04:23,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-02-06 19:04:23,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,877 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:04:23,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-02-06 19:04:23,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:04:23,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:04:23,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:04:23,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:04:23,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:04:23,895 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:04:23,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-02-06 19:04:23,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:04:23,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:04:23,909 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:04:23,910 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:04:23,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:04:23,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:04:23,923 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:04:23,923 INFO L204 nArgumentSynthesizer]: 184 loop disjuncts [2025-02-06 19:04:23,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.