./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/strcspn.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-dietlibc/strcspn.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 3537cd0bed922b783c5bc2cf1d153661eb68e22062217013fbb7937014c3d604 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:52:08,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:52:08,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:52:08,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:52:08,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:52:08,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:52:08,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:52:08,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:52:08,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:52:08,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:52:08,289 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:52:08,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:52:08,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:52:08,289 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:52:08,289 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:52:08,289 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:52:08,289 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:52:08,289 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:52:08,289 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:52:08,289 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:52:08,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:52:08,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:52:08,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:52:08,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:52:08,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:52:08,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:52:08,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:52:08,290 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:52:08,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:52:08,290 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:52:08,290 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:52:08,290 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:52:08,290 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:52:08,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:52:08,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:52:08,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:52:08,290 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:52:08,291 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/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 -> 3537cd0bed922b783c5bc2cf1d153661eb68e22062217013fbb7937014c3d604 [2025-03-09 06:52:08,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:52:08,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:52:08,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:52:08,528 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:52:08,528 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:52:08,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strcspn.i [2025-03-09 06:52:09,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e2e74f14/c33b53eab9344b4d80b0c050411da320/FLAG3ce931314 [2025-03-09 06:52:09,896 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:52:09,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strcspn.i [2025-03-09 06:52:09,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e2e74f14/c33b53eab9344b4d80b0c050411da320/FLAG3ce931314 [2025-03-09 06:52:09,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e2e74f14/c33b53eab9344b4d80b0c050411da320 [2025-03-09 06:52:09,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:52:09,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:52:09,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:52:09,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:52:09,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:52:09,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:52:09" (1/1) ... [2025-03-09 06:52:09,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4763f90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:09, skipping insertion in model container [2025-03-09 06:52:09,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:52:09" (1/1) ... [2025-03-09 06:52:09,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:52:10,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:52:10,178 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:52:10,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:52:10,237 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:52:10,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:10 WrapperNode [2025-03-09 06:52:10,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:52:10,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:52:10,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:52:10,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:52:10,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:10" (1/1) ... [2025-03-09 06:52:10,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:10" (1/1) ... [2025-03-09 06:52:10,268 INFO L138 Inliner]: procedures = 113, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2025-03-09 06:52:10,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:52:10,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:52:10,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:52:10,270 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:52:10,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:10" (1/1) ... [2025-03-09 06:52:10,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:10" (1/1) ... [2025-03-09 06:52:10,277 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:10" (1/1) ... [2025-03-09 06:52:10,290 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-03-09 06:52:10,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:10" (1/1) ... [2025-03-09 06:52:10,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:10" (1/1) ... [2025-03-09 06:52:10,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:10" (1/1) ... [2025-03-09 06:52:10,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:10" (1/1) ... [2025-03-09 06:52:10,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:10" (1/1) ... [2025-03-09 06:52:10,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:10" (1/1) ... [2025-03-09 06:52:10,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:52:10,304 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:52:10,304 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:52:10,304 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:52:10,305 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:10" (1/1) ... [2025-03-09 06:52:10,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:10,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:10,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:10,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 06:52:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:52:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:52:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:52:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:52:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:52:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:52:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:52:10,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:52:10,410 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:52:10,412 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:52:10,526 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L526: havoc main_#t~ret13#1;call ULTIMATE.dealloc(main_#t~malloc10#1.base, main_#t~malloc10#1.offset);havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset; [2025-03-09 06:52:10,532 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-09 06:52:10,533 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:52:10,538 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:52:10,538 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:52:10,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:52:10 BoogieIcfgContainer [2025-03-09 06:52:10,538 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:52:10,539 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:52:10,539 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:52:10,543 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:52:10,544 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:52:10,544 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:52:09" (1/3) ... [2025-03-09 06:52:10,545 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23a8a898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:52:10, skipping insertion in model container [2025-03-09 06:52:10,545 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:52:10,545 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:52:10" (2/3) ... [2025-03-09 06:52:10,545 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23a8a898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:52:10, skipping insertion in model container [2025-03-09 06:52:10,545 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:52:10,546 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:52:10" (3/3) ... [2025-03-09 06:52:10,547 INFO L363 chiAutomizerObserver]: Analyzing ICFG strcspn.i [2025-03-09 06:52:10,580 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:52:10,580 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:52:10,580 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:52:10,581 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:52:10,581 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:52:10,581 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:52:10,582 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:52:10,582 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:52:10,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:10,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-09 06:52:10,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:10,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:10,599 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:52:10,599 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 06:52:10,599 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:52:10,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:10,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-09 06:52:10,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:10,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:10,601 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:52:10,601 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 06:52:10,605 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~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;havoc main_#t~nondet9#1;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int#1(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet11#1;main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#0(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem2#1, strcspn_#t~mem3#1, strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre6#1, strcspn_#t~pre7#1, strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1;" [2025-03-09 06:52:10,605 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strcspn_#t~mem2#1 := read~int#1(strcspn_~s#1.base, strcspn_~s#1.offset, 1);" "assume 0 != strcspn_#t~mem2#1;havoc strcspn_#t~mem2#1;strcspn_~i~0#1 := 0;" "assume !true;" "strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1;strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset;" [2025-03-09 06:52:10,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:10,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1999931, now seen corresponding path program 1 times [2025-03-09 06:52:10,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:10,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797031587] [2025-03-09 06:52:10,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:10,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:10,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:52:10,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:52:10,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:10,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:10,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:10,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:52:10,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:52:10,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:10,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:10,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:10,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:10,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1599637, now seen corresponding path program 1 times [2025-03-09 06:52:10,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:10,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106427395] [2025-03-09 06:52:10,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:10,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:10,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:52:10,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:52:10,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:10,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:52:10,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:52:10,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106427395] [2025-03-09 06:52:10,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106427395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:52:10,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:52:10,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:52:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389829845] [2025-03-09 06:52:10,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:52:10,793 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:52:10,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:52:10,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 06:52:10,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:52:10,810 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:10,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:52:10,814 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2025-03-09 06:52:10,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2025-03-09 06:52:10,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-09 06:52:10,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 11 transitions. [2025-03-09 06:52:10,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:52:10,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:52:10,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2025-03-09 06:52:10,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:52:10,820 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-09 06:52:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2025-03-09 06:52:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-09 06:52:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-03-09 06:52:10,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-09 06:52:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:52:10,842 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-03-09 06:52:10,843 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:52:10,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2025-03-09 06:52:10,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-09 06:52:10,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:10,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:10,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:52:10,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:52:10,844 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~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;havoc main_#t~nondet9#1;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int#1(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet11#1;main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#0(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem2#1, strcspn_#t~mem3#1, strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre6#1, strcspn_#t~pre7#1, strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1;" [2025-03-09 06:52:10,844 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strcspn_#t~mem2#1 := read~int#1(strcspn_~s#1.base, strcspn_~s#1.offset, 1);" "assume 0 != strcspn_#t~mem2#1;havoc strcspn_#t~mem2#1;strcspn_~i~0#1 := 0;" "assume true;call strcspn_#t~mem3#1 := read~int#0(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(0 != strcspn_#t~mem3#1);havoc strcspn_#t~mem3#1;" "strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1;strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset;" [2025-03-09 06:52:10,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:10,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1999931, now seen corresponding path program 2 times [2025-03-09 06:52:10,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:10,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122479978] [2025-03-09 06:52:10,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:52:10,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:10,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:52:10,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:52:10,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:52:10,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:10,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:10,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:52:10,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:52:10,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:10,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:10,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:10,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash 49588040, now seen corresponding path program 1 times [2025-03-09 06:52:10,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:10,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331581513] [2025-03-09 06:52:10,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:10,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:10,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:52:10,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:52:10,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:10,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:10,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:10,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:52:10,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:52:10,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:10,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:10,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:10,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:10,912 INFO L85 PathProgramCache]: Analyzing trace with hash 138524494, now seen corresponding path program 1 times [2025-03-09 06:52:10,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:10,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208533030] [2025-03-09 06:52:10,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:10,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:10,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:52:10,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:52:10,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:10,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:10,949 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:10,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:52:10,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:52:10,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:10,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:10,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:11,694 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:52:11,694 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:52:11,695 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:52:11,695 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:52:11,695 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:52:11,695 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:11,695 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:52:11,695 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:52:11,695 INFO L132 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration2_Lasso [2025-03-09 06:52:11,695 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:52:11,695 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:52:11,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:11,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:12,237 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:52:12,239 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:52:12,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:12,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:12,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:12,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 06:52:12,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:12,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:12,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:12,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:12,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:12,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:12,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:12,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:12,266 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:12,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:12,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:12,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:12,274 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:12,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 06:52:12,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:12,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:12,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:12,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:12,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:12,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:12,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:12,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:12,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:12,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:12,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:12,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:12,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:12,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 06:52:12,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:12,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:12,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:12,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:12,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:12,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:12,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:12,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:12,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:12,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-09 06:52:12,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:12,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:12,322 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:12,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 06:52:12,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:12,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:12,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:12,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:12,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:12,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:12,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:12,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:12,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:12,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:12,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:12,354 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:12,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 06:52:12,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:12,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:12,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:12,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:12,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:12,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:12,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:12,381 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:52:12,412 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-09 06:52:12,413 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-09 06:52:12,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:12,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:12,417 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:12,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 06:52:12,420 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:52:12,432 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:52:12,432 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:52:12,432 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10#1.base)_1, ULTIMATE.start_strcspn_~s#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10#1.base)_1 - 1*ULTIMATE.start_strcspn_~s#1.offset Supporting invariants [] [2025-03-09 06:52:12,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:12,469 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 06:52:12,473 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 06:52:12,474 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 06:52:12,476 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2025-03-09 06:52:12,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:12,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:52:12,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:52:12,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:12,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:12,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:52:12,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:12,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:52:12,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:52:12,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:12,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:12,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:52:12,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:52:12,604 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-09 06:52:12,606 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-03-09 06:52:12,660 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 16 states and 19 transitions. Complement of second has 5 states. [2025-03-09 06:52:12,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:52:12,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-03-09 06:52:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-03-09 06:52:12,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 5 letters. [2025-03-09 06:52:12,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:12,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 9 letters. Loop has 5 letters. [2025-03-09 06:52:12,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:12,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 10 letters. [2025-03-09 06:52:12,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:12,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2025-03-09 06:52:12,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:52:12,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 18 transitions. [2025-03-09 06:52:12,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:52:12,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:52:12,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2025-03-09 06:52:12,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:52:12,671 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-03-09 06:52:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2025-03-09 06:52:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-09 06:52:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2025-03-09 06:52:12,672 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-03-09 06:52:12,672 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-03-09 06:52:12,672 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:52:12,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2025-03-09 06:52:12,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:52:12,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:12,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:12,674 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:52:12,674 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:52:12,674 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~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;havoc main_#t~nondet9#1;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int#1(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet11#1;main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#0(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem2#1, strcspn_#t~mem3#1, strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre6#1, strcspn_#t~pre7#1, strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1;" "assume true;call strcspn_#t~mem2#1 := read~int#1(strcspn_~s#1.base, strcspn_~s#1.offset, 1);" "assume 0 != strcspn_#t~mem2#1;havoc strcspn_#t~mem2#1;strcspn_~i~0#1 := 0;" [2025-03-09 06:52:12,674 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strcspn_#t~mem3#1 := read~int#0(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume 0 != strcspn_#t~mem3#1;havoc strcspn_#t~mem3#1;call strcspn_#t~mem4#1 := read~int#1(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int#0(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1;strcspn_#t~pre6#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre6#1;" [2025-03-09 06:52:12,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1921934394, now seen corresponding path program 1 times [2025-03-09 06:52:12,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:12,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827114263] [2025-03-09 06:52:12,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:12,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:12,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:12,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:12,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:12,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:12,700 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:12,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:12,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:12,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:12,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:12,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:12,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:12,722 INFO L85 PathProgramCache]: Analyzing trace with hash 45643, now seen corresponding path program 1 times [2025-03-09 06:52:12,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:12,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234099531] [2025-03-09 06:52:12,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:12,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:12,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:52:12,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:52:12,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:12,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:12,731 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:12,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:52:12,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:52:12,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:12,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:12,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:12,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:12,738 INFO L85 PathProgramCache]: Analyzing trace with hash 138524530, now seen corresponding path program 1 times [2025-03-09 06:52:12,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:12,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491573723] [2025-03-09 06:52:12,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:12,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:12,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:52:12,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:52:12,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:12,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:12,769 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:12,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:52:12,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:52:12,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:12,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:12,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:13,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-09 06:52:13,350 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:52:13,350 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:52:13,350 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:52:13,350 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:52:13,350 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:52:13,350 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:13,350 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:52:13,350 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:52:13,350 INFO L132 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration3_Lasso [2025-03-09 06:52:13,350 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:52:13,350 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:52:13,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:13,872 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:52:13,874 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:52:13,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:13,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:13,877 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:13,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 06:52:13,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:13,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:13,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:13,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:13,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:13,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:13,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:13,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:13,892 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:13,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:13,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:13,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:13,901 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:13,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 06:52:13,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:13,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:13,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:13,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:13,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:13,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:13,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:13,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:13,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:13,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:13,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:13,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:13,921 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:13,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 06:52:13,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:13,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:13,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:13,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:13,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:13,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:13,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:13,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:13,934 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:13,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-09 06:52:13,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:13,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:13,943 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:13,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 06:52:13,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:13,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:13,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:13,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:13,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:13,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:13,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:13,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:13,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:13,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 06:52:13,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:13,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:13,963 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:13,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 06:52:13,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:13,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:13,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:13,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:13,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:13,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:13,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:13,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:13,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:13,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:13,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:13,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:13,984 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:13,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 06:52:13,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:13,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:13,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:52:13,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:13,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:13,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:13,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:52:13,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:52:13,998 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:14,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 06:52:14,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:14,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:14,005 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:14,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:14,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 06:52:14,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:14,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:14,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:14,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:14,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:14,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:14,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:14,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:14,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:14,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:14,030 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:14,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 06:52:14,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:14,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:14,042 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-09 06:52:14,042 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-03-09 06:52:14,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:14,059 INFO L401 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2025-03-09 06:52:14,059 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-03-09 06:52:14,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:14,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:14,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:14,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:14,100 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:14,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 06:52:14,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:14,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:14,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:14,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:14,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:14,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:14,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:14,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:14,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-09 06:52:14,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:14,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:14,128 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:14,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 06:52:14,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:14,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:14,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:14,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:14,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:14,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:14,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:14,151 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:52:14,168 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-09 06:52:14,168 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-09 06:52:14,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:14,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:14,171 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:14,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-09 06:52:14,176 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:52:14,188 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:52:14,188 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:52:14,188 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_2, ULTIMATE.start_strcspn_~reject#1.offset, ULTIMATE.start_strcspn_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_2 - 1*ULTIMATE.start_strcspn_~reject#1.offset - 1*ULTIMATE.start_strcspn_~i~0#1 Supporting invariants [] [2025-03-09 06:52:14,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-09 06:52:14,216 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-03-09 06:52:14,218 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 06:52:14,218 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 06:52:14,218 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~reject!offset [2025-03-09 06:52:14,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:14,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:52:14,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:52:14,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:14,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:14,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:52:14,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:14,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:52:14,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:52:14,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:14,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:14,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:52:14,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:52:14,269 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:52:14,269 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-03-09 06:52:14,285 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 36 states and 42 transitions. Complement of second has 5 states. [2025-03-09 06:52:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:52:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-03-09 06:52:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:52:14,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2025-03-09 06:52:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:14,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2025-03-09 06:52:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:14,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2025-03-09 06:52:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:14,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 42 transitions. [2025-03-09 06:52:14,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:52:14,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 24 states and 28 transitions. [2025-03-09 06:52:14,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-09 06:52:14,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-09 06:52:14,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2025-03-09 06:52:14,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:52:14,288 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-03-09 06:52:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2025-03-09 06:52:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2025-03-09 06:52:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 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-03-09 06:52:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-09 06:52:14,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-09 06:52:14,289 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-09 06:52:14,289 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:52:14,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2025-03-09 06:52:14,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:52:14,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:14,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:14,291 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:52:14,291 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:52:14,291 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~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;havoc main_#t~nondet9#1;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int#1(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet11#1;main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#0(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem2#1, strcspn_#t~mem3#1, strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre6#1, strcspn_#t~pre7#1, strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1;" "assume true;call strcspn_#t~mem2#1 := read~int#1(strcspn_~s#1.base, strcspn_~s#1.offset, 1);" "assume 0 != strcspn_#t~mem2#1;havoc strcspn_#t~mem2#1;strcspn_~i~0#1 := 0;" "assume true;call strcspn_#t~mem3#1 := read~int#0(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(0 != strcspn_#t~mem3#1);havoc strcspn_#t~mem3#1;" "strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1;strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset;" "assume true;call strcspn_#t~mem2#1 := read~int#1(strcspn_~s#1.base, strcspn_~s#1.offset, 1);" "assume 0 != strcspn_#t~mem2#1;havoc strcspn_#t~mem2#1;strcspn_~i~0#1 := 0;" [2025-03-09 06:52:14,291 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strcspn_#t~mem3#1 := read~int#0(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume 0 != strcspn_#t~mem3#1;havoc strcspn_#t~mem3#1;call strcspn_#t~mem4#1 := read~int#1(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int#0(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1;strcspn_#t~pre6#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre6#1;" [2025-03-09 06:52:14,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash -21946739, now seen corresponding path program 2 times [2025-03-09 06:52:14,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:14,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21840877] [2025-03-09 06:52:14,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:52:14,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:14,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 06:52:14,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:52:14,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:52:14,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:14,316 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:14,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:52:14,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:52:14,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:14,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:14,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:14,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:14,337 INFO L85 PathProgramCache]: Analyzing trace with hash 45643, now seen corresponding path program 2 times [2025-03-09 06:52:14,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:14,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605262279] [2025-03-09 06:52:14,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:52:14,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:14,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:52:14,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:52:14,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:52:14,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:14,340 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:14,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:52:14,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:52:14,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:14,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:14,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:14,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:14,343 INFO L85 PathProgramCache]: Analyzing trace with hash -980256705, now seen corresponding path program 1 times [2025-03-09 06:52:14,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:14,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473777806] [2025-03-09 06:52:14,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:14,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:52:14,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:52:14,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:14,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:14,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:52:14,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:52:14,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473777806] [2025-03-09 06:52:14,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473777806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:52:14,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386771351] [2025-03-09 06:52:14,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:52:14,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:52:14,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:14,598 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:52:14,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 06:52:14,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:52:14,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:52:14,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:14,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:14,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 06:52:14,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:52:14,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:52:14,749 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 06:52:14,750 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 18 treesize of output 11 [2025-03-09 06:52:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:52:14,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386771351] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:52:14,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:52:14,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-09 06:52:14,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224460981] [2025-03-09 06:52:14,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:52:14,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:52:14,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 06:52:14,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:52:14,802 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 6 Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:52:14,886 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-09 06:52:14,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 43 transitions. [2025-03-09 06:52:14,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:52:14,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 32 transitions. [2025-03-09 06:52:14,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-09 06:52:14,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-03-09 06:52:14,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2025-03-09 06:52:14,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:52:14,889 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-03-09 06:52:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2025-03-09 06:52:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2025-03-09 06:52:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:52:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-09 06:52:14,891 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-09 06:52:14,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:52:14,892 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-09 06:52:14,892 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:52:14,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2025-03-09 06:52:14,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:52:14,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:52:14,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:52:14,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:52:14,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:52:14,892 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~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;havoc main_#t~nondet9#1;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;" "assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int#1(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet11#1;main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1 % 18446744073709551616);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int#0(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem2#1, strcspn_#t~mem3#1, strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre6#1, strcspn_#t~pre7#1, strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1;" "assume true;call strcspn_#t~mem2#1 := read~int#1(strcspn_~s#1.base, strcspn_~s#1.offset, 1);" "assume 0 != strcspn_#t~mem2#1;havoc strcspn_#t~mem2#1;strcspn_~i~0#1 := 0;" "assume true;call strcspn_#t~mem3#1 := read~int#0(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume 0 != strcspn_#t~mem3#1;havoc strcspn_#t~mem3#1;call strcspn_#t~mem4#1 := read~int#1(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int#0(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1;strcspn_#t~pre6#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre6#1;" "assume true;call strcspn_#t~mem3#1 := read~int#0(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(0 != strcspn_#t~mem3#1);havoc strcspn_#t~mem3#1;" "strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1;strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre8#1.base, strcspn_#t~pre8#1.offset;" "assume true;call strcspn_#t~mem2#1 := read~int#1(strcspn_~s#1.base, strcspn_~s#1.offset, 1);" "assume 0 != strcspn_#t~mem2#1;havoc strcspn_#t~mem2#1;strcspn_~i~0#1 := 0;" [2025-03-09 06:52:14,893 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call strcspn_#t~mem3#1 := read~int#0(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume 0 != strcspn_#t~mem3#1;havoc strcspn_#t~mem3#1;call strcspn_#t~mem4#1 := read~int#1(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int#0(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1;strcspn_#t~pre6#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre6#1;" [2025-03-09 06:52:14,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:14,894 INFO L85 PathProgramCache]: Analyzing trace with hash 44633685, now seen corresponding path program 2 times [2025-03-09 06:52:14,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:14,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845830478] [2025-03-09 06:52:14,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:52:14,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:14,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 06:52:14,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:52:14,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:52:14,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:14,911 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:14,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:52:14,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:52:14,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:14,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:14,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:14,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:14,924 INFO L85 PathProgramCache]: Analyzing trace with hash 45643, now seen corresponding path program 3 times [2025-03-09 06:52:14,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:14,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958756053] [2025-03-09 06:52:14,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:52:14,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:14,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:52:14,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:52:14,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:52:14,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:14,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:14,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:52:14,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:52:14,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:14,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:14,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:14,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:14,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1757736073, now seen corresponding path program 3 times [2025-03-09 06:52:14,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:52:14,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495594933] [2025-03-09 06:52:14,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:52:14,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:52:14,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-03-09 06:52:14,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:52:14,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 06:52:14,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:14,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:52:14,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:52:14,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:52:14,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:14,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:52:14,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:52:15,683 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:52:15,683 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:52:15,683 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:52:15,683 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:52:15,683 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:52:15,683 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:15,683 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:52:15,683 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:52:15,683 INFO L132 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration5_Lasso [2025-03-09 06:52:15,683 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:52:15,683 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:52:15,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:15,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:16,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:16,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:16,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:52:16,545 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:52:16,545 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:52:16,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:16,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:16,547 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:16,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 06:52:16,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:16,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:16,560 INFO L203 nArgumentSynthesizer]: 12 stem disjuncts [2025-03-09 06:52:16,560 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-03-09 06:52:16,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:16,612 INFO L401 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2025-03-09 06:52:16,612 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-03-09 06:52:16,702 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:16,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:16,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:16,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:16,712 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:16,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 06:52:16,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:16,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:16,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:16,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:16,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:16,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:16,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:16,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:16,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:16,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:16,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:16,737 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:16,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-09 06:52:16,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:16,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:16,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:16,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:16,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:16,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:16,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:16,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:16,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-09 06:52:16,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:16,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:16,761 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:16,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-09 06:52:16,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:16,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:16,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:16,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:16,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:16,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:16,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:16,780 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:52:16,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-09 06:52:16,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:16,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:16,788 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:16,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-09 06:52:16,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:52:16,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:52:16,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:52:16,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:52:16,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:52:16,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:52:16,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:52:16,809 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:52:16,822 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-09 06:52:16,823 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-09 06:52:16,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:52:16,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:52:16,825 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:52:16,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-09 06:52:16,827 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:52:16,837 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:52:16,838 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:52:16,838 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0#1, v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_3, ULTIMATE.start_strcspn_~reject#1.offset) = -1*ULTIMATE.start_strcspn_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_3 - 1*ULTIMATE.start_strcspn_~reject#1.offset Supporting invariants [] [2025-03-09 06:52:16,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-09 06:52:16,871 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2025-03-09 06:52:16,872 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 06:52:16,872 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 06:52:16,872 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~reject!offset [2025-03-09 06:52:16,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:16,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:52:16,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:52:16,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:16,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:16,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:52:16,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:16,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:52:16,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:52:16,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:16,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:16,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:52:16,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:52:16,930 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:52:16,930 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-03-09 06:52:16,948 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 34 states and 39 transitions. Complement of second has 5 states. [2025-03-09 06:52:16,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:52:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-03-09 06:52:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:52:16,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-09 06:52:16,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:16,949 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:52:16,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:16,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:52:16,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:52:16,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:16,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:16,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:52:16,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:16,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:52:16,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:52:16,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:16,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:16,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:52:16,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:52:17,008 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:52:17,008 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-03-09 06:52:17,026 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 34 states and 39 transitions. Complement of second has 5 states. [2025-03-09 06:52:17,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:52:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-03-09 06:52:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:52:17,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-09 06:52:17,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:17,028 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:52:17,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:52:17,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:52:17,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:52:17,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:17,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:17,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:52:17,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:17,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:52:17,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:52:17,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:52:17,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:52:17,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:52:17,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:52:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:52:17,084 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:52:17,084 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-03-09 06:52:17,104 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 36 states and 43 transitions. Complement of second has 4 states. [2025-03-09 06:52:17,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:52:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-03-09 06:52:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2025-03-09 06:52:17,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-09 06:52:17,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:17,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 17 letters. Loop has 3 letters. [2025-03-09 06:52:17,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:17,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-09 06:52:17,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:52:17,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2025-03-09 06:52:17,106 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:52:17,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2025-03-09 06:52:17,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 06:52:17,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 06:52:17,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 06:52:17,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:52:17,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:52:17,107 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:52:17,107 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:52:17,107 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:52:17,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 06:52:17,107 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:52:17,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 06:52:17,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:52:17 BoogieIcfgContainer [2025-03-09 06:52:17,112 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:52:17,113 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:52:17,113 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:52:17,113 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:52:17,113 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:52:10" (3/4) ... [2025-03-09 06:52:17,115 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 06:52:17,115 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:52:17,116 INFO L158 Benchmark]: Toolchain (without parser) took 7189.21ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 124.1MB in the beginning and 225.5MB in the end (delta: -101.4MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2025-03-09 06:52:17,116 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:52:17,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.18ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 107.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:52:17,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.34ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 105.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:52:17,117 INFO L158 Benchmark]: Boogie Preprocessor took 31.68ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 104.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:52:17,117 INFO L158 Benchmark]: IcfgBuilder took 234.40ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 90.9MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:52:17,117 INFO L158 Benchmark]: BuchiAutomizer took 6573.38ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 90.9MB in the beginning and 225.5MB in the end (delta: -134.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2025-03-09 06:52:17,117 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 335.5MB. Free memory was 225.5MB in the beginning and 225.5MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:52:17,118 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.18ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 107.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.34ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 105.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.68ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 104.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 234.40ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 90.9MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 6573.38ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 90.9MB in the beginning and 225.5MB in the end (delta: -134.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 335.5MB. Free memory was 225.5MB in the beginning and 225.5MB in the end (delta: 69.1kB). 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: ~s!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~reject!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~reject!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 3 locations. One nondeterministic module has affine ranking function null and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 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, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 154 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 75 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital225 mio100 ax100 hnf100 lsp97 ukn69 mio100 lsp29 div100 bol100 ite100 ukn100 eq150 hnf93 smp98 dnf296 smp90 tf100 neg100 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 156ms VariablesStem: 5 VariablesLoop: 3 DisjunctsStem: 12 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 136 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-03-09 06:52:17,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:17,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-09 06:52:17,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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