./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-bwb/not-01.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 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-bwb/not-01.c -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 3dfbe8f5341b447680f0727714aef9849c6c8cbf32af0f88458cc80db5d02e27 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:49:48,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:49:48,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:49:48,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:49:48,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:49:48,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:49:48,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:49:48,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:49:48,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:49:48,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:49:48,931 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:49:48,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:49:48,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:49:48,932 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:49:48,932 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:49:48,932 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:49:48,933 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:49:48,933 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:49:48,933 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:49:48,933 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:49:48,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:49:48,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:49:48,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:49:48,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:49:48,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:49:48,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:49:48,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:49:48,933 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:49:48,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:49:48,934 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:49:48,934 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:49:48,934 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:49:48,934 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:49:48,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:49:48,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:49:48,934 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:49:48,935 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:49:48,935 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 -> 3dfbe8f5341b447680f0727714aef9849c6c8cbf32af0f88458cc80db5d02e27 [2025-03-17 19:49:49,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:49:49,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:49:49,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:49:49,149 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:49:49,150 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:49:49,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-bwb/not-01.c [2025-03-17 19:49:50,327 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6edaa79e7/29ca7f8ac84a4a0d93f36893bdc5cade/FLAG43cf07f80 [2025-03-17 19:49:50,502 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:49:50,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-bwb/not-01.c [2025-03-17 19:49:50,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6edaa79e7/29ca7f8ac84a4a0d93f36893bdc5cade/FLAG43cf07f80 [2025-03-17 19:49:50,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6edaa79e7/29ca7f8ac84a4a0d93f36893bdc5cade [2025-03-17 19:49:50,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:49:50,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:49:50,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:49:50,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:49:50,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:49:50,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:49:50" (1/1) ... [2025-03-17 19:49:50,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a7381e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:50, skipping insertion in model container [2025-03-17 19:49:50,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:49:50" (1/1) ... [2025-03-17 19:49:50,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:49:50,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:49:50,653 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:49:50,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:49:50,669 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:49:50,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:50 WrapperNode [2025-03-17 19:49:50,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:49:50,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:49:50,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:49:50,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:49:50,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:50" (1/1) ... [2025-03-17 19:49:50,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:50" (1/1) ... [2025-03-17 19:49:50,685 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 15 [2025-03-17 19:49:50,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:49:50,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:49:50,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:49:50,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:49:50,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:50" (1/1) ... [2025-03-17 19:49:50,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:50" (1/1) ... [2025-03-17 19:49:50,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:50" (1/1) ... [2025-03-17 19:49:50,694 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 19:49:50,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:50" (1/1) ... [2025-03-17 19:49:50,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:50" (1/1) ... [2025-03-17 19:49:50,696 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:50" (1/1) ... [2025-03-17 19:49:50,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:50" (1/1) ... [2025-03-17 19:49:50,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:50" (1/1) ... [2025-03-17 19:49:50,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:50" (1/1) ... [2025-03-17 19:49:50,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:49:50,699 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:49:50,699 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:49:50,700 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:49:50,700 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:50" (1/1) ... [2025-03-17 19:49:50,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:50,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:50,726 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-17 19:49:50,729 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-17 19:49:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:49:50,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:49:50,785 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:49:50,787 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:49:50,857 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-03-17 19:49:50,857 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:49:50,864 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:49:50,864 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:49:50,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:49:50 BoogieIcfgContainer [2025-03-17 19:49:50,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:49:50,865 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:49:50,866 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:49:50,869 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:49:50,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:49:50,870 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:49:50" (1/3) ... [2025-03-17 19:49:50,871 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6110693b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:49:50, skipping insertion in model container [2025-03-17 19:49:50,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:49:50,872 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:49:50" (2/3) ... [2025-03-17 19:49:50,872 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6110693b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:49:50, skipping insertion in model container [2025-03-17 19:49:50,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:49:50,873 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:49:50" (3/3) ... [2025-03-17 19:49:50,874 INFO L363 chiAutomizerObserver]: Analyzing ICFG not-01.c [2025-03-17 19:49:50,916 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:49:50,917 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:49:50,917 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:49:50,918 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:49:50,918 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:49:50,919 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:49:50,919 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:49:50,919 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:49:50,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-17 19:49:50,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:49:50,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:50,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:50,937 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:49:50,937 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:49:50,938 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:49:50,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-17 19:49:50,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:49:50,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:50,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:50,939 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 19:49:50,939 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:49:50,945 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~a~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2025-03-17 19:49:50,945 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 > 0;main_~a~0#1 := -1 - main_~a~0#1;" "assume main_~a~0#1 > 0;main_~x~0#1 := main_~x~0#1 - main_~a~0#1;" [2025-03-17 19:49:50,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:50,949 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 1 times [2025-03-17 19:49:50,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:50,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633656434] [2025-03-17 19:49:50,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:50,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:50,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:51,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:51,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,003 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:51,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:51,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:51,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:51,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:51,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1055, now seen corresponding path program 1 times [2025-03-17 19:49:51,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:51,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98249129] [2025-03-17 19:49:51,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:51,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:51,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:51,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:51,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,038 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:51,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:51,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:51,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:51,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:51,049 INFO L85 PathProgramCache]: Analyzing trace with hash 33729, now seen corresponding path program 1 times [2025-03-17 19:49:51,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:51,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193461658] [2025-03-17 19:49:51,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:51,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:51,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:49:51,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:49:51,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:51,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:49:51,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:49:51,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:51,145 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:51,145 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:51,145 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:51,145 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:51,146 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:49:51,146 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:51,146 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:51,146 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:51,146 INFO L132 ssoRankerPreferences]: Filename of dumped script: not-01.c_Iteration1_Loop [2025-03-17 19:49:51,146 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:51,146 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:51,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:51,206 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:49:51,206 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:49:51,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:51,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:51,210 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-17 19:49:51,212 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-17 19:49:51,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:49:51,213 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:51,230 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-17 19:49:51,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:51,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:51,233 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-17 19:49:51,233 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-17 19:49:51,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:49:51,234 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:51,278 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:49:51,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:51,283 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:51,283 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:51,283 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:51,283 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:51,283 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:49:51,283 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:51,283 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:51,283 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:51,283 INFO L132 ssoRankerPreferences]: Filename of dumped script: not-01.c_Iteration1_Loop [2025-03-17 19:49:51,283 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:51,283 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:51,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:51,322 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:49:51,325 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:49:51,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:51,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:51,327 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-17 19:49:51,329 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-17 19:49:51,329 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-17 19:49:51,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:49:51,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:49:51,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:49:51,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:49:51,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:49:51,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:49:51,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:49:51,351 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:49:51,355 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-17 19:49:51,357 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 19:49:51,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:51,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:51,359 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-17 19:49:51,361 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-17 19:49:51,362 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:49:51,362 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:49:51,363 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:49:51,363 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-03-17 19:49:51,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:51,371 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:49:51,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:51,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 19:49:51,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 19:49:51,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:51,401 WARN L254 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:49:51,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:51,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:51,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:51,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:51,407 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:49:51,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:51,429 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-17 19:49:51,446 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:49:51,448 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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-17 19:49:51,485 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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 11 states and 16 transitions. Complement of second has 7 states. [2025-03-17 19:49:51,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:49:51,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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-17 19:49:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2025-03-17 19:49:51,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 1 letters. Loop has 2 letters. [2025-03-17 19:49:51,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:51,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 3 letters. Loop has 2 letters. [2025-03-17 19:49:51,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:51,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 1 letters. Loop has 4 letters. [2025-03-17 19:49:51,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:51,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2025-03-17 19:49:51,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:49:51,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 8 states and 11 transitions. [2025-03-17 19:49:51,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-17 19:49:51,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-03-17 19:49:51,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2025-03-17 19:49:51,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:49:51,501 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-17 19:49:51,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2025-03-17 19:49:51,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2025-03-17 19:49:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-17 19:49:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2025-03-17 19:49:51,520 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 10 transitions. [2025-03-17 19:49:51,520 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2025-03-17 19:49:51,520 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:49:51,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2025-03-17 19:49:51,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:49:51,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:51,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:51,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-17 19:49:51,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:49:51,521 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~a~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume main_~x~0#1 > 0;main_~a~0#1 := -1 - main_~a~0#1;" [2025-03-17 19:49:51,521 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~a~0#1 > 0);main_~x~0#1 := main_~x~0#1 + main_~a~0#1;" "assume main_~x~0#1 > 0;main_~a~0#1 := -1 - main_~a~0#1;" [2025-03-17 19:49:51,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:51,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1088, now seen corresponding path program 1 times [2025-03-17 19:49:51,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:51,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204295337] [2025-03-17 19:49:51,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:51,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:51,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:51,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:51,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,525 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:51,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:51,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:51,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:51,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:51,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1026, now seen corresponding path program 1 times [2025-03-17 19:49:51,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:51,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370113647] [2025-03-17 19:49:51,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:51,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:51,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:51,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:51,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,529 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:51,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:51,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:51,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:51,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1045633, now seen corresponding path program 1 times [2025-03-17 19:49:51,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:51,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26263694] [2025-03-17 19:49:51,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:51,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:51,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:51,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:51,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,543 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:51,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:51,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:51,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:51,576 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:51,576 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:51,576 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:51,576 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:51,577 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:49:51,577 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:51,577 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:51,577 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:51,577 INFO L132 ssoRankerPreferences]: Filename of dumped script: not-01.c_Iteration2_Loop [2025-03-17 19:49:51,577 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:51,577 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:51,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:51,614 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:49:51,614 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:49:51,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:51,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:51,617 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-17 19:49:51,618 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-17 19:49:51,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:49:51,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:51,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-17 19:49:51,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:51,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:51,640 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-17 19:49:51,640 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-17 19:49:51,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:49:51,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:51,674 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:49:51,678 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-17 19:49:51,678 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:51,678 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:51,678 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:51,678 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:51,678 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:49:51,678 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:51,678 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:51,678 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:51,678 INFO L132 ssoRankerPreferences]: Filename of dumped script: not-01.c_Iteration2_Loop [2025-03-17 19:49:51,678 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:51,678 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:51,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:51,708 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:49:51,709 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:49:51,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:51,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:51,711 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-17 19:49:51,712 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-17 19:49:51,713 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-17 19:49:51,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:49:51,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:49:51,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:49:51,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:49:51,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:49:51,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:49:51,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:49:51,727 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:49:51,730 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-03-17 19:49:51,730 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:49:51,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:51,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:51,732 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-17 19:49:51,734 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-17 19:49:51,735 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:49:51,735 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:49:51,735 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:49:51,735 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~a~0#1) = 2*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~a~0#1 Supporting invariants [] [2025-03-17 19:49:51,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:51,742 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:49:51,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:51,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:51,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:51,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:51,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:49:51,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:51,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:51,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:51,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:51,768 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:49:51,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:51,839 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-17 19:49:51,847 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-17 19:49:51,847 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:49:51,848 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:49:51,850 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-17 19:49:51,867 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 22 transitions. Complement of second has 7 states. [2025-03-17 19:49:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:49:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:49:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2025-03-17 19:49:51,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-17 19:49:51,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:51,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-17 19:49:51,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:51,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-17 19:49:51,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:51,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2025-03-17 19:49:51,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:49:51,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 10 states and 14 transitions. [2025-03-17 19:49:51,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-17 19:49:51,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-03-17 19:49:51,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-03-17 19:49:51,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:49:51,871 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-17 19:49:51,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-03-17 19:49:51,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2025-03-17 19:49:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:49:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2025-03-17 19:49:51,871 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2025-03-17 19:49:51,871 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2025-03-17 19:49:51,871 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:49:51,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2025-03-17 19:49:51,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 19:49:51,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:49:51,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:49:51,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1] [2025-03-17 19:49:51,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:49:51,872 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~a~0#1, main_~x~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume main_~x~0#1 > 0;main_~a~0#1 := -1 - main_~a~0#1;" "assume main_~a~0#1 > 0;main_~x~0#1 := main_~x~0#1 - main_~a~0#1;" "assume main_~x~0#1 > 0;main_~a~0#1 := -1 - main_~a~0#1;" [2025-03-17 19:49:51,872 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~a~0#1 > 0);main_~x~0#1 := main_~x~0#1 + main_~a~0#1;" "assume main_~x~0#1 > 0;main_~a~0#1 := -1 - main_~a~0#1;" [2025-03-17 19:49:51,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:51,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1045602, now seen corresponding path program 2 times [2025-03-17 19:49:51,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:51,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606511577] [2025-03-17 19:49:51,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:49:51,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:51,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 2 equivalence classes. [2025-03-17 19:49:51,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:51,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:49:51,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,880 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:51,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:51,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:51,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:51,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:51,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1026, now seen corresponding path program 2 times [2025-03-17 19:49:51,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:51,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212613385] [2025-03-17 19:49:51,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:49:51,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:51,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:51,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:51,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:49:51,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:51,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:51,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:51,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:51,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:51,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1004823587, now seen corresponding path program 1 times [2025-03-17 19:49:51,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:49:51,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231751733] [2025-03-17 19:49:51,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:49:51,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:49:51,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:49:51,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:49:51,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:49:51,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:49:51,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:49:51,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:51,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:49:51,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:49:51,933 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:51,933 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:51,933 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:51,933 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:51,933 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 19:49:51,933 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:51,933 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:51,933 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:51,933 INFO L132 ssoRankerPreferences]: Filename of dumped script: not-01.c_Iteration3_Loop [2025-03-17 19:49:51,933 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:51,933 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:51,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:51,967 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:49:51,967 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 19:49:51,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:51,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:51,969 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-17 19:49:51,971 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-17 19:49:51,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 19:49:51,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:51,989 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-17 19:49:51,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:51,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:51,991 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-17 19:49:51,991 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-17 19:49:51,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 19:49:51,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 19:49:52,029 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 19:49:52,035 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-17 19:49:52,035 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:49:52,035 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:49:52,035 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:49:52,035 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:49:52,035 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:49:52,035 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:52,035 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:49:52,035 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:49:52,035 INFO L132 ssoRankerPreferences]: Filename of dumped script: not-01.c_Iteration3_Loop [2025-03-17 19:49:52,035 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:49:52,036 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:49:52,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:49:52,063 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:49:52,063 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:49:52,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:52,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:52,065 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-17 19:49:52,067 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-17 19:49:52,068 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-17 19:49:52,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:49:52,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:49:52,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:49:52,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:49:52,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:49:52,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:49:52,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:49:52,085 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:49:52,089 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 19:49:52,090 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-17 19:49:52,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:49:52,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:49:52,092 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-17 19:49:52,093 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-17 19:49:52,094 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:49:52,094 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 19:49:52,094 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:49:52,094 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~a~0#1) = 2*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~a~0#1 Supporting invariants [] [2025-03-17 19:49:52,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-17 19:49:52,102 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 19:49:52,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:52,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:52,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:52,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:52,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:52,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:49:52,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:52,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:52,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:52,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:52,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:52,135 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:49:52,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:52,154 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-17 19:49:52,154 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:49:52,154 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 19:49:52,176 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 12 states and 16 transitions. Complement of second has 7 states. [2025-03-17 19:49:52,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:49:52,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 19:49:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2025-03-17 19:49:52,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-17 19:49:52,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:52,178 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:49:52,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:52,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:52,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:52,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:52,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:52,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:49:52,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:52,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:52,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:52,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:52,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:52,199 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:49:52,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:52,214 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-17 19:49:52,215 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:49:52,215 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 19:49:52,239 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 12 states and 16 transitions. Complement of second has 7 states. [2025-03-17 19:49:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:49:52,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 19:49:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2025-03-17 19:49:52,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-17 19:49:52,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:52,242 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:49:52,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:49:52,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:49:52,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:49:52,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:52,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:52,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:49:52,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:52,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:49:52,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:49:52,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:49:52,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:49:52,289 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:49:52,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:49:52,312 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-17 19:49:52,312 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:49:52,313 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 19:49:52,329 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 11 states and 14 transitions. Complement of second has 6 states. [2025-03-17 19:49:52,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 19:49:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 19:49:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-03-17 19:49:52,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-17 19:49:52,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:52,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-17 19:49:52,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:52,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-17 19:49:52,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:49:52,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2025-03-17 19:49:52,331 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:49:52,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2025-03-17 19:49:52,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 19:49:52,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 19:49:52,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 19:49:52,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:49:52,331 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:49:52,331 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:49:52,331 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:49:52,331 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:49:52,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 19:49:52,331 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:49:52,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 19:49:52,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:49:52 BoogieIcfgContainer [2025-03-17 19:49:52,337 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:49:52,337 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:49:52,337 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:49:52,338 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:49:52,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:49:50" (3/4) ... [2025-03-17 19:49:52,342 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 19:49:52,352 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:49:52,353 INFO L158 Benchmark]: Toolchain (without parser) took 1821.42ms. Allocated memory was 503.3MB in the beginning and 142.6MB in the end (delta: -360.7MB). Free memory was 468.7MB in the beginning and 75.6MB in the end (delta: 393.1MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2025-03-17 19:49:52,353 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:49:52,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 137.43ms. Allocated memory was 503.3MB in the beginning and 142.6MB in the end (delta: -360.7MB). Free memory was 468.7MB in the beginning and 97.5MB in the end (delta: 371.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:49:52,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 14.97ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 96.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:49:52,354 INFO L158 Benchmark]: Boogie Preprocessor took 12.78ms. Allocated memory is still 142.6MB. Free memory is still 96.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:49:52,354 INFO L158 Benchmark]: IcfgBuilder took 165.92ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 86.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:49:52,354 INFO L158 Benchmark]: BuchiAutomizer took 1471.56ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 75.7MB in the end (delta: 10.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2025-03-17 19:49:52,354 INFO L158 Benchmark]: Witness Printer took 14.83ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 75.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:49:52,357 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 137.43ms. Allocated memory was 503.3MB in the beginning and 142.6MB in the end (delta: -360.7MB). Free memory was 468.7MB in the beginning and 97.5MB in the end (delta: 371.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 14.97ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 96.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.78ms. Allocated memory is still 142.6MB. Free memory is still 96.2MB. There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 165.92ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 86.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 1471.56ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 75.7MB in the end (delta: 10.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Witness Printer took 14.83ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 75.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function (((long) 2 * x) + a) and consists of 4 locations. One nondeterministic module has affine ranking function (((long) 2 * x) + a) and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 11 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq168 hnf93 smp100 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 37ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 19:49:52,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-17 19:49:52,569 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