./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-dietlibc/strcspn.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3537cd0bed922b783c5bc2cf1d153661eb68e22062217013fbb7937014c3d604 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:03:38,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:03:38,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-06 19:03:38,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:03:38,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:03:38,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:03:39,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:03:39,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:03:39,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:03:39,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:03:39,005 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:03:39,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:03:39,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:03:39,005 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:03:39,005 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:03:39,005 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:03:39,005 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:03:39,005 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:03:39,005 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:03:39,005 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:03:39,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:03:39,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:03:39,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:03:39,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:03:39,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:03:39,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:03:39,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:03:39,006 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:03:39,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:03:39,006 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:03:39,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:03:39,006 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:03:39,006 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:03:39,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:03:39,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:03:39,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:03:39,006 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:03:39,006 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3537cd0bed922b783c5bc2cf1d153661eb68e22062217013fbb7937014c3d604 [2025-02-06 19:03:39,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:03:39,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:03:39,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:03:39,208 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:03:39,208 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:03:39,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strcspn.i [2025-02-06 19:03:40,409 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80fb9e8d7/eeebf219320d4a6e92d814edc4e9fec2/FLAG530741761 [2025-02-06 19:03:40,704 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:03:40,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strcspn.i [2025-02-06 19:03:40,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80fb9e8d7/eeebf219320d4a6e92d814edc4e9fec2/FLAG530741761 [2025-02-06 19:03:40,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80fb9e8d7/eeebf219320d4a6e92d814edc4e9fec2 [2025-02-06 19:03:40,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:03:40,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:03:40,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:03:40,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:03:40,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:03:40,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:03:40" (1/1) ... [2025-02-06 19:03:40,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6ac0aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:40, skipping insertion in model container [2025-02-06 19:03:40,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:03:40" (1/1) ... [2025-02-06 19:03:41,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:03:41,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:03:41,254 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:03:41,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:03:41,305 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:03:41,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:41 WrapperNode [2025-02-06 19:03:41,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:03:41,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:03:41,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:03:41,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:03:41,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:41" (1/1) ... [2025-02-06 19:03:41,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:41" (1/1) ... [2025-02-06 19:03:41,334 INFO L138 Inliner]: procedures = 113, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2025-02-06 19:03:41,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:03:41,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:03:41,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:03:41,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:03:41,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:41" (1/1) ... [2025-02-06 19:03:41,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:41" (1/1) ... [2025-02-06 19:03:41,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:41" (1/1) ... [2025-02-06 19:03:41,362 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-02-06 19:03:41,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:41" (1/1) ... [2025-02-06 19:03:41,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:41" (1/1) ... [2025-02-06 19:03:41,366 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:41" (1/1) ... [2025-02-06 19:03:41,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:41" (1/1) ... [2025-02-06 19:03:41,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:41" (1/1) ... [2025-02-06 19:03:41,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:41" (1/1) ... [2025-02-06 19:03:41,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:03:41,377 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:03:41,377 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:03:41,377 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:03:41,378 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:41" (1/1) ... [2025-02-06 19:03:41,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:41,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:41,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:41,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 19:03:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:03:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 19:03:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:03:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 19:03:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 19:03:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:03:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:03:41,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:03:41,477 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:03:41,479 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:03:41,577 INFO L1309 $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-02-06 19:03:41,584 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-02-06 19:03:41,584 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:03:41,589 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:03:41,589 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:03:41,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:03:41 BoogieIcfgContainer [2025-02-06 19:03:41,589 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:03:41,590 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:03:41,590 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:03:41,593 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:03:41,594 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:03:41,594 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:03:40" (1/3) ... [2025-02-06 19:03:41,595 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@147aa6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:03:41, skipping insertion in model container [2025-02-06 19:03:41,595 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:03:41,595 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:03:41" (2/3) ... [2025-02-06 19:03:41,595 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@147aa6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:03:41, skipping insertion in model container [2025-02-06 19:03:41,595 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:03:41,595 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:03:41" (3/3) ... [2025-02-06 19:03:41,596 INFO L363 chiAutomizerObserver]: Analyzing ICFG strcspn.i [2025-02-06 19:03:41,637 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:03:41,637 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:03:41,637 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:03:41,638 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:03:41,638 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:03:41,638 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:03:41,638 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:03:41,638 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:03:41,643 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-02-06 19:03:41,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:03:41,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:03:41,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:03:41,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:03:41,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:03:41,658 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:03:41,658 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-02-06 19:03:41,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:03:41,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:03:41,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:03:41,659 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:03:41,659 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:03:41,662 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-02-06 19:03:41,662 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-02-06 19:03:41,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:41,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1999931, now seen corresponding path program 1 times [2025-02-06 19:03:41,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:41,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191845250] [2025-02-06 19:03:41,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:41,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:41,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:03:41,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:03:41,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:41,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:41,758 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:41,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:03:41,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:03:41,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:41,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:41,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:41,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1599637, now seen corresponding path program 1 times [2025-02-06 19:03:41,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:41,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386799186] [2025-02-06 19:03:41,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:41,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:41,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:03:41,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:03:41,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:41,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:03:41,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:03:41,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386799186] [2025-02-06 19:03:41,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386799186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:03:41,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:03:41,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:03:41,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367102337] [2025-02-06 19:03:41,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:03:41,844 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:03:41,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:03:41,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 19:03:41,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 19:03:41,866 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-02-06 19:03:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:03:41,869 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2025-02-06 19:03:41,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2025-02-06 19:03:41,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:03:41,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 11 transitions. [2025-02-06 19:03:41,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:03:41,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:03:41,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2025-02-06 19:03:41,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:03:41,875 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-02-06 19:03:41,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2025-02-06 19:03:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-02-06 19:03:41,890 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-02-06 19:03:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-02-06 19:03:41,891 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-02-06 19:03:41,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 19:03:41,894 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-02-06 19:03:41,894 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:03:41,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2025-02-06 19:03:41,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:03:41,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:03:41,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:03:41,895 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:03:41,895 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-06 19:03:41,895 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-02-06 19:03:41,895 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-02-06 19:03:41,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1999931, now seen corresponding path program 2 times [2025-02-06 19:03:41,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:41,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356978029] [2025-02-06 19:03:41,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:03:41,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:41,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:03:41,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:03:41,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:03:41,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:41,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:41,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:03:41,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:03:41,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:41,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:41,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:41,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:41,928 INFO L85 PathProgramCache]: Analyzing trace with hash 49588040, now seen corresponding path program 1 times [2025-02-06 19:03:41,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:41,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592152373] [2025-02-06 19:03:41,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:41,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:41,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:03:41,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:03:41,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:41,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:41,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:41,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:03:41,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:03:41,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:41,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:41,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:41,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:41,944 INFO L85 PathProgramCache]: Analyzing trace with hash 138524494, now seen corresponding path program 1 times [2025-02-06 19:03:41,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:41,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75607097] [2025-02-06 19:03:41,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:41,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:41,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:03:41,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:03:41,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:41,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:41,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:41,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:03:41,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:03:41,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:41,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:41,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:42,640 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:03:42,641 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:03:42,641 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:03:42,641 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:03:42,641 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:03:42,641 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:42,641 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:03:42,641 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:03:42,642 INFO L132 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration2_Lasso [2025-02-06 19:03:42,642 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:03:42,642 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:03:42,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:42,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:43,165 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:03:43,168 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:03:43,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:43,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:43,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:43,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-06 19:03:43,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:43,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:43,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:03:43,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:43,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:43,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:43,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:03:43,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:03:43,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:43,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:43,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:43,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:43,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:43,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-06 19:03:43,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:43,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:43,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:03:43,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:43,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:43,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:43,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:03:43,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:03:43,219 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:43,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-06 19:03:43,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:43,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:43,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:43,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-06 19:03:43,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:43,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:43,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:03:43,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:43,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:43,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:43,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:03:43,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:03:43,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:43,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-06 19:03:43,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:43,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:43,260 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:43,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-06 19:03:43,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:43,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:43,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:43,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:43,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:43,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:03:43,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:03:43,287 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:43,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-06 19:03:43,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:43,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:43,296 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:43,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-06 19:03:43,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:43,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:43,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:43,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:43,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:43,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:03:43,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:03:43,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:03:43,346 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-02-06 19:03:43,347 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-06 19:03:43,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:43,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:43,354 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:43,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-06 19:03:43,357 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:03:43,368 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:03:43,369 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:03:43,369 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-02-06 19:03:43,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-06 19:03:43,398 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-02-06 19:03:43,403 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:03:43,403 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:03:43,404 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2025-02-06 19:03:43,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:43,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:03:43,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:03:43,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:43,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:43,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:03:43,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:43,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:03:43,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:03:43,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:43,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:43,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:03:43,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:43,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:03:43,519 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-02-06 19:03:43,520 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-02-06 19:03:43,575 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-02-06 19:03:43,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:03:43,577 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-02-06 19:03:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-02-06 19:03:43,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 5 letters. [2025-02-06 19:03:43,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:03:43,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 9 letters. Loop has 5 letters. [2025-02-06 19:03:43,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:03:43,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 10 letters. [2025-02-06 19:03:43,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:03:43,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2025-02-06 19:03:43,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-06 19:03:43,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 18 transitions. [2025-02-06 19:03:43,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-06 19:03:43,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-06 19:03:43,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2025-02-06 19:03:43,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:03:43,584 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-02-06 19:03:43,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2025-02-06 19:03:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-06 19:03:43,585 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-02-06 19:03:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2025-02-06 19:03:43,585 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-02-06 19:03:43,585 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-02-06 19:03:43,585 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:03:43,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2025-02-06 19:03:43,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-06 19:03:43,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:03:43,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:03:43,586 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:03:43,586 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:03:43,586 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-02-06 19:03:43,586 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-02-06 19:03:43,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:43,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1921934394, now seen corresponding path program 1 times [2025-02-06 19:03:43,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:43,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199465872] [2025-02-06 19:03:43,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:43,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:43,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:03:43,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:03:43,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:43,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:43,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:43,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:03:43,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:03:43,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:43,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:43,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:43,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:43,618 INFO L85 PathProgramCache]: Analyzing trace with hash 45643, now seen corresponding path program 1 times [2025-02-06 19:03:43,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:43,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305034616] [2025-02-06 19:03:43,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:43,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:43,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:03:43,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:03:43,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:43,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:43,628 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:43,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:03:43,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:03:43,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:43,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:43,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:43,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:43,635 INFO L85 PathProgramCache]: Analyzing trace with hash 138524530, now seen corresponding path program 1 times [2025-02-06 19:03:43,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:43,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151356048] [2025-02-06 19:03:43,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:43,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:43,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:03:43,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:03:43,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:43,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:43,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:43,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:03:43,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:03:43,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:43,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:43,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:44,164 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:03:44,164 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:03:44,164 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:03:44,165 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:03:44,165 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:03:44,165 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:44,165 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:03:44,165 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:03:44,165 INFO L132 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration3_Lasso [2025-02-06 19:03:44,165 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:03:44,165 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:03:44,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:44,661 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:03:44,661 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:03:44,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:44,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:44,663 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:44,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-06 19:03:44,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:44,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:44,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:03:44,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:44,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:44,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:44,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:03:44,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:03:44,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:44,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:44,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:44,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:44,684 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:44,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-06 19:03:44,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:44,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:44,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:03:44,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:44,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:44,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:44,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:03:44,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:03:44,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:44,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:44,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:44,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:44,706 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:44,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-06 19:03:44,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:44,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:44,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:03:44,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:44,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:44,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:44,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:03:44,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:03:44,720 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:44,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:44,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:44,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:44,728 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:44,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-06 19:03:44,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:44,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:44,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:03:44,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:44,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:44,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:44,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:03:44,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:03:44,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:44,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:44,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:44,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:44,753 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:44,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-06 19:03:44,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:44,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:44,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:03:44,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:44,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:44,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:44,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:03:44,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:03:44,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:44,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:44,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:44,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:44,777 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:44,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-06 19:03:44,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:44,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:44,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:03:44,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:44,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:44,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:44,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:03:44,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:03:44,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:44,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:44,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:44,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:44,799 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:44,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-06 19:03:44,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:44,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:44,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:44,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:44,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:44,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:03:44,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:03:44,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:44,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:44,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:44,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:44,826 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:44,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-06 19:03:44,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:44,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:44,839 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:03:44,839 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-02-06 19:03:44,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:44,861 INFO L401 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2025-02-06 19:03:44,862 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-02-06 19:03:44,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:44,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:44,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:44,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:44,908 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:44,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-06 19:03:44,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:44,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:44,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:44,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:44,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:44,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:03:44,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:03:44,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:44,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:44,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:44,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:44,943 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:44,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-06 19:03:44,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:44,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:44,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:44,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:44,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:44,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:03:44,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:03:44,965 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:03:44,980 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-06 19:03:44,980 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-02-06 19:03:44,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:44,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:44,982 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:44,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-06 19:03:44,987 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:03:45,000 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:03:45,000 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:03:45,000 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-02-06 19:03:45,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:45,039 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-02-06 19:03:45,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:03:45,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:03:45,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~reject!offset [2025-02-06 19:03:45,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:45,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:03:45,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:03:45,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:45,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:45,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:03:45,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:45,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:03:45,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:03:45,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:45,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:45,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:03:45,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:03:45,111 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 19:03:45,111 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-02-06 19:03:45,133 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-02-06 19:03:45,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:03:45,135 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-02-06 19:03:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:03:45,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-06 19:03:45,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:03:45,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2025-02-06 19:03:45,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:03:45,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2025-02-06 19:03:45,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:03:45,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 42 transitions. [2025-02-06 19:03:45,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-06 19:03:45,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 24 states and 28 transitions. [2025-02-06 19:03:45,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:03:45,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:03:45,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2025-02-06 19:03:45,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:03:45,137 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-02-06 19:03:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2025-02-06 19:03:45,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2025-02-06 19:03:45,141 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-02-06 19:03:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-02-06 19:03:45,142 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-02-06 19:03:45,142 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-02-06 19:03:45,142 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:03:45,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2025-02-06 19:03:45,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-06 19:03:45,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:03:45,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:03:45,142 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:03:45,142 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:03:45,142 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-02-06 19:03:45,143 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-02-06 19:03:45,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash -21946739, now seen corresponding path program 2 times [2025-02-06 19:03:45,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:45,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480007465] [2025-02-06 19:03:45,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:03:45,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:45,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 19:03:45,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:03:45,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:03:45,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:45,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:45,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:03:45,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:03:45,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:45,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:45,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:45,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash 45643, now seen corresponding path program 2 times [2025-02-06 19:03:45,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:45,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835528582] [2025-02-06 19:03:45,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:03:45,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:45,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:03:45,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:03:45,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:03:45,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:45,184 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:45,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:03:45,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:03:45,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:45,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:45,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:45,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:45,188 INFO L85 PathProgramCache]: Analyzing trace with hash -980256705, now seen corresponding path program 1 times [2025-02-06 19:03:45,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:45,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354883766] [2025-02-06 19:03:45,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:45,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:45,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:03:45,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:03:45,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:45,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:03:45,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:03:45,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354883766] [2025-02-06 19:03:45,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354883766] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:03:45,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053227223] [2025-02-06 19:03:45,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:03:45,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:03:45,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:45,487 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:03:45,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 19:03:45,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:03:45,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:03:45,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:45,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:45,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:03:45,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:03:45,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:03:45,642 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 19:03:45,643 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-02-06 19:03:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:03:45,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053227223] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:03:45,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:03:45,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-02-06 19:03:45,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319536106] [2025-02-06 19:03:45,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:03:45,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:03:45,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 19:03:45,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-06 19:03:45,701 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-02-06 19:03:45,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:03:45,779 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-02-06 19:03:45,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 43 transitions. [2025-02-06 19:03:45,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-06 19:03:45,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 32 transitions. [2025-02-06 19:03:45,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-02-06 19:03:45,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-02-06 19:03:45,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2025-02-06 19:03:45,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:03:45,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-02-06 19:03:45,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2025-02-06 19:03:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2025-02-06 19:03:45,781 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-02-06 19:03:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-02-06 19:03:45,782 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-02-06 19:03:45,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:03:45,782 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-02-06 19:03:45,782 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:03:45,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2025-02-06 19:03:45,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-06 19:03:45,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:03:45,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:03:45,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:03:45,783 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:03:45,783 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-02-06 19:03:45,783 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-02-06 19:03:45,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:45,784 INFO L85 PathProgramCache]: Analyzing trace with hash 44633685, now seen corresponding path program 2 times [2025-02-06 19:03:45,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:45,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166483538] [2025-02-06 19:03:45,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:03:45,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:45,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 19:03:45,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:03:45,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:03:45,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:45,799 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:45,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:03:45,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:03:45,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:45,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:45,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:45,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash 45643, now seen corresponding path program 3 times [2025-02-06 19:03:45,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:45,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738909892] [2025-02-06 19:03:45,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:03:45,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:45,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:03:45,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:03:45,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:03:45,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:45,812 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:45,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:03:45,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:03:45,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:45,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:45,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:45,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:45,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1757736073, now seen corresponding path program 3 times [2025-02-06 19:03:45,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:03:45,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702858226] [2025-02-06 19:03:45,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:03:45,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:03:45,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-02-06 19:03:45,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:03:45,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 19:03:45,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:45,842 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:03:45,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 19:03:45,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 19:03:45,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:45,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:03:45,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:03:46,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:46,520 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:03:46,521 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:03:46,521 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:03:46,521 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:03:46,521 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:03:46,521 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:46,521 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:03:46,521 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:03:46,521 INFO L132 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration5_Lasso [2025-02-06 19:03:46,521 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:03:46,521 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:03:46,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:46,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:03:47,338 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:03:47,339 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:03:47,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:47,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:47,341 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:47,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-06 19:03:47,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:47,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:47,355 INFO L203 nArgumentSynthesizer]: 12 stem disjuncts [2025-02-06 19:03:47,355 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-02-06 19:03:47,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:47,396 INFO L401 nArgumentSynthesizer]: We have 136 Motzkin's Theorem applications. [2025-02-06 19:03:47,396 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-02-06 19:03:47,468 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:47,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:47,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:47,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:47,480 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:47,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-06 19:03:47,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:47,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:47,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:47,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:47,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:47,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:03:47,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:03:47,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:47,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-06 19:03:47,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:47,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:47,509 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:47,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-06 19:03:47,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:47,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:47,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:47,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:47,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:47,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:03:47,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:03:47,524 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:47,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-06 19:03:47,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:47,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:47,538 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:47,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-06 19:03:47,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:47,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:47,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:47,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:47,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:47,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:03:47,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:03:47,560 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:03:47,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-06 19:03:47,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:47,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:47,568 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:47,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-06 19:03:47,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:03:47,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:03:47,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:03:47,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:03:47,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:03:47,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:03:47,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:03:47,590 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:03:47,604 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-02-06 19:03:47,604 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-02-06 19:03:47,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:03:47,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:03:47,606 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:03:47,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-06 19:03:47,608 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:03:47,619 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:03:47,619 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:03:47,619 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-02-06 19:03:47,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:47,651 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2025-02-06 19:03:47,652 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:03:47,652 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:03:47,652 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~reject!offset [2025-02-06 19:03:47,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:47,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:03:47,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:03:47,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:47,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:47,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:03:47,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:47,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:03:47,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:03:47,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:47,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:47,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:03:47,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:03:47,717 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 19:03:47,717 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-02-06 19:03:47,734 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-02-06 19:03:47,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:03:47,735 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-02-06 19:03:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:03:47,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2025-02-06 19:03:47,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:03:47,735 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:03:47,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:47,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:03:47,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:03:47,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:47,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:47,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:03:47,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:47,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:03:47,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:03:47,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:47,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:47,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:03:47,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:03:47,802 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-02-06 19:03:47,802 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-02-06 19:03:47,829 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-02-06 19:03:47,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:03:47,830 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-02-06 19:03:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-02-06 19:03:47,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2025-02-06 19:03:47,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:03:47,834 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:03:47,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:03:47,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:03:47,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:03:47,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:47,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:47,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:03:47,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:47,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:03:47,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:03:47,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:03:47,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:03:47,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:03:47,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:03:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:03:47,927 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-02-06 19:03:47,927 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-02-06 19:03:47,945 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-02-06 19:03:47,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:03:47,946 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-02-06 19:03:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2025-02-06 19:03:47,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2025-02-06 19:03:47,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:03:47,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 17 letters. Loop has 3 letters. [2025-02-06 19:03:47,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:03:47,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2025-02-06 19:03:47,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:03:47,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2025-02-06 19:03:47,948 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:03:47,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2025-02-06 19:03:47,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-06 19:03:47,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-06 19:03:47,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-06 19:03:47,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:03:47,948 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:03:47,948 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:03:47,948 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:03:47,948 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:03:47,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-06 19:03:47,948 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:03:47,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-06 19:03:47,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:03:47 BoogieIcfgContainer [2025-02-06 19:03:47,956 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:03:47,956 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:03:47,956 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:03:47,956 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:03:47,957 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:03:41" (3/4) ... [2025-02-06 19:03:47,958 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 19:03:47,959 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:03:47,959 INFO L158 Benchmark]: Toolchain (without parser) took 6970.80ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 105.1MB in the beginning and 132.9MB in the end (delta: -27.9MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. [2025-02-06 19:03:47,959 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:03:47,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.12ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 88.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 19:03:47,961 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.18ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 86.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:03:47,961 INFO L158 Benchmark]: Boogie Preprocessor took 38.49ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 86.0MB in the end (delta: 949.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:03:47,961 INFO L158 Benchmark]: IcfgBuilder took 212.47ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 73.0MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 19:03:47,962 INFO L158 Benchmark]: BuchiAutomizer took 6365.74ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 72.0MB in the beginning and 133.0MB in the end (delta: -61.0MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2025-02-06 19:03:47,962 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 285.2MB. Free memory was 133.0MB in the beginning and 132.9MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:03:47,963 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.12ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 88.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.18ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 86.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.49ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 86.0MB in the end (delta: 949.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 212.47ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 73.0MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 6365.74ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 72.0MB in the beginning and 133.0MB in the end (delta: -61.0MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 285.2MB. Free memory was 133.0MB in the beginning and 132.9MB in the end (delta: 83.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.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. 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: 129ms 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-02-06 19:03:47,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-06 19:03:48,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-06 19:03:48,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE