./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/subseq-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 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-memory-alloca/subseq-alloca-1.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 ae37599e398d4579dc13aa902332f9c984a4acd0674bb835a0d1e4887393314e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:41:06,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:41:06,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:41:06,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:41:06,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:41:06,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:41:06,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:41:06,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:41:06,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:41:06,368 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:41:06,368 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:41:06,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:41:06,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:41:06,369 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:41:06,369 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:41:06,369 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:41:06,369 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:41:06,369 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:41:06,369 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:41:06,369 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:41:06,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:41:06,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:41:06,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:41:06,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:41:06,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:41:06,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:41:06,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:41:06,370 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:41:06,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:41:06,370 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:41:06,370 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:41:06,370 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:41:06,370 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:41:06,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:41:06,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:41:06,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:41:06,371 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:41:06,371 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 -> ae37599e398d4579dc13aa902332f9c984a4acd0674bb835a0d1e4887393314e [2025-03-04 15:41:06,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:41:06,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:41:06,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:41:06,617 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:41:06,617 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:41:06,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/subseq-alloca-1.i [2025-03-04 15:41:07,813 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d234e4ca3/69adfd36bdb6489ab34737700405f20d/FLAG49092f10e [2025-03-04 15:41:08,086 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:41:08,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/subseq-alloca-1.i [2025-03-04 15:41:08,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d234e4ca3/69adfd36bdb6489ab34737700405f20d/FLAG49092f10e [2025-03-04 15:41:08,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d234e4ca3/69adfd36bdb6489ab34737700405f20d [2025-03-04 15:41:08,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:41:08,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:41:08,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:41:08,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:41:08,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:41:08,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:41:08" (1/1) ... [2025-03-04 15:41:08,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aedfc49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:41:08, skipping insertion in model container [2025-03-04 15:41:08,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:41:08" (1/1) ... [2025-03-04 15:41:08,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:41:08,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:41:08,639 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:41:08,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:41:08,693 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:41:08,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:41:08 WrapperNode [2025-03-04 15:41:08,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:41:08,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:41:08,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:41:08,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:41:08,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:41:08" (1/1) ... [2025-03-04 15:41:08,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:41:08" (1/1) ... [2025-03-04 15:41:08,721 INFO L138 Inliner]: procedures = 111, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2025-03-04 15:41:08,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:41:08,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:41:08,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:41:08,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:41:08,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:41:08" (1/1) ... [2025-03-04 15:41:08,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:41:08" (1/1) ... [2025-03-04 15:41:08,730 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:41:08" (1/1) ... [2025-03-04 15:41:08,738 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [4, 3]. 57 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-04 15:41:08,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:41:08" (1/1) ... [2025-03-04 15:41:08,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:41:08" (1/1) ... [2025-03-04 15:41:08,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:41:08" (1/1) ... [2025-03-04 15:41:08,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:41:08" (1/1) ... [2025-03-04 15:41:08,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:41:08" (1/1) ... [2025-03-04 15:41:08,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:41:08" (1/1) ... [2025-03-04 15:41:08,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:41:08,744 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:41:08,744 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:41:08,744 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:41:08,745 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:41:08" (1/1) ... [2025-03-04 15:41:08,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:41:08,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:41:08,765 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-04 15:41:08,767 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-04 15:41:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:41:08,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:41:08,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:41:08,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:41:08,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:41:08,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:41:08,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:41:08,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:41:08,860 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:41:08,861 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:41:08,977 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L573: havoc main_#t~ret14#1;call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; [2025-03-04 15:41:08,991 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-04 15:41:08,992 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:41:09,002 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:41:09,003 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:41:09,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:41:09 BoogieIcfgContainer [2025-03-04 15:41:09,003 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:41:09,004 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:41:09,004 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:41:09,008 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:41:09,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:41:09,009 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:41:08" (1/3) ... [2025-03-04 15:41:09,010 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3782444e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:41:09, skipping insertion in model container [2025-03-04 15:41:09,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:41:09,011 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:41:08" (2/3) ... [2025-03-04 15:41:09,012 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3782444e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:41:09, skipping insertion in model container [2025-03-04 15:41:09,012 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:41:09,012 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:41:09" (3/3) ... [2025-03-04 15:41:09,013 INFO L363 chiAutomizerObserver]: Analyzing ICFG subseq-alloca-1.i [2025-03-04 15:41:09,048 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:41:09,048 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:41:09,048 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:41:09,049 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:41:09,049 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:41:09,049 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:41:09,049 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:41:09,050 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:41:09,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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-03-04 15:41:09,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:41:09,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:41:09,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:41:09,069 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:41:09,069 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:41:09,069 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:41:09,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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-03-04 15:41:09,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:41:09,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:41:09,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:41:09,072 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:41:09,072 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:41:09,076 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~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~ret14#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet10#1;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_subseq } true;subseq_#in~s#1.base, subseq_#in~s#1.offset, subseq_#in~t#1.base, subseq_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc subseq_#res#1;havoc subseq_#t~mem2#1, subseq_#t~mem3#1, subseq_#t~short4#1, subseq_#t~mem5#1, subseq_#t~mem6#1, subseq_#t~post7#1.base, subseq_#t~post7#1.offset, subseq_#t~post8#1.base, subseq_#t~post8#1.offset, subseq_#t~mem9#1, subseq_~s#1.base, subseq_~s#1.offset, subseq_~t#1.base, subseq_~t#1.offset, subseq_~ps~0#1.base, subseq_~ps~0#1.offset, subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~s#1.base, subseq_~s#1.offset := subseq_#in~s#1.base, subseq_#in~s#1.offset;subseq_~t#1.base, subseq_~t#1.offset := subseq_#in~t#1.base, subseq_#in~t#1.offset;subseq_~ps~0#1.base, subseq_~ps~0#1.offset := subseq_~s#1.base, subseq_~s#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_~t#1.base, subseq_~t#1.offset;" [2025-03-04 15:41:09,076 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call subseq_#t~mem2#1 := read~int#1(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem2#1;" "assume subseq_#t~short4#1;call subseq_#t~mem3#1 := read~int#0(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem3#1;" "assume subseq_#t~short4#1;havoc subseq_#t~mem2#1;havoc subseq_#t~mem3#1;havoc subseq_#t~short4#1;call subseq_#t~mem5#1 := read~int#1(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);call subseq_#t~mem6#1 := read~int#0(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1);" "assume subseq_#t~mem5#1 == subseq_#t~mem6#1;havoc subseq_#t~mem5#1;havoc subseq_#t~mem6#1;subseq_#t~post7#1.base, subseq_#t~post7#1.offset := subseq_~ps~0#1.base, subseq_~ps~0#1.offset;subseq_~ps~0#1.base, subseq_~ps~0#1.offset := subseq_#t~post7#1.base, 1 + subseq_#t~post7#1.offset;havoc subseq_#t~post7#1.base, subseq_#t~post7#1.offset;" "subseq_#t~post8#1.base, subseq_#t~post8#1.offset := subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_#t~post8#1.base, 1 + subseq_#t~post8#1.offset;havoc subseq_#t~post8#1.base, subseq_#t~post8#1.offset;" [2025-03-04 15:41:09,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:41:09,080 INFO L85 PathProgramCache]: Analyzing trace with hash 53409238, now seen corresponding path program 1 times [2025-03-04 15:41:09,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:41:09,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523865777] [2025-03-04 15:41:09,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:41:09,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:41:09,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:41:09,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:41:09,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:09,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:41:09,183 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:41:09,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:41:09,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:41:09,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:09,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:41:09,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:41:09,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:41:09,231 INFO L85 PathProgramCache]: Analyzing trace with hash 45743919, now seen corresponding path program 1 times [2025-03-04 15:41:09,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:41:09,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765735534] [2025-03-04 15:41:09,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:41:09,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:41:09,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:41:09,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:41:09,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:09,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:41:09,251 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:41:09,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:41:09,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:41:09,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:09,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:41:09,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:41:09,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:41:09,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1259628154, now seen corresponding path program 1 times [2025-03-04 15:41:09,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:41:09,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848092951] [2025-03-04 15:41:09,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:41:09,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:41:09,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:41:09,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:41:09,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:09,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:41:09,323 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:41:09,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:41:09,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:41:09,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:09,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:41:09,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:41:10,137 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:41:10,138 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:41:10,138 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:41:10,138 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:41:10,139 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:41:10,139 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:41:10,139 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:41:10,139 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:41:10,139 INFO L132 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-1.i_Iteration1_Lasso [2025-03-04 15:41:10,140 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:41:10,140 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:41:10,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:10,708 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:41:10,711 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:41:10,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:41:10,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:41:10,714 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-04 15:41:10,716 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-04 15:41:10,716 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-04 15:41:10,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:41:10,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:41:10,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:41:10,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:41:10,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:41:10,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:41:10,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:41:10,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:41:10,738 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-04 15:41:10,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:41:10,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:41:10,741 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-04 15:41:10,742 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-04 15:41:10,743 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-04 15:41:10,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:41:10,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:41:10,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:41:10,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:41:10,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:41:10,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:41:10,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:41:10,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:41:10,760 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-04 15:41:10,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:41:10,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:41:10,762 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-04 15:41:10,762 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-04 15:41:10,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:41:10,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:41:10,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:41:10,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:41:10,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:41:10,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:41:10,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:41:10,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:41:10,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:41:10,780 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-04 15:41:10,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:41:10,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:41:10,782 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-04 15:41:10,782 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-04 15:41:10,783 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-04 15:41:10,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:41:10,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:41:10,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:41:10,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:41:10,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:41:10,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:41:10,808 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:41:10,837 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-04 15:41:10,839 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-04 15:41:10,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:41:10,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:41:10,842 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-04 15:41:10,844 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-04 15:41:10,845 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:41:10,856 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:41:10,856 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:41:10,857 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_1, ULTIMATE.start_subseq_~ps~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_1 - 1*ULTIMATE.start_subseq_~ps~0#1.offset Supporting invariants [] [2025-03-04 15:41:10,863 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-04 15:41:10,886 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-04 15:41:10,892 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ps~0!offset [2025-03-04 15:41:10,893 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:41:10,893 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:41:10,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:41:10,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:41:10,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:41:10,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:10,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:41:10,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:41:10,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:41:10,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:41:10,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:41:10,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:10,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:41:10,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:41:10,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:41:11,008 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-04 15:41:11,024 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:41:11,025 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-03-04 15:41:11,077 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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). Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Result 35 states and 48 transitions. Complement of second has 8 states. [2025-03-04 15:41:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:41:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-03-04 15:41:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2025-03-04 15:41:11,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 5 letters. [2025-03-04 15:41:11,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:41:11,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 10 letters. Loop has 5 letters. [2025-03-04 15:41:11,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:41:11,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 10 letters. [2025-03-04 15:41:11,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:41:11,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 48 transitions. [2025-03-04 15:41:11,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:41:11,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 20 states and 28 transitions. [2025-03-04 15:41:11,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:41:11,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-04 15:41:11,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2025-03-04 15:41:11,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:41:11,096 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2025-03-04 15:41:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2025-03-04 15:41:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2025-03-04 15:41:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:41:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2025-03-04 15:41:11,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-04 15:41:11,112 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-03-04 15:41:11,113 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:41:11,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2025-03-04 15:41:11,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:41:11,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:41:11,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:41:11,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:41:11,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:41:11,114 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~nondet10#1, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~ret14#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet10#1;main_~length1~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;main_~length2~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_subseq } true;subseq_#in~s#1.base, subseq_#in~s#1.offset, subseq_#in~t#1.base, subseq_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc subseq_#res#1;havoc subseq_#t~mem2#1, subseq_#t~mem3#1, subseq_#t~short4#1, subseq_#t~mem5#1, subseq_#t~mem6#1, subseq_#t~post7#1.base, subseq_#t~post7#1.offset, subseq_#t~post8#1.base, subseq_#t~post8#1.offset, subseq_#t~mem9#1, subseq_~s#1.base, subseq_~s#1.offset, subseq_~t#1.base, subseq_~t#1.offset, subseq_~ps~0#1.base, subseq_~ps~0#1.offset, subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~s#1.base, subseq_~s#1.offset := subseq_#in~s#1.base, subseq_#in~s#1.offset;subseq_~t#1.base, subseq_~t#1.offset := subseq_#in~t#1.base, subseq_#in~t#1.offset;subseq_~ps~0#1.base, subseq_~ps~0#1.offset := subseq_~s#1.base, subseq_~s#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_~t#1.base, subseq_~t#1.offset;" "assume true;call subseq_#t~mem2#1 := read~int#1(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem2#1;" [2025-03-04 15:41:11,114 INFO L754 eck$LassoCheckResult]: Loop: "assume subseq_#t~short4#1;call subseq_#t~mem3#1 := read~int#0(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem3#1;" "assume subseq_#t~short4#1;havoc subseq_#t~mem2#1;havoc subseq_#t~mem3#1;havoc subseq_#t~short4#1;call subseq_#t~mem5#1 := read~int#1(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);call subseq_#t~mem6#1 := read~int#0(subseq_~pt~0#1.base, subseq_~pt~0#1.offset, 1);" "assume !(subseq_#t~mem5#1 == subseq_#t~mem6#1);havoc subseq_#t~mem5#1;havoc subseq_#t~mem6#1;" "subseq_#t~post8#1.base, subseq_#t~post8#1.offset := subseq_~pt~0#1.base, subseq_~pt~0#1.offset;subseq_~pt~0#1.base, subseq_~pt~0#1.offset := subseq_#t~post8#1.base, 1 + subseq_#t~post8#1.offset;havoc subseq_#t~post8#1.base, subseq_#t~post8#1.offset;" "assume true;call subseq_#t~mem2#1 := read~int#1(subseq_~ps~0#1.base, subseq_~ps~0#1.offset, 1);subseq_#t~short4#1 := 0 != subseq_#t~mem2#1;" [2025-03-04 15:41:11,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:41:11,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1655686396, now seen corresponding path program 1 times [2025-03-04 15:41:11,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:41:11,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157012137] [2025-03-04 15:41:11,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:41:11,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:41:11,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:41:11,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:41:11,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:11,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:41:11,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:41:11,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:41:11,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:41:11,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:11,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:41:11,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:41:11,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:41:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash 43863220, now seen corresponding path program 1 times [2025-03-04 15:41:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:41:11,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352274783] [2025-03-04 15:41:11,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:41:11,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:41:11,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:41:11,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:41:11,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:11,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:41:11,169 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:41:11,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:41:11,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:41:11,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:11,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:41:11,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:41:11,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:41:11,176 INFO L85 PathProgramCache]: Analyzing trace with hash 393768089, now seen corresponding path program 1 times [2025-03-04 15:41:11,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:41:11,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508096608] [2025-03-04 15:41:11,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:41:11,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:41:11,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:41:11,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:41:11,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:11,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:41:11,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:41:11,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:41:11,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:41:11,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:11,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:41:11,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:41:11,358 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-04 15:41:11,940 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:41:11,940 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:41:11,940 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:41:11,940 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:41:11,940 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:41:11,940 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:41:11,940 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:41:11,940 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:41:11,940 INFO L132 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-1.i_Iteration2_Lasso [2025-03-04 15:41:11,940 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:41:11,940 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:41:11,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:11,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:11,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:11,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:41:12,579 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:41:12,580 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:41:12,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:41:12,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:41:12,582 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-04 15:41:12,583 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-04 15:41:12,584 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-04 15:41:12,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:41:12,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:41:12,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:41:12,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:41:12,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:41:12,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:41:12,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:41:12,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:41:12,601 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-04 15:41:12,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:41:12,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:41:12,604 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-04 15:41:12,605 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-04 15:41:12,607 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-04 15:41:12,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:41:12,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:41:12,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:41:12,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:41:12,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:41:12,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:41:12,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:41:12,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:41:12,623 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-04 15:41:12,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:41:12,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:41:12,625 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-04 15:41:12,625 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-04 15:41:12,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:41:12,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:41:12,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:41:12,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:41:12,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:41:12,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:41:12,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:41:12,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:41:12,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:41:12,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 15:41:12,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:41:12,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:41:12,649 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:41:12,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 15:41:12,650 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-04 15:41:12,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:41:12,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:41:12,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:41:12,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:41:12,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:41:12,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:41:12,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:41:12,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-04 15:41:12,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:41:12,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:41:12,679 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:41:12,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 15:41:12,682 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-04 15:41:12,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:41:12,692 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-03-04 15:41:12,692 INFO L204 nArgumentSynthesizer]: 8 loop disjuncts [2025-03-04 15:41:12,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:41:12,759 INFO L401 nArgumentSynthesizer]: We have 192 Motzkin's Theorem applications. [2025-03-04 15:41:12,759 INFO L402 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2025-03-04 15:41:12,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:41:12,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-04 15:41:12,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:41:12,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:41:12,886 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:41:12,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 15:41:12,888 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-04 15:41:12,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:41:12,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:41:12,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:41:12,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:41:12,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:41:12,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:41:12,908 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:41:12,927 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-04 15:41:12,927 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-04 15:41:12,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:41:12,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:41:12,930 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:41:12,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 15:41:12,932 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:41:12,942 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:41:12,942 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:41:12,943 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_subseq_~pt~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_2) = -1*ULTIMATE.start_subseq_~pt~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_2 Supporting invariants [] [2025-03-04 15:41:12,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 15:41:12,969 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-04 15:41:12,971 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:41:12,971 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:41:12,971 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pt~0!offset [2025-03-04 15:41:12,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:41:12,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:41:13,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:41:13,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:13,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:41:13,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:41:13,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:41:13,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:41:13,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:41:13,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:41:13,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:41:13,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:41:13,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:41:13,085 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-04 15:41:13,085 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-04 15:41:13,086 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:41:13,120 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 51 transitions. Complement of second has 7 states. [2025-03-04 15:41:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:41:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:41:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2025-03-04 15:41:13,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 6 letters. Loop has 5 letters. [2025-03-04 15:41:13,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:41:13,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 5 letters. [2025-03-04 15:41:13,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:41:13,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 6 letters. Loop has 10 letters. [2025-03-04 15:41:13,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:41:13,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2025-03-04 15:41:13,123 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:41:13,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2025-03-04 15:41:13,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:41:13,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:41:13,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:41:13,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:41:13,124 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:41:13,124 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:41:13,124 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:41:13,124 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:41:13,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:41:13,124 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:41:13,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:41:13,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:41:13 BoogieIcfgContainer [2025-03-04 15:41:13,134 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:41:13,135 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:41:13,135 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:41:13,135 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:41:13,135 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:41:09" (3/4) ... [2025-03-04 15:41:13,137 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:41:13,137 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:41:13,138 INFO L158 Benchmark]: Toolchain (without parser) took 4748.71ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 69.2MB in the end (delta: 52.3MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2025-03-04 15:41:13,138 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:41:13,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.59ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 105.0MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:41:13,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.13ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 103.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:41:13,139 INFO L158 Benchmark]: Boogie Preprocessor took 21.10ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 102.2MB in the end (delta: 943.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:41:13,139 INFO L158 Benchmark]: IcfgBuilder took 259.11ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 87.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:41:13,139 INFO L158 Benchmark]: BuchiAutomizer took 4130.43ms. Allocated memory is still 167.8MB. Free memory was 87.3MB in the beginning and 69.2MB in the end (delta: 18.0MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2025-03-04 15:41:13,139 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 167.8MB. Free memory was 69.2MB in the beginning and 69.2MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:41:13,140 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.14ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.59ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 105.0MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.13ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 103.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.10ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 102.2MB in the end (delta: 943.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 259.11ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 87.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 4130.43ms. Allocated memory is still 167.8MB. Free memory was 87.3MB in the beginning and 69.2MB in the end (delta: 18.0MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 167.8MB. Free memory was 69.2MB in the beginning and 69.2MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ps~0!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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pt~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 (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 25 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital225 mio100 ax108 hnf100 lsp92 ukn71 mio100 lsp24 div100 bol103 ite100 ukn100 eq155 hnf95 smp100 dnf402 smp64 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 199ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 3 DisjunctsLoop: 8 SupportingInvariants: 16 MotzkinApplications: 192 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-04 15:41:13,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:41:13,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE