./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-dietlibc/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-?-48c9605-m [2025-02-08 14:23:07,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:23:07,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-08 14:23:07,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:23:07,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:23:07,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:23:07,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:23:07,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:23:07,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:23:07,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:23:07,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:23:07,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:23:07,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:23:07,665 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:23:07,665 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:23:07,665 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:23:07,666 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:23:07,666 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:23:07,666 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:23:07,666 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:23:07,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:23:07,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:23:07,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:23:07,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:23:07,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:23:07,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:23:07,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:23:07,667 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:23:07,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:23:07,667 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:23:07,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:23:07,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:23:07,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:23:07,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:23:07,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:23:07,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:23:07,667 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:23:07,668 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-08 14:23:07,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:23:07,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:23:07,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:23:07,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:23:07,912 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:23:07,913 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-08 14:23:09,317 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c970fa97/c677fbe73acd46978d8cd2f5e2939833/FLAGd40f4092a [2025-02-08 14:23:09,675 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:23:09,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strcspn.i [2025-02-08 14:23:09,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c970fa97/c677fbe73acd46978d8cd2f5e2939833/FLAGd40f4092a [2025-02-08 14:23:09,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c970fa97/c677fbe73acd46978d8cd2f5e2939833 [2025-02-08 14:23:09,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:23:09,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:23:09,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:23:09,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:23:09,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:23:09,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:23:09" (1/1) ... [2025-02-08 14:23:09,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203238d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:09, skipping insertion in model container [2025-02-08 14:23:09,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:23:09" (1/1) ... [2025-02-08 14:23:09,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:23:10,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:23:10,136 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:23:10,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:23:10,187 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:23:10,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:10 WrapperNode [2025-02-08 14:23:10,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:23:10,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:23:10,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:23:10,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:23:10,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:10" (1/1) ... [2025-02-08 14:23:10,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:10" (1/1) ... [2025-02-08 14:23:10,221 INFO L138 Inliner]: procedures = 113, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2025-02-08 14:23:10,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:23:10,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:23:10,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:23:10,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:23:10,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:10" (1/1) ... [2025-02-08 14:23:10,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:10" (1/1) ... [2025-02-08 14:23:10,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:10" (1/1) ... [2025-02-08 14:23:10,241 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-08 14:23:10,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:10" (1/1) ... [2025-02-08 14:23:10,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:10" (1/1) ... [2025-02-08 14:23:10,246 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:10" (1/1) ... [2025-02-08 14:23:10,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:10" (1/1) ... [2025-02-08 14:23:10,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:10" (1/1) ... [2025-02-08 14:23:10,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:10" (1/1) ... [2025-02-08 14:23:10,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:23:10,250 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:23:10,250 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:23:10,250 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:23:10,255 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:10" (1/1) ... [2025-02-08 14:23:10,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:10,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:10,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:10,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:23:10,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:23:10,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:23:10,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:23:10,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:23:10,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:23:10,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:23:10,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:23:10,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:23:10,361 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:23:10,363 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:23:10,486 INFO L1324 $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-08 14:23:10,492 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-02-08 14:23:10,492 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:23:10,497 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:23:10,497 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:23:10,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:23:10 BoogieIcfgContainer [2025-02-08 14:23:10,498 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:23:10,498 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:23:10,498 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:23:10,502 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:23:10,502 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:23:10,502 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:23:09" (1/3) ... [2025-02-08 14:23:10,503 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@306d06ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:23:10, skipping insertion in model container [2025-02-08 14:23:10,503 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:23:10,503 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:23:10" (2/3) ... [2025-02-08 14:23:10,503 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@306d06ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:23:10, skipping insertion in model container [2025-02-08 14:23:10,503 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:23:10,503 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:23:10" (3/3) ... [2025-02-08 14:23:10,504 INFO L363 chiAutomizerObserver]: Analyzing ICFG strcspn.i [2025-02-08 14:23:10,530 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:23:10,530 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:23:10,530 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:23:10,530 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:23:10,531 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:23:10,531 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:23:10,531 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:23:10,531 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:23:10,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:10,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:23:10,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:23:10,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:23:10,546 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:23:10,546 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:23:10,546 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:23:10,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:10,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:23:10,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:23:10,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:23:10,548 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:23:10,548 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:23:10,551 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-08 14:23:10,552 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-08 14:23:10,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:10,557 INFO L85 PathProgramCache]: Analyzing trace with hash 61530, now seen corresponding path program 1 times [2025-02-08 14:23:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:10,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187622590] [2025-02-08 14:23:10,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:10,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:10,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:10,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:10,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:10,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:10,673 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:10,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:10,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:10,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:10,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:10,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:10,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:10,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1538069, now seen corresponding path program 1 times [2025-02-08 14:23:10,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:10,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035157896] [2025-02-08 14:23:10,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:10,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:10,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:23:10,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:23:10,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:10,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:23:10,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:23:10,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035157896] [2025-02-08 14:23:10,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035157896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:23:10,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:23:10,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:23:10,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796246882] [2025-02-08 14:23:10,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:23:10,798 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:23:10,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:23:10,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 14:23:10,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 14:23:10,826 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 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-08 14:23:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:23:10,831 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2025-02-08 14:23:10,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2025-02-08 14:23:10,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:23:10,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 10 transitions. [2025-02-08 14:23:10,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:23:10,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-08 14:23:10,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2025-02-08 14:23:10,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:23:10,841 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-02-08 14:23:10,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2025-02-08 14:23:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-02-08 14:23:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-02-08 14:23:10,864 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-02-08 14:23:10,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 14:23:10,867 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-02-08 14:23:10,869 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:23:10,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2025-02-08 14:23:10,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:23:10,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:23:10,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:23:10,870 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:23:10,870 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-08 14:23:10,870 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-08 14:23:10,870 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-08 14:23:10,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash 61530, now seen corresponding path program 2 times [2025-02-08 14:23:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:10,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608170545] [2025-02-08 14:23:10,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:23:10,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:10,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:10,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:10,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:23:10,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:10,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:10,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:10,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:10,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:10,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:10,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:10,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:10,949 INFO L85 PathProgramCache]: Analyzing trace with hash 47679430, now seen corresponding path program 1 times [2025-02-08 14:23:10,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:10,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838451478] [2025-02-08 14:23:10,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:10,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:10,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:23:10,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:23:10,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:10,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:10,958 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:10,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:23:10,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:23:10,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:10,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:10,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:10,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:10,968 INFO L85 PathProgramCache]: Analyzing trace with hash 634119949, now seen corresponding path program 1 times [2025-02-08 14:23:10,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:10,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700208461] [2025-02-08 14:23:10,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:10,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:10,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:23:11,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:23:11,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:11,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:11,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:11,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:23:11,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:23:11,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:11,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:11,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:11,682 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:23:11,682 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:23:11,682 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:23:11,682 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:23:11,682 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:23:11,683 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:11,683 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:23:11,683 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:23:11,683 INFO L132 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration2_Lasso [2025-02-08 14:23:11,683 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:23:11,683 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:23:11,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:11,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:12,224 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:23:12,227 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:23:12,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:12,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:12,229 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:12,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-08 14:23:12,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:12,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:12,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:12,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:12,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:12,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:12,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:12,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:12,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:12,256 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-08 14:23:12,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:12,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:12,258 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:12,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-08 14:23:12,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:12,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:12,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:12,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:12,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:12,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:12,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:12,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:12,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:12,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:12,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:12,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:12,282 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:12,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-08 14:23:12,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:12,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:12,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:12,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:12,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:12,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:12,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:12,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:12,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:12,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:12,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:12,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:12,303 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:12,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-08 14:23:12,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:12,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:12,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:12,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:12,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:12,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:12,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:12,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:12,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:12,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:12,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:12,324 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:12,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-08 14:23:12,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:12,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:12,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:12,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:12,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:12,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:23:12,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:23:12,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:12,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-08 14:23:12,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:12,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:12,357 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:12,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-08 14:23:12,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:12,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:12,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:12,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:12,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:12,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:23:12,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:23:12,383 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:23:12,400 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-02-08 14:23:12,402 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-08 14:23:12,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:12,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:12,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:12,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-08 14:23:12,407 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:23:12,418 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:23:12,419 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:23:12,419 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcspn_~s#1.base)_1, ULTIMATE.start_strcspn_~s#1.offset) = 1*v_rep(select #length ULTIMATE.start_strcspn_~s#1.base)_1 - 1*ULTIMATE.start_strcspn_~s#1.offset Supporting invariants [] [2025-02-08 14:23:12,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-08 14:23:12,448 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-02-08 14:23:12,452 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:23:12,452 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:23:12,453 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s!offset [2025-02-08 14:23:12,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:12,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:12,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:12,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:12,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:12,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:23:12,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:12,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-08 14:23:12,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:23:12,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:23:12,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:12,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:12,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:23:12,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:23:12,556 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-08 14:23:12,557 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:12,588 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 15 states and 18 transitions. Complement of second has 4 states. [2025-02-08 14:23:12,589 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-08 14:23:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2025-02-08 14:23:12,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 5 letters. [2025-02-08 14:23:12,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:12,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 5 letters. [2025-02-08 14:23:12,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:12,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 10 letters. [2025-02-08 14:23:12,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:12,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2025-02-08 14:23:12,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-08 14:23:12,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 17 transitions. [2025-02-08 14:23:12,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-02-08 14:23:12,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-08 14:23:12,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2025-02-08 14:23:12,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:23:12,598 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-02-08 14:23:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2025-02-08 14:23:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-02-08 14:23:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2025-02-08 14:23:12,599 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-02-08 14:23:12,599 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-02-08 14:23:12,599 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:23:12,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2025-02-08 14:23:12,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-08 14:23:12,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:23:12,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:23:12,599 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-08 14:23:12,599 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:23:12,599 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-08 14:23:12,599 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-08 14:23:12,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:12,600 INFO L85 PathProgramCache]: Analyzing trace with hash 59130969, now seen corresponding path program 1 times [2025-02-08 14:23:12,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:12,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124904358] [2025-02-08 14:23:12,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:12,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:12,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:23:12,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:23:12,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:12,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:12,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:12,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:23:12,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:23:12,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:12,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:12,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:12,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:12,637 INFO L85 PathProgramCache]: Analyzing trace with hash 43657, now seen corresponding path program 1 times [2025-02-08 14:23:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:12,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933881898] [2025-02-08 14:23:12,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:12,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:12,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:12,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:12,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:12,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:12,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:12,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:12,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:12,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:12,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:12,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:12,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash 634119985, now seen corresponding path program 1 times [2025-02-08 14:23:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:12,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575864551] [2025-02-08 14:23:12,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:12,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:23:12,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:23:12,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:12,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:12,684 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:12,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:23:12,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:23:12,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:12,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:12,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:13,218 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:23:13,218 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:23:13,218 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:23:13,218 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:23:13,218 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:23:13,218 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:13,219 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:23:13,219 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:23:13,219 INFO L132 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration3_Lasso [2025-02-08 14:23:13,219 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:23:13,219 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:23:13,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:13,906 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:23:13,906 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:23:13,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:13,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:13,912 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:13,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:13,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-08 14:23:13,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:13,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:13,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:13,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:13,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:13,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:13,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:13,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:13,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:13,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:13,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:13,941 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:13,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-08 14:23:13,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-08 14:23:13,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:13,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:13,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:13,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:13,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:13,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:13,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:13,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:13,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:13,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:13,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:13,968 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:13,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-08 14:23:13,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:13,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:13,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:13,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:13,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:13,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:13,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:13,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:13,986 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:13,992 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-08 14:23:13,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:13,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:13,997 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:13,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-08 14:23:13,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:14,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:14,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:14,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:14,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:14,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:14,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:14,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:14,021 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:14,033 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-08 14:23:14,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:14,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:14,038 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:14,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-08 14:23:14,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:14,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:14,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:14,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:14,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:14,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:14,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:14,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:14,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:14,062 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-08 14:23:14,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:14,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:14,064 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:14,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-08 14:23:14,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:14,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:14,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:23:14,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:14,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:14,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:14,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:23:14,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:23:14,082 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:14,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:14,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:14,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:14,091 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:14,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-08 14:23:14,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:14,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:14,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:14,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:14,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:14,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:23:14,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:23:14,116 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:14,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-08 14:23:14,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:14,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:14,135 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-08 14:23:14,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:14,138 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-08 14:23:14,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:14,151 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-08 14:23:14,151 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-02-08 14:23:14,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:14,172 INFO L401 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2025-02-08 14:23:14,172 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-02-08 14:23:14,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:14,210 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-08 14:23:14,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:14,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:14,212 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-08 14:23:14,213 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-08 14:23:14,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:14,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:14,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:14,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:14,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:14,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:23:14,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:23:14,233 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:14,239 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-08 14:23:14,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:14,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:14,241 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-08 14:23:14,245 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-08 14:23:14,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:14,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:14,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:14,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:14,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:14,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:23:14,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:23:14,266 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:23:14,281 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-02-08 14:23:14,281 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-02-08 14:23:14,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:14,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:14,284 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:14,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-08 14:23:14,287 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:23:14,297 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:23:14,298 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:23:14,298 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-08 14:23:14,303 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-08 14:23:14,325 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-02-08 14:23:14,326 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:23:14,326 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:23:14,327 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~reject!offset [2025-02-08 14:23:14,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:14,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:23:14,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:23:14,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:14,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:14,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:23:14,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:14,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:14,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:14,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:14,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:14,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:23:14,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:23:14,380 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-08 14:23:14,381 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:14,397 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 35 states and 41 transitions. Complement of second has 5 states. [2025-02-08 14:23:14,398 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-08 14:23:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-02-08 14:23:14,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-08 14:23:14,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:14,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-08 14:23:14,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:14,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 5 letters. Loop has 6 letters. [2025-02-08 14:23:14,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:14,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2025-02-08 14:23:14,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-08 14:23:14,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 23 states and 27 transitions. [2025-02-08 14:23:14,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:23:14,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-08 14:23:14,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2025-02-08 14:23:14,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:23:14,402 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-02-08 14:23:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2025-02-08 14:23:14,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2025-02-08 14:23:14,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:14,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-02-08 14:23:14,403 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-02-08 14:23:14,403 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-02-08 14:23:14,404 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:23:14,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2025-02-08 14:23:14,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-08 14:23:14,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:23:14,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:23:14,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:23:14,405 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:23:14,405 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-08 14:23:14,405 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-08 14:23:14,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:14,405 INFO L85 PathProgramCache]: Analyzing trace with hash -496084404, now seen corresponding path program 2 times [2025-02-08 14:23:14,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:14,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715909825] [2025-02-08 14:23:14,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:23:14,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:14,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 14:23:14,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:23:14,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:23:14,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:14,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:14,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:23:14,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:23:14,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:14,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:14,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:14,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:14,447 INFO L85 PathProgramCache]: Analyzing trace with hash 43657, now seen corresponding path program 2 times [2025-02-08 14:23:14,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:14,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064784630] [2025-02-08 14:23:14,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:23:14,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:14,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:14,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:14,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:23:14,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:14,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:14,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:14,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:14,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:14,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:14,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:14,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:14,456 INFO L85 PathProgramCache]: Analyzing trace with hash 131999838, now seen corresponding path program 1 times [2025-02-08 14:23:14,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:14,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827171851] [2025-02-08 14:23:14,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:14,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:14,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:14,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:14,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:14,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:14,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:14,739 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-08 14:23:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:23:14,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827171851] [2025-02-08 14:23:14,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827171851] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:23:14,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804337846] [2025-02-08 14:23:14,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:23:14,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:23:14,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:14,742 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:23:14,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-08 14:23:14,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:14,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:14,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:14,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:14,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 14:23:14,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:14,844 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-08 14:23:14,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:23:14,888 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 14:23:14,889 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-08 14:23:14,893 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-08 14:23:14,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804337846] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:23:14,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:23:14,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-02-08 14:23:14,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971797151] [2025-02-08 14:23:14,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:23:14,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:23:14,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 14:23:14,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-08 14:23:14,945 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 6 Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:23:14,997 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-02-08 14:23:14,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2025-02-08 14:23:14,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-08 14:23:14,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 28 states and 31 transitions. [2025-02-08 14:23:15,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-02-08 14:23:15,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-08 14:23:15,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2025-02-08 14:23:15,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:23:15,000 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-02-08 14:23:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2025-02-08 14:23:15,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2025-02-08 14:23:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-02-08 14:23:15,002 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-02-08 14:23:15,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 14:23:15,003 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-02-08 14:23:15,004 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:23:15,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2025-02-08 14:23:15,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-08 14:23:15,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:23:15,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:23:15,005 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:23:15,005 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:23:15,005 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-08 14:23:15,005 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-08 14:23:15,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:15,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1156890228, now seen corresponding path program 2 times [2025-02-08 14:23:15,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:15,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780504203] [2025-02-08 14:23:15,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:23:15,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:15,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-08 14:23:15,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:15,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:23:15,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:15,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:15,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:15,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:15,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:15,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:15,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:15,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:15,048 INFO L85 PathProgramCache]: Analyzing trace with hash 43657, now seen corresponding path program 3 times [2025-02-08 14:23:15,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:15,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376641258] [2025-02-08 14:23:15,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:23:15,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:15,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:15,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:15,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:23:15,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:15,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:15,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:15,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:15,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:15,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:15,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:15,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:15,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2099213110, now seen corresponding path program 3 times [2025-02-08 14:23:15,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:23:15,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322766717] [2025-02-08 14:23:15,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:23:15,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:23:15,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-02-08 14:23:15,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:23:15,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 14:23:15,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:15,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:23:15,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:23:15,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:23:15,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:15,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:23:15,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:23:15,723 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:23:15,723 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:23:15,723 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:23:15,724 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:23:15,724 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:23:15,724 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:15,724 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:23:15,724 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:23:15,724 INFO L132 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration5_Lasso [2025-02-08 14:23:15,724 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:23:15,724 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:23:15,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:23:16,558 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:23:16,558 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:23:16,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:16,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:16,560 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:16,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-08 14:23:16,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:16,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:16,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:16,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:16,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:16,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:23:16,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:23:16,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:16,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-08 14:23:16,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:16,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:16,588 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:16,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-08 14:23:16,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:16,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:16,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:16,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:16,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:16,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:23:16,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:23:16,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:23:16,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-08 14:23:16,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:16,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:16,610 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:16,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-08 14:23:16,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:23:16,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:23:16,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:23:16,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:23:16,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:23:16,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:23:16,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:23:16,634 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:23:16,651 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-08 14:23:16,651 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-02-08 14:23:16,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:23:16,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:23:16,654 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:23:16,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-08 14:23:16,666 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:23:16,678 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:23:16,678 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:23:16,678 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3, ULTIMATE.start_strcspn_~reject#1.offset) = -1*ULTIMATE.start_strcspn_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3 - 1*ULTIMATE.start_strcspn_~reject#1.offset Supporting invariants [] [2025-02-08 14:23:16,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-08 14:23:16,707 INFO L156 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2025-02-08 14:23:16,709 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:23:16,709 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:23:16,709 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~reject!offset [2025-02-08 14:23:16,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:16,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:16,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:16,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:16,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:16,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:23:16,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:16,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:16,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:16,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:16,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:16,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:23:16,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:23:16,793 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-08 14:23:16,793 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:16,826 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 33 states and 38 transitions. Complement of second has 6 states. [2025-02-08 14:23:16,827 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-08 14:23:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-02-08 14:23:16,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2025-02-08 14:23:16,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:16,827 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:23:16,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:16,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:16,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:16,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:16,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:16,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:23:16,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:16,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:16,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:16,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:16,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:16,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:23:16,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:23:16,910 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2025-02-08 14:23:16,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:16,938 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 33 states and 38 transitions. Complement of second has 6 states. [2025-02-08 14:23:16,938 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-08 14:23:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:16,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-02-08 14:23:16,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2025-02-08 14:23:16,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:16,939 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:23:16,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:23:16,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:23:16,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:23:16,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:16,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:16,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:23:16,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:17,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:23:17,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:23:17,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:23:17,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:23:17,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:23:17,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:23:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:23:17,052 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-02-08 14:23:17,052 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:17,090 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 35 states and 42 transitions. Complement of second has 5 states. [2025-02-08 14:23:17,091 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-08 14:23:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:23:17,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2025-02-08 14:23:17,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 3 letters. [2025-02-08 14:23:17,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:17,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 3 letters. [2025-02-08 14:23:17,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:17,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 6 letters. [2025-02-08 14:23:17,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:23:17,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2025-02-08 14:23:17,093 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:23:17,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2025-02-08 14:23:17,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:23:17,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:23:17,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:23:17,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:23:17,093 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:23:17,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:23:17,094 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:23:17,094 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:23:17,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:23:17,094 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:23:17,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:23:17,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:23:17 BoogieIcfgContainer [2025-02-08 14:23:17,099 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:23:17,099 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:23:17,099 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:23:17,099 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:23:17,100 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:23:10" (3/4) ... [2025-02-08 14:23:17,103 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:23:17,104 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:23:17,105 INFO L158 Benchmark]: Toolchain (without parser) took 7194.29ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.5MB in the beginning and 89.2MB in the end (delta: 22.3MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2025-02-08 14:23:17,105 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:23:17,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.65ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 94.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:23:17,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.96ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:23:17,105 INFO L158 Benchmark]: Boogie Preprocessor took 26.86ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 92.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:23:17,106 INFO L158 Benchmark]: IcfgBuilder took 248.16ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 78.3MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:23:17,106 INFO L158 Benchmark]: BuchiAutomizer took 6600.72ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 78.3MB in the beginning and 89.2MB in the end (delta: -10.9MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2025-02-08 14:23:17,106 INFO L158 Benchmark]: Witness Printer took 4.84ms. Allocated memory is still 176.2MB. Free memory was 89.2MB in the beginning and 89.2MB in the end (delta: 33.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:23:17,108 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.18ms. Allocated memory is still 226.5MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.65ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 94.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.96ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.86ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 92.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 248.16ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 78.3MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 6600.72ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 78.3MB in the beginning and 89.2MB in the end (delta: -10.9MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * Witness Printer took 4.84ms. Allocated memory is still 176.2MB. Free memory was 89.2MB in the beginning and 89.2MB in the end (delta: 33.0kB). 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 3 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 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. 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, 97 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 66 mSDtfsCounter, 92 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: 74ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-08 14:23:17,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-08 14:23:17,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-08 14:23:17,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE