./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 48c9605d 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-?-48c9605-m [2025-02-08 14:23:17,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:23:17,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-08 14:23:17,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:23:17,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:23:17,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:23:17,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:23:17,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:23:17,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:23:17,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:23:17,708 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:23:17,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:23:17,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:23:17,708 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:23:17,709 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:23:17,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:23:17,709 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:23:17,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:23:17,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:23:17,710 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:23:17,710 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:23:17,710 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-08 14:23:17,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:23:17,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:23:17,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:23:17,941 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:23:17,941 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:23:17,942 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-08 14:23:19,067 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cff505878/f0bd7640796343fb990b8f215ca07067/FLAG8a2925a59 [2025-02-08 14:23:19,419 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:23:19,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strrchr.i [2025-02-08 14:23:19,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cff505878/f0bd7640796343fb990b8f215ca07067/FLAG8a2925a59 [2025-02-08 14:23:19,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cff505878/f0bd7640796343fb990b8f215ca07067 [2025-02-08 14:23:19,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:23:19,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:23:19,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:23:19,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:23:19,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:23:19,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:23:19" (1/1) ... [2025-02-08 14:23:19,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537c6340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:19, skipping insertion in model container [2025-02-08 14:23:19,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:23:19" (1/1) ... [2025-02-08 14:23:19,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:23:19,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:23:19,878 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:23:19,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:23:19,935 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:23:19,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:19 WrapperNode [2025-02-08 14:23:19,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:23:19,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:23:19,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:23:19,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:23:19,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:19" (1/1) ... [2025-02-08 14:23:19,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:19" (1/1) ... [2025-02-08 14:23:19,966 INFO L138 Inliner]: procedures = 114, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2025-02-08 14:23:19,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:23:19,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:23:19,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:23:19,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:23:19,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:19" (1/1) ... [2025-02-08 14:23:19,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:19" (1/1) ... [2025-02-08 14:23:19,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:19" (1/1) ... [2025-02-08 14:23:19,990 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-08 14:23:19,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:19" (1/1) ... [2025-02-08 14:23:19,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:19" (1/1) ... [2025-02-08 14:23:19,996 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:19" (1/1) ... [2025-02-08 14:23:19,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:19" (1/1) ... [2025-02-08 14:23:19,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:19" (1/1) ... [2025-02-08 14:23:20,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:19" (1/1) ... [2025-02-08 14:23:20,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:23:20,002 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:23:20,002 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:23:20,002 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:23:20,003 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:19" (1/1) ... [2025-02-08 14:23:20,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:20,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:20,041 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-08 14:23:20,047 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-08 14:23:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:23:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:23:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:23:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:23:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:23:20,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:23:20,119 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:23:20,120 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:23:20,281 INFO L1324 $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-08 14:23:20,294 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-02-08 14:23:20,295 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:23:20,301 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:23:20,301 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:23:20,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:23:20 BoogieIcfgContainer [2025-02-08 14:23:20,301 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:23:20,302 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:23:20,302 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:23:20,305 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:23:20,306 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:23:20,306 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:23:19" (1/3) ... [2025-02-08 14:23:20,307 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ac7ba75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:23:20, skipping insertion in model container [2025-02-08 14:23:20,307 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:23:20,307 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:19" (2/3) ... [2025-02-08 14:23:20,307 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ac7ba75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:23:20, skipping insertion in model container [2025-02-08 14:23:20,307 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:23:20,307 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:23:20" (3/3) ... [2025-02-08 14:23:20,308 INFO L363 chiAutomizerObserver]: Analyzing ICFG strrchr.i [2025-02-08 14:23:20,351 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:23:20,351 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:23:20,351 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:23:20,351 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:23:20,351 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:23:20,351 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:23:20,351 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:23:20,352 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:23:20,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:20,366 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-02-08 14:23:20,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:23:20,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:23:20,370 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:23:20,370 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:23:20,371 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:23:20,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:20,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2025-02-08 14:23:20,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:23:20,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:23:20,373 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:23:20,373 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:23:20,376 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-08 14:23:20,377 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-08 14:23:20,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:20,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2368, now seen corresponding path program 1 times [2025-02-08 14:23:20,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:20,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20661828] [2025-02-08 14:23:20,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:20,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:20,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:23:20,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:23:20,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:20,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:20,450 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:20,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:23:20,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:23:20,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:20,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:20,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:20,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:20,467 INFO L85 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times [2025-02-08 14:23:20,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:20,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829671694] [2025-02-08 14:23:20,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:20,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:20,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:23:20,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:23:20,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:20,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:20,474 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:20,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:23:20,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:23:20,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:20,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:20,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:20,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:20,479 INFO L85 PathProgramCache]: Analyzing trace with hash 73446, now seen corresponding path program 1 times [2025-02-08 14:23:20,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:20,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804036320] [2025-02-08 14:23:20,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:20,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:20,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:20,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:20,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:20,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:20,496 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:20,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:20,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:20,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:20,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:20,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:20,715 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:23:20,716 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:23:20,716 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:23:20,716 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:23:20,716 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:23:20,716 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:20,716 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:23:20,716 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:23:20,717 INFO L132 ssoRankerPreferences]: Filename of dumped script: strrchr.i_Iteration1_Lasso [2025-02-08 14:23:20,717 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:23:20,717 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:23:20,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:20,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:20,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:20,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:20,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:20,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:20,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:20,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:20,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:20,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:20,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:21,012 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:23:21,015 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:23:21,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:21,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:21,021 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-08 14:23:21,027 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-08 14:23:21,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:21,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:21,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:21,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:21,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:21,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:21,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:21,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:21,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:21,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-08 14:23:21,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:21,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:21,058 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-08 14:23:21,059 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-08 14:23:21,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:21,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:21,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:21,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:21,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:21,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:21,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:21,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:21,078 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:21,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-08 14:23:21,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:21,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:21,095 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-08 14:23:21,099 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-08 14:23:21,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:21,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:21,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:21,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:21,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:21,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:21,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:21,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:21,114 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:21,120 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-08 14:23:21,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:21,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:21,124 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-08 14:23:21,125 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-08 14:23:21,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:21,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:21,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:21,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:21,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:21,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:21,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:21,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:21,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:21,152 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-08 14:23:21,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:21,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:21,157 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-08 14:23:21,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:21,178 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-08 14:23:21,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:21,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:21,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:21,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:21,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:21,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:21,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:21,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:21,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-08 14:23:21,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:21,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:21,204 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-08 14:23:21,208 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-08 14:23:21,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:21,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:21,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:21,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:21,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:21,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:21,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:21,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:21,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:21,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:21,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:21,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:21,236 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-08 14:23:21,237 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-08 14:23:21,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:21,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:21,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:21,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:21,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:21,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:21,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:21,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:21,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:21,258 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-08 14:23:21,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:21,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:21,261 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:21,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-08 14:23:21,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:21,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:21,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:21,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:21,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:21,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:21,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:21,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:21,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:21,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:21,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:21,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:21,283 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:21,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-08 14:23:21,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:21,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:21,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:21,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:21,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:21,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:21,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:21,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:21,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:21,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:21,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:21,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:21,307 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:21,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-08 14:23:21,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:21,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:21,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:21,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:21,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:21,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:23:21,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:23:21,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:21,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-08 14:23:21,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:21,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:21,332 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-08 14:23:21,334 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-08 14:23:21,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:21,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:21,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:21,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:21,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:21,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:21,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:21,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:21,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:21,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-08 14:23:21,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:21,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:21,355 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-08 14:23:21,355 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-08 14:23:21,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:21,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:21,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:21,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:21,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:21,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:23:21,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:23:21,372 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:21,378 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-08 14:23:21,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:21,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:21,380 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-08 14:23:21,383 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-08 14:23:21,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:21,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:21,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:21,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:21,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:21,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:23:21,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:23:21,419 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:23:21,449 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-08 14:23:21,450 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-02-08 14:23:21,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:21,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:21,454 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-08 14:23:21,456 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-08 14:23:21,457 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:23:21,473 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:23:21,474 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:23:21,474 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-08 14:23:21,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:21,488 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-02-08 14:23:21,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:21,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:23:21,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:23:21,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:21,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:21,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:23:21,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:21,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:23:21,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:23:21,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:21,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:21,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:23:21,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:21,535 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-08 14:23:21,556 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-08 14:23:21,559 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:21,588 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 35 transitions. Complement of second has 3 states. [2025-02-08 14:23:21,591 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-08 14:23:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2025-02-08 14:23:21,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 2 letters. Loop has 1 letters. [2025-02-08 14:23:21,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:21,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 3 letters. Loop has 1 letters. [2025-02-08 14:23:21,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:21,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-08 14:23:21,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:21,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2025-02-08 14:23:21,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-08 14:23:21,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 24 transitions. [2025-02-08 14:23:21,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-08 14:23:21,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-08 14:23:21,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2025-02-08 14:23:21,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:23:21,609 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-02-08 14:23:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2025-02-08 14:23:21,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-02-08 14:23:21,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 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-08 14:23:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2025-02-08 14:23:21,624 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-02-08 14:23:21,624 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-02-08 14:23:21,624 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:23:21,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2025-02-08 14:23:21,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-08 14:23:21,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:23:21,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:23:21,628 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:23:21,628 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:23:21,628 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-08 14:23:21,628 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-08 14:23:21,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:21,629 INFO L85 PathProgramCache]: Analyzing trace with hash 73445, now seen corresponding path program 1 times [2025-02-08 14:23:21,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:21,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366457474] [2025-02-08 14:23:21,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:21,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:21,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:21,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:21,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:21,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:21,653 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:21,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:21,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:21,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:21,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:21,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:21,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:21,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1975535219, now seen corresponding path program 1 times [2025-02-08 14:23:21,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:21,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644673928] [2025-02-08 14:23:21,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:21,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:21,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:21,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:21,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:21,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:21,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:21,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:21,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:21,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:21,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:21,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:21,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:21,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1720154639, now seen corresponding path program 1 times [2025-02-08 14:23:21,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:21,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170988654] [2025-02-08 14:23:21,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:21,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:21,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:23:21,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:23:21,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:21,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:22,084 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-08 14:23:22,131 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-08 14:23:22,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:23:22,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170988654] [2025-02-08 14:23:22,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170988654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:23:22,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:23:22,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 14:23:22,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668925237] [2025-02-08 14:23:22,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:23:22,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:23:22,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:23:22,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:23:22,392 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:23:22,441 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2025-02-08 14:23:22,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2025-02-08 14:23:22,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-08 14:23:22,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 22 transitions. [2025-02-08 14:23:22,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-08 14:23:22,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-02-08 14:23:22,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2025-02-08 14:23:22,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:23:22,442 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-02-08 14:23:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2025-02-08 14:23:22,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-02-08 14:23:22,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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-08 14:23:22,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-02-08 14:23:22,443 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-02-08 14:23:22,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:23:22,444 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-02-08 14:23:22,444 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:23:22,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2025-02-08 14:23:22,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-08 14:23:22,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:23:22,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:23:22,445 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:23:22,445 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:23:22,445 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-08 14:23:22,445 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-08 14:23:22,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2276863, now seen corresponding path program 1 times [2025-02-08 14:23:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:22,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261045000] [2025-02-08 14:23:22,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:22,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:22,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:23:22,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:23:22,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:22,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:22,459 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:22,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:23:22,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:23:22,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:22,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:22,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:22,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:22,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1975535219, now seen corresponding path program 2 times [2025-02-08 14:23:22,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:22,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352202260] [2025-02-08 14:23:22,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:23:22,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:22,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:22,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:22,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:23:22,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:22,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:22,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:22,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:22,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:22,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:22,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:22,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:22,496 INFO L85 PathProgramCache]: Analyzing trace with hash 348566837, now seen corresponding path program 1 times [2025-02-08 14:23:22,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:22,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616673905] [2025-02-08 14:23:22,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:22,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:22,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:23:22,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:23:22,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:22,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:22,793 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-08 14:23:22,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:23:22,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616673905] [2025-02-08 14:23:22,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616673905] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:23:22,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754322481] [2025-02-08 14:23:22,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:22,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:23:22,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:22,799 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:23:22,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 14:23:22,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:23:22,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:23:22,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:22,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:22,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-08 14:23:22,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:22,891 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-08 14:23:22,985 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-08 14:23:22,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:23:23,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:23:23,239 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-08 14:23:23,265 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-08 14:23:23,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:23:23,309 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-08 14:23:23,430 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-08 14:23:23,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754322481] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:23:23,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:23:23,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 11] total 23 [2025-02-08 14:23:23,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352326819] [2025-02-08 14:23:23,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:23:23,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:23:23,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 14:23:23,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-02-08 14:23:23,627 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 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-08 14:23:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:23:23,954 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2025-02-08 14:23:23,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2025-02-08 14:23:23,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-08 14:23:23,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 23 transitions. [2025-02-08 14:23:23,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-08 14:23:23,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-02-08 14:23:23,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2025-02-08 14:23:23,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:23:23,956 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-02-08 14:23:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2025-02-08 14:23:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-08 14:23:23,957 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-08 14:23:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2025-02-08 14:23:23,957 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-02-08 14:23:23,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:23:23,958 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-02-08 14:23:23,958 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:23:23,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2025-02-08 14:23:23,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-08 14:23:23,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:23:23,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:23:23,958 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2025-02-08 14:23:23,959 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:23:23,959 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-08 14:23:23,959 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-08 14:23:23,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:23,959 INFO L85 PathProgramCache]: Analyzing trace with hash 70582821, now seen corresponding path program 2 times [2025-02-08 14:23:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:23,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233317480] [2025-02-08 14:23:23,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:23:23,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:23,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 2 equivalence classes. [2025-02-08 14:23:23,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:23:23,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:23:23,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:23,969 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:23,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:23:23,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:23:23,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:23,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:23,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:23,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:23,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1975535219, now seen corresponding path program 3 times [2025-02-08 14:23:23,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:23,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29510870] [2025-02-08 14:23:23,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:23:23,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:23,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:23,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:23,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:23:23,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:23,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:24,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:24,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:24,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:24,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:24,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:24,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:24,010 INFO L85 PathProgramCache]: Analyzing trace with hash 779017935, now seen corresponding path program 2 times [2025-02-08 14:23:24,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:24,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342259257] [2025-02-08 14:23:24,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:23:24,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:24,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 14:23:24,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:23:24,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:23:24,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:24,284 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-08 14:23:24,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:23:24,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342259257] [2025-02-08 14:23:24,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342259257] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:23:24,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252216258] [2025-02-08 14:23:24,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:23:24,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:23:24,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:24,288 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:23:24,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 14:23:24,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 14:23:24,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:23:24,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:23:24,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:24,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-08 14:23:24,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:24,392 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-08 14:23:24,567 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-08 14:23:24,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:23:24,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:23:24,851 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-08 14:23:24,882 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-08 14:23:24,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:23:24,887 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-08 14:23:24,968 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-08 14:23:24,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252216258] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:23:24,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:23:24,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 13] total 28 [2025-02-08 14:23:24,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659555435] [2025-02-08 14:23:24,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:23:25,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:23:25,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 14:23:25,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2025-02-08 14:23:25,150 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 7 Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:25,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:23:25,594 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2025-02-08 14:23:25,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2025-02-08 14:23:25,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-08 14:23:25,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 19 states and 24 transitions. [2025-02-08 14:23:25,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-08 14:23:25,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-02-08 14:23:25,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2025-02-08 14:23:25,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:23:25,595 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-02-08 14:23:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2025-02-08 14:23:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-08 14:23:25,596 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-08 14:23:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-02-08 14:23:25,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-02-08 14:23:25,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 14:23:25,597 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-02-08 14:23:25,597 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:23:25,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2025-02-08 14:23:25,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-08 14:23:25,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:23:25,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:23:25,598 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2025-02-08 14:23:25,598 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:23:25,598 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-08 14:23:25,598 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-08 14:23:25,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:25,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2106899777, now seen corresponding path program 3 times [2025-02-08 14:23:25,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:25,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833935451] [2025-02-08 14:23:25,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:23:25,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:25,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 6 statements into 3 equivalence classes. [2025-02-08 14:23:25,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:23:25,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 14:23:25,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:25,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:25,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:23:25,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:23:25,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:25,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:25,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:25,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:25,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1975535219, now seen corresponding path program 4 times [2025-02-08 14:23:25,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:25,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232123244] [2025-02-08 14:23:25,615 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:23:25,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:25,617 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13 statements into 2 equivalence classes. [2025-02-08 14:23:25,619 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:25,619 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:23:25,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:25,620 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:25,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:25,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:25,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:25,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:25,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:25,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:25,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1238100085, now seen corresponding path program 3 times [2025-02-08 14:23:25,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:25,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766583285] [2025-02-08 14:23:25,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:23:25,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:25,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-02-08 14:23:25,640 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:23:25,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 14:23:25,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:26,044 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-08 14:23:26,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:23:26,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766583285] [2025-02-08 14:23:26,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766583285] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:23:26,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176867935] [2025-02-08 14:23:26,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:23:26,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:23:26,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:26,047 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:23:26,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 14:23:26,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-02-08 14:23:26,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:23:26,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 14:23:26,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:26,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-08 14:23:26,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:26,158 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-08 14:23:26,336 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-08 14:23:26,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:23:26,457 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-08 14:23:26,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:23:26,462 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-08 14:23:26,545 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-08 14:23:26,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176867935] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:23:26,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:23:26,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2025-02-08 14:23:26,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89210453] [2025-02-08 14:23:26,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:23:26,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:23:26,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 14:23:26,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2025-02-08 14:23:26,726 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand has 32 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 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-08 14:23:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:23:26,999 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2025-02-08 14:23:26,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2025-02-08 14:23:27,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-08 14:23:27,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 44 transitions. [2025-02-08 14:23:27,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-02-08 14:23:27,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-02-08 14:23:27,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2025-02-08 14:23:27,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:23:27,000 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-02-08 14:23:27,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2025-02-08 14:23:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2025-02-08 14:23:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2025-02-08 14:23:27,002 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 40 transitions. [2025-02-08 14:23:27,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 14:23:27,002 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2025-02-08 14:23:27,002 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:23:27,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2025-02-08 14:23:27,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-08 14:23:27,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:23:27,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:23:27,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1] [2025-02-08 14:23:27,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:23:27,003 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-08 14:23:27,003 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-08 14:23:27,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:27,003 INFO L85 PathProgramCache]: Analyzing trace with hash -889383579, now seen corresponding path program 4 times [2025-02-08 14:23:27,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:27,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874642380] [2025-02-08 14:23:27,004 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:23:27,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:27,008 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes. [2025-02-08 14:23:27,011 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:23:27,011 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:23:27,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:27,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:27,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:23:27,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:23:27,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:27,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:27,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:27,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:27,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1975535219, now seen corresponding path program 5 times [2025-02-08 14:23:27,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:27,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859910493] [2025-02-08 14:23:27,017 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:23:27,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:27,020 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:27,022 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:27,022 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:23:27,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:27,022 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:27,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:27,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:27,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:27,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:27,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:27,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1710222449, now seen corresponding path program 4 times [2025-02-08 14:23:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:27,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679652360] [2025-02-08 14:23:27,030 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:23:27,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:27,035 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-02-08 14:23:27,048 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:23:27,048 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:23:27,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:27,048 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:27,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:23:27,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:23:27,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:27,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:27,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:27,774 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:23:27,775 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:23:27,775 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:23:27,775 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:23:27,775 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:23:27,775 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:27,775 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:23:27,775 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:23:27,775 INFO L132 ssoRankerPreferences]: Filename of dumped script: strrchr.i_Iteration6_Lasso [2025-02-08 14:23:27,775 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:23:27,775 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:23:27,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:27,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:28,308 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:23:28,309 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:23:28,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,313 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-08 14:23:28,314 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-08 14:23:28,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:28,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:28,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:28,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,334 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-08 14:23:28,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,336 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-08 14:23:28,337 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-08 14:23:28,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:28,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:28,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:28,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,360 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-08 14:23:28,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,362 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-08 14:23:28,363 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-08 14:23:28,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:28,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:28,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:28,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,383 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-08 14:23:28,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,385 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-08 14:23:28,386 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-08 14:23:28,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:28,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:28,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:28,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-08 14:23:28,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,411 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-08 14:23:28,413 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-08 14:23:28,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:28,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:28,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:28,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,431 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-08 14:23:28,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,433 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-08 14:23:28,434 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-08 14:23:28,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:28,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:28,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:28,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,454 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-08 14:23:28,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,456 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-08 14:23:28,458 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-08 14:23:28,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:28,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:28,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:28,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,478 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-08 14:23:28,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,481 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-08 14:23:28,482 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-08 14:23:28,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:28,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:28,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:28,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,502 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-08 14:23:28,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,504 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-08 14:23:28,506 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-08 14:23:28,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:28,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:28,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:28,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:28,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,528 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:28,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-08 14:23:28,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:28,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:28,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:28,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:28,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,551 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-08 14:23:28,552 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-08 14:23:28,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:28,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:28,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:28,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:28,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,573 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-08 14:23:28,577 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-08 14:23:28,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:28,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:28,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:28,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:28,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,601 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-08 14:23:28,601 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-08 14:23:28,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:28,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:28,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:28,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-02-08 14:23:28,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,624 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-08 14:23:28,625 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-08 14:23:28,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:28,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:28,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:28,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-02-08 14:23:28,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,645 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-08 14:23:28,647 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-08 14:23:28,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:28,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:28,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:28,665 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,674 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-08 14:23:28,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,677 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-08 14:23:28,677 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-08 14:23:28,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:23:28,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:23:28,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:28,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,702 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-08 14:23:28,703 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-08 14:23:28,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:23:28,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:23:28,722 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:28,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,730 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-08 14:23:28,731 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-08 14:23:28,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,743 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-08 14:23:28,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,755 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-02-08 14:23:28,755 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-08 14:23:28,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:28,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,782 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-08 14:23:28,784 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-08 14:23:28,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-08 14:23:28,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:23:28,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:23:28,800 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:28,805 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-08 14:23:28,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,808 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-08 14:23:28,809 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-08 14:23:28,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:28,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:28,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:28,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:28,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:28,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:23:28,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:23:28,829 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:23:28,843 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-08 14:23:28,844 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-02-08 14:23:28,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:28,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:28,846 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-08 14:23:28,847 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-08 14:23:28,848 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:23:28,858 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:23:28,858 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:23:28,858 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strrchr_~t#1.base)_1, ULTIMATE.start_strrchr_~t#1.offset) = 1*v_rep(select #length ULTIMATE.start_strrchr_~t#1.base)_1 - 1*ULTIMATE.start_strrchr_~t#1.offset Supporting invariants [] [2025-02-08 14:23:28,865 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-08 14:23:28,873 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2025-02-08 14:23:28,875 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:23:28,875 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:23:28,875 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~t!offset [2025-02-08 14:23:28,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:28,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:23:28,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:23:28,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:28,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:28,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:23:28,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:28,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:28,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:28,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:28,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:28,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 14:23:28,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:28,987 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-08 14:23:28,992 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-02-08 14:23:28,992 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 11 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-08 14:23:29,044 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 11. 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) Result 48 states and 66 transitions. Complement of second has 6 states. [2025-02-08 14:23:29,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:23:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. 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-08 14:23:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-02-08 14:23:29,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 7 letters. Loop has 13 letters. [2025-02-08 14:23:29,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:29,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 13 letters. [2025-02-08 14:23:29,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:29,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 7 letters. Loop has 26 letters. [2025-02-08 14:23:29,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:29,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 66 transitions. [2025-02-08 14:23:29,046 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:23:29,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2025-02-08 14:23:29,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:23:29,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:23:29,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:23:29,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:23:29,047 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:23:29,047 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:23:29,047 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:23:29,047 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:23:29,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:23:29,047 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:23:29,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:23:29,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:23:29 BoogieIcfgContainer [2025-02-08 14:23:29,063 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:23:29,064 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:23:29,064 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:23:29,064 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:23:29,065 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:23:20" (3/4) ... [2025-02-08 14:23:29,066 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:23:29,067 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:23:29,067 INFO L158 Benchmark]: Toolchain (without parser) took 9422.29ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 131.1MB in the beginning and 76.7MB in the end (delta: 54.4MB). Peak memory consumption was 127.8MB. Max. memory is 16.1GB. [2025-02-08 14:23:29,072 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:23:29,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.12ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 114.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:23:29,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.05ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 112.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:23:29,072 INFO L158 Benchmark]: Boogie Preprocessor took 34.26ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:23:29,072 INFO L158 Benchmark]: IcfgBuilder took 299.48ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 96.2MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:23:29,072 INFO L158 Benchmark]: BuchiAutomizer took 8761.48ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 96.2MB in the beginning and 76.7MB in the end (delta: 19.6MB). Peak memory consumption was 94.2MB. Max. memory is 16.1GB. [2025-02-08 14:23:29,073 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 243.3MB. Free memory was 76.7MB in the beginning and 76.7MB in the end (delta: 25.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:23:29,074 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.12ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 114.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.05ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 112.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.26ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 299.48ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 96.2MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 8761.48ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 96.2MB in the beginning and 76.7MB in the end (delta: 19.6MB). Peak memory consumption was 94.2MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 243.3MB. Free memory was 76.7MB in the beginning and 76.7MB in the end (delta: 25.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~t!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long) -1 * i) + in_len) and consists of 2 locations. One deterministic module has affine ranking function null and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.7s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 7.2s. Construction of modules took 0.5s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 194 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1157 IncrementalHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 50 mSDtfsCounter, 1157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital131 mio100 ax100 hnf100 lsp104 ukn60 mio100 lsp49 div150 bol100 ite100 ukn100 eq170 hnf91 smp83 dnf127 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 44ms VariablesStem: 5 VariablesLoop: 9 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-08 14:23:29,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-02-08 14:23:29,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-08 14:23:29,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:29,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:29,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE