./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrcpy_reverse_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrcpy_reverse_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cf36d0c9351c4c2fb1711d3f7c837e0253db9403415afa1c4469ec7ba9a72414 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:56:11,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:56:12,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:56:12,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:56:12,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:56:12,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:56:12,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:56:12,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:56:12,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:56:12,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:56:12,077 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:56:12,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:56:12,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:56:12,078 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:56:12,078 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:56:12,078 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:56:12,078 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:56:12,078 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:56:12,078 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:56:12,078 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:56:12,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:56:12,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:56:12,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:56:12,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:56:12,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:56:12,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:56:12,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:56:12,079 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:56:12,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:56:12,079 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:56:12,079 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:56:12,079 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:56:12,079 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:56:12,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:56:12,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:56:12,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:56:12,080 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:56:12,080 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf36d0c9351c4c2fb1711d3f7c837e0253db9403415afa1c4469ec7ba9a72414 [2025-03-09 06:56:12,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:56:12,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:56:12,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:56:12,332 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:56:12,332 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:56:12,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcpy_reverse_alloca.i [2025-03-09 06:56:13,528 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47833aa68/3e79d58c7a37426e87a8ffd5d8f95160/FLAG1845d1096 [2025-03-09 06:56:13,825 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:56:13,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcpy_reverse_alloca.i [2025-03-09 06:56:13,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47833aa68/3e79d58c7a37426e87a8ffd5d8f95160/FLAG1845d1096 [2025-03-09 06:56:13,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47833aa68/3e79d58c7a37426e87a8ffd5d8f95160 [2025-03-09 06:56:13,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:56:13,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:56:13,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:56:13,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:56:13,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:56:13,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:56:13" (1/1) ... [2025-03-09 06:56:13,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68298c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:13, skipping insertion in model container [2025-03-09 06:56:13,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:56:13" (1/1) ... [2025-03-09 06:56:13,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:56:14,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:56:14,076 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:56:14,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:56:14,123 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:56:14,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:14 WrapperNode [2025-03-09 06:56:14,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:56:14,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:56:14,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:56:14,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:56:14,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:14" (1/1) ... [2025-03-09 06:56:14,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:14" (1/1) ... [2025-03-09 06:56:14,154 INFO L138 Inliner]: procedures = 152, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2025-03-09 06:56:14,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:56:14,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:56:14,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:56:14,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:56:14,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:14" (1/1) ... [2025-03-09 06:56:14,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:14" (1/1) ... [2025-03-09 06:56:14,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:14" (1/1) ... [2025-03-09 06:56:14,172 INFO L175 MemorySlicer]: Split 3 memory accesses to 2 slices as follows [1, 2]. 67 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-03-09 06:56:14,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:14" (1/1) ... [2025-03-09 06:56:14,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:14" (1/1) ... [2025-03-09 06:56:14,175 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:14" (1/1) ... [2025-03-09 06:56:14,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:14" (1/1) ... [2025-03-09 06:56:14,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:14" (1/1) ... [2025-03-09 06:56:14,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:14" (1/1) ... [2025-03-09 06:56:14,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:56:14,180 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:56:14,180 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:56:14,180 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:56:14,181 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:14" (1/1) ... [2025-03-09 06:56:14,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:14,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:14,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:14,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 06:56:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:56:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:56:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:56:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:56:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:56:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:56:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:56:14,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:56:14,279 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:56:14,280 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:56:14,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L382: call ULTIMATE.dealloc(main_#t~malloc210#1.base, main_#t~malloc210#1.offset);havoc main_#t~malloc210#1.base, main_#t~malloc210#1.offset;call ULTIMATE.dealloc(main_#t~malloc211#1.base, main_#t~malloc211#1.offset);havoc main_#t~malloc211#1.base, main_#t~malloc211#1.offset; [2025-03-09 06:56:14,392 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-09 06:56:14,393 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:56:14,398 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:56:14,398 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:56:14,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:56:14 BoogieIcfgContainer [2025-03-09 06:56:14,399 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:56:14,399 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:56:14,399 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:56:14,403 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:56:14,404 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:56:14,404 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:56:13" (1/3) ... [2025-03-09 06:56:14,404 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10841993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:56:14, skipping insertion in model container [2025-03-09 06:56:14,404 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:56:14,405 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:56:14" (2/3) ... [2025-03-09 06:56:14,405 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10841993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:56:14, skipping insertion in model container [2025-03-09 06:56:14,405 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:56:14,405 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:56:14" (3/3) ... [2025-03-09 06:56:14,409 INFO L363 chiAutomizerObserver]: Analyzing ICFG cstrcpy_reverse_alloca.i [2025-03-09 06:56:14,443 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:56:14,443 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:56:14,443 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:56:14,444 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:56:14,444 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:56:14,444 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:56:14,444 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:56:14,444 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:56:14,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:14,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:14,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:14,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:14,464 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:56:14,464 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:14,464 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:56:14,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:14,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:14,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:14,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:14,466 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:56:14,466 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:14,470 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~nondet208#1, main_#t~nondet209#1, main_#t~malloc210#1.base, main_#t~malloc210#1.offset, main_#t~malloc211#1.base, main_#t~malloc211#1.offset, main_#t~ret212#1.base, main_#t~ret212#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc main_#t~nondet208#1;main_~length1~0#1 := main_#t~nondet208#1;havoc main_#t~nondet208#1;havoc main_#t~nondet209#1;main_~length2~0#1 := main_#t~nondet209#1;havoc main_#t~nondet209#1;" "assume !(main_~length1~0#1 < 1);" "assume main_~length2~0#1 < 1;main_~length2~0#1 := 1;" "assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc210#1.base, main_#t~malloc210#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc210#1.base, main_#t~malloc210#1.offset;call main_#t~malloc211#1.base, main_#t~malloc211#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc211#1.base, main_#t~malloc211#1.offset;call write~int#1(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, 1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + (main_~length1~0#1 - 1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrcpy } true;cstrcpy_#in~s1#1.base, cstrcpy_#in~s1#1.offset, cstrcpy_#in~s2#1.base, cstrcpy_#in~s2#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstrcpy_#res#1.base, cstrcpy_#res#1.offset;havoc cstrcpy_#t~post205#1.base, cstrcpy_#t~post205#1.offset, cstrcpy_#t~post206#1.base, cstrcpy_#t~post206#1.offset, cstrcpy_#t~mem207#1, cstrcpy_~s1#1.base, cstrcpy_~s1#1.offset, cstrcpy_~s2#1.base, cstrcpy_~s2#1.offset, cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset, cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset;cstrcpy_~s1#1.base, cstrcpy_~s1#1.offset := cstrcpy_#in~s1#1.base, cstrcpy_#in~s1#1.offset;cstrcpy_~s2#1.base, cstrcpy_~s2#1.offset := cstrcpy_#in~s2#1.base, cstrcpy_#in~s2#1.offset;cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset := cstrcpy_~s1#1.base, cstrcpy_~s1#1.offset;cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset := cstrcpy_~s2#1.base, cstrcpy_~s2#1.offset;" [2025-03-09 06:56:14,470 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrcpy_#t~post205#1.base, cstrcpy_#t~post205#1.offset := cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset;cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset := cstrcpy_#t~post205#1.base, cstrcpy_#t~post205#1.offset - 1;cstrcpy_#t~post206#1.base, cstrcpy_#t~post206#1.offset := cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset;cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset := cstrcpy_#t~post206#1.base, cstrcpy_#t~post206#1.offset - 1;call cstrcpy_#t~mem207#1 := read~int#1(cstrcpy_#t~post206#1.base, cstrcpy_#t~post206#1.offset, 1);call write~int#0(cstrcpy_#t~mem207#1, cstrcpy_#t~post205#1.base, cstrcpy_#t~post205#1.offset, 1);" "assume 0 != cstrcpy_#t~mem207#1;havoc cstrcpy_#t~post205#1.base, cstrcpy_#t~post205#1.offset;havoc cstrcpy_#t~post206#1.base, cstrcpy_#t~post206#1.offset;havoc cstrcpy_#t~mem207#1;" [2025-03-09 06:56:14,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:14,476 INFO L85 PathProgramCache]: Analyzing trace with hash 47683377, now seen corresponding path program 1 times [2025-03-09 06:56:14,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:14,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698198174] [2025-03-09 06:56:14,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:14,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:14,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:56:14,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:56:14,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:14,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:14,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:14,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:56:14,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:56:14,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:14,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:14,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:14,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:14,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1215, now seen corresponding path program 1 times [2025-03-09 06:56:14,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:14,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695591356] [2025-03-09 06:56:14,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:14,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:14,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:14,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:14,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:14,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:14,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:14,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:14,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:14,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:14,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:14,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:14,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:14,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1420914705, now seen corresponding path program 1 times [2025-03-09 06:56:14,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:14,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189802082] [2025-03-09 06:56:14,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:14,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:14,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:56:14,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:56:14,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:14,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:15,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:56:15,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189802082] [2025-03-09 06:56:15,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189802082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:56:15,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:56:15,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:56:15,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374085237] [2025-03-09 06:56:15,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:56:15,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:56:15,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:56:15,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:56:15,271 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:56:15,329 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2025-03-09 06:56:15,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2025-03-09 06:56:15,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:15,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 7 states and 8 transitions. [2025-03-09 06:56:15,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-09 06:56:15,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-09 06:56:15,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2025-03-09 06:56:15,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:56:15,337 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-03-09 06:56:15,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2025-03-09 06:56:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-09 06:56:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-03-09 06:56:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2025-03-09 06:56:15,353 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-03-09 06:56:15,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:56:15,356 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-03-09 06:56:15,356 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:56:15,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2025-03-09 06:56:15,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 06:56:15,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:56:15,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:56:15,356 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:56:15,356 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 06:56:15,357 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~nondet208#1, main_#t~nondet209#1, main_#t~malloc210#1.base, main_#t~malloc210#1.offset, main_#t~malloc211#1.base, main_#t~malloc211#1.offset, main_#t~ret212#1.base, main_#t~ret212#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc main_#t~nondet208#1;main_~length1~0#1 := main_#t~nondet208#1;havoc main_#t~nondet208#1;havoc main_#t~nondet209#1;main_~length2~0#1 := main_#t~nondet209#1;havoc main_#t~nondet209#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc210#1.base, main_#t~malloc210#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc210#1.base, main_#t~malloc210#1.offset;call main_#t~malloc211#1.base, main_#t~malloc211#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc211#1.base, main_#t~malloc211#1.offset;call write~int#1(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, 1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + (main_~length1~0#1 - 1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrcpy } true;cstrcpy_#in~s1#1.base, cstrcpy_#in~s1#1.offset, cstrcpy_#in~s2#1.base, cstrcpy_#in~s2#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstrcpy_#res#1.base, cstrcpy_#res#1.offset;havoc cstrcpy_#t~post205#1.base, cstrcpy_#t~post205#1.offset, cstrcpy_#t~post206#1.base, cstrcpy_#t~post206#1.offset, cstrcpy_#t~mem207#1, cstrcpy_~s1#1.base, cstrcpy_~s1#1.offset, cstrcpy_~s2#1.base, cstrcpy_~s2#1.offset, cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset, cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset;cstrcpy_~s1#1.base, cstrcpy_~s1#1.offset := cstrcpy_#in~s1#1.base, cstrcpy_#in~s1#1.offset;cstrcpy_~s2#1.base, cstrcpy_~s2#1.offset := cstrcpy_#in~s2#1.base, cstrcpy_#in~s2#1.offset;cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset := cstrcpy_~s1#1.base, cstrcpy_~s1#1.offset;cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset := cstrcpy_~s2#1.base, cstrcpy_~s2#1.offset;" [2025-03-09 06:56:15,357 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrcpy_#t~post205#1.base, cstrcpy_#t~post205#1.offset := cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset;cstrcpy_~dst~0#1.base, cstrcpy_~dst~0#1.offset := cstrcpy_#t~post205#1.base, cstrcpy_#t~post205#1.offset - 1;cstrcpy_#t~post206#1.base, cstrcpy_#t~post206#1.offset := cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset;cstrcpy_~src~0#1.base, cstrcpy_~src~0#1.offset := cstrcpy_#t~post206#1.base, cstrcpy_#t~post206#1.offset - 1;call cstrcpy_#t~mem207#1 := read~int#1(cstrcpy_#t~post206#1.base, cstrcpy_#t~post206#1.offset, 1);call write~int#0(cstrcpy_#t~mem207#1, cstrcpy_#t~post205#1.base, cstrcpy_#t~post205#1.offset, 1);" "assume 0 != cstrcpy_#t~mem207#1;havoc cstrcpy_#t~post205#1.base, cstrcpy_#t~post205#1.offset;havoc cstrcpy_#t~post206#1.base, cstrcpy_#t~post206#1.offset;havoc cstrcpy_#t~mem207#1;" [2025-03-09 06:56:15,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:15,357 INFO L85 PathProgramCache]: Analyzing trace with hash 47683408, now seen corresponding path program 1 times [2025-03-09 06:56:15,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:15,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228226036] [2025-03-09 06:56:15,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:15,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:15,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:56:15,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:56:15,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:15,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:15,371 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:15,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:56:15,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:56:15,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:15,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:15,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:15,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:15,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1215, now seen corresponding path program 2 times [2025-03-09 06:56:15,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:15,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502362193] [2025-03-09 06:56:15,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:56:15,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:15,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:15,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:15,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:56:15,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:15,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:15,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:15,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:15,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:15,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:15,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:15,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1420884914, now seen corresponding path program 1 times [2025-03-09 06:56:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:56:15,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302816858] [2025-03-09 06:56:15,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:56:15,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:56:15,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:56:15,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:56:15,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:15,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:15,415 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:56:15,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:56:15,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:56:15,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:15,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:56:15,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:56:15,872 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:56:15,873 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:56:15,873 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:56:15,873 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:56:15,873 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:56:15,873 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:15,873 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:56:15,874 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:56:15,874 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcpy_reverse_alloca.i_Iteration2_Lasso [2025-03-09 06:56:15,874 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:56:15,874 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:56:15,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:15,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:15,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:15,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:56:16,625 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:56:16,627 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:56:16,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 06:56:16,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:16,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:16,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:16,655 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-09 06:56:16,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 06:56:16,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:16,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:16,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:16,680 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 06:56:16,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,687 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 06:56:16,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:16,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:56:16,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:16,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-09 06:56:16,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 06:56:16,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:16,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:16,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-09 06:56:16,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 06:56:16,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:16,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:16,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:16,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,778 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 06:56:16,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:56:16,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,800 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 06:56:16,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,804 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 06:56:16,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:56:16,810 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:56:16,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-09 06:56:16,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,826 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 06:56:16,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:56:16,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:56:16,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:56:16,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:56:16,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:56:16,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:56:16,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:56:16,867 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:56:16,896 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-09 06:56:16,898 INFO L444 ModelExtractionUtils]: 5 out of 25 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-03-09 06:56:16,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:56:16,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:56:16,904 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:56:16,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 06:56:16,907 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:56:16,919 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:56:16,919 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:56:16,919 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc211#1.base)_1, ULTIMATE.start_cstrcpy_~dst~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc211#1.base)_1 + 2*ULTIMATE.start_cstrcpy_~dst~0#1.offset Supporting invariants [] [2025-03-09 06:56:16,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-09 06:56:16,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 06:56:16,965 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 06:56:16,971 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 06:56:16,971 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 06:56:16,973 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~dst~0!offset [2025-03-09 06:56:16,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:56:17,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:56:17,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:56:17,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:17,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:17,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:56:17,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:17,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 06:56:17,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 06:56:17,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:56:17,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:56:17,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:56:17,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:56:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:56:17,077 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:56:17,078 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:17,112 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 9 states and 10 transitions. Complement of second has 4 states. [2025-03-09 06:56:17,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:56:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:56:17,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-09 06:56:17,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-09 06:56:17,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:17,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-09 06:56:17,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:17,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-09 06:56:17,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:56:17,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2025-03-09 06:56:17,118 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:56:17,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2025-03-09 06:56:17,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 06:56:17,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 06:56:17,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 06:56:17,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:56:17,118 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:56:17,119 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:56:17,119 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:56:17,119 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:56:17,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 06:56:17,119 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:56:17,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 06:56:17,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:56:17 BoogieIcfgContainer [2025-03-09 06:56:17,125 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:56:17,126 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:56:17,126 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:56:17,126 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:56:17,126 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:56:14" (3/4) ... [2025-03-09 06:56:17,128 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 06:56:17,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:56:17,129 INFO L158 Benchmark]: Toolchain (without parser) took 3272.46ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 114.5MB in the end (delta: 8.3MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2025-03-09 06:56:17,130 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:56:17,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.62ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 104.3MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:56:17,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.20ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 103.4MB in the end (delta: 936.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:56:17,130 INFO L158 Benchmark]: Boogie Preprocessor took 24.47ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 101.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:56:17,130 INFO L158 Benchmark]: IcfgBuilder took 218.83ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 88.5MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:56:17,131 INFO L158 Benchmark]: BuchiAutomizer took 2725.78ms. Allocated memory is still 167.8MB. Free memory was 88.5MB in the beginning and 115.9MB in the end (delta: -27.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:56:17,131 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 114.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:56:17,132 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.22ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.62ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 104.3MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.20ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 103.4MB in the end (delta: 936.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.47ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 101.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 218.83ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 88.5MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 2725.78ms. Allocated memory is still 167.8MB. Free memory was 88.5MB in the beginning and 115.9MB in the end (delta: -27.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 114.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. 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: ~dst~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 24 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital166 mio100 ax100 hnf100 lsp100 ukn92 mio100 lsp48 div205 bol100 ite100 ukn100 eq157 hnf93 smp65 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-09 06:56:17,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE