./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 024b54dcc71a4cff37fb88a3019598a20adbf40036f66c2a7f758cfecaaffadc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:00:48,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:00:49,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:00:49,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:00:49,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:00:49,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:00:49,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:00:49,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:00:49,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:00:49,035 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:00:49,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:00:49,036 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:00:49,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:00:49,036 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:00:49,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:00:49,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:00:49,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:00:49,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:00:49,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:00:49,037 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:00:49,037 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 024b54dcc71a4cff37fb88a3019598a20adbf40036f66c2a7f758cfecaaffadc [2025-01-10 07:00:49,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:00:49,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:00:49,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:00:49,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:00:49,250 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:00:49,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c [2025-01-10 07:00:50,366 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83843cf46/7d62c284fe7c4e26a3ffab31763463bf/FLAGf79421647 [2025-01-10 07:00:50,550 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:00:50,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c [2025-01-10 07:00:50,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83843cf46/7d62c284fe7c4e26a3ffab31763463bf/FLAGf79421647 [2025-01-10 07:00:50,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83843cf46/7d62c284fe7c4e26a3ffab31763463bf [2025-01-10 07:00:50,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:00:50,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:00:50,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:00:50,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:00:50,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:00:50,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:00:50" (1/1) ... [2025-01-10 07:00:50,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78316de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:50, skipping insertion in model container [2025-01-10 07:00:50,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:00:50" (1/1) ... [2025-01-10 07:00:50,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:00:51,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:00:51,025 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:00:51,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:00:51,040 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:00:51,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:51 WrapperNode [2025-01-10 07:00:51,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:00:51,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:00:51,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:00:51,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:00:51,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:51" (1/1) ... [2025-01-10 07:00:51,051 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:51" (1/1) ... [2025-01-10 07:00:51,060 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2025-01-10 07:00:51,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:00:51,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:00:51,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:00:51,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:00:51,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:51" (1/1) ... [2025-01-10 07:00:51,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:51" (1/1) ... [2025-01-10 07:00:51,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:51" (1/1) ... [2025-01-10 07:00:51,072 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 07:00:51,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:51" (1/1) ... [2025-01-10 07:00:51,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:51" (1/1) ... [2025-01-10 07:00:51,073 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:51" (1/1) ... [2025-01-10 07:00:51,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:51" (1/1) ... [2025-01-10 07:00:51,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:51" (1/1) ... [2025-01-10 07:00:51,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:51" (1/1) ... [2025-01-10 07:00:51,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:51" (1/1) ... [2025-01-10 07:00:51,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:00:51,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:00:51,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:00:51,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:00:51,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:51" (1/1) ... [2025-01-10 07:00:51,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:51,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:51,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:51,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:00:51,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:00:51,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:00:51,176 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:00:51,178 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:00:51,216 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-01-10 07:00:51,216 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:00:51,224 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:00:51,224 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:00:51,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:00:51 BoogieIcfgContainer [2025-01-10 07:00:51,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:00:51,225 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:00:51,226 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:00:51,229 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:00:51,230 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:00:51,230 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:00:50" (1/3) ... [2025-01-10 07:00:51,230 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27010992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:00:51, skipping insertion in model container [2025-01-10 07:00:51,231 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:00:51,231 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:00:51" (2/3) ... [2025-01-10 07:00:51,231 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27010992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:00:51, skipping insertion in model container [2025-01-10 07:00:51,231 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:00:51,231 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:00:51" (3/3) ... [2025-01-10 07:00:51,232 INFO L363 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-wise.c [2025-01-10 07:00:51,269 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:00:51,270 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:00:51,270 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:00:51,270 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:00:51,270 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:00:51,271 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:00:51,271 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:00:51,271 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:00:51,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:51,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:00:51,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:00:51,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:00:51,287 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:00:51,287 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:00:51,288 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:00:51,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:51,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:00:51,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:00:51,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:00:51,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:00:51,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:00:51,294 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_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~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_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;" [2025-01-10 07:00:51,294 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2;" "assume main_~x~0#1 < main_~y~0#1;main_~x~0#1 := 1 + main_~x~0#1;" [2025-01-10 07:00:51,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:51,298 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2025-01-10 07:00:51,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:51,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262503562] [2025-01-10 07:00:51,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:51,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:51,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:00:51,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:00:51,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:51,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:51,353 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:51,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:00:51,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:00:51,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:51,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:51,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:51,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:51,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1252, now seen corresponding path program 1 times [2025-01-10 07:00:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:51,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106218648] [2025-01-10 07:00:51,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:51,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:51,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:51,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:51,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:51,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:51,383 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:51,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:51,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:51,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:51,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:51,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:51,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:51,389 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2025-01-10 07:00:51,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:51,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547950765] [2025-01-10 07:00:51,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:51,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:51,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:00:51,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:00:51,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:51,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:51,395 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:51,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:00:51,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:00:51,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:51,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:51,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:51,447 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:00:51,448 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:00:51,448 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:00:51,448 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:00:51,448 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:00:51,448 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:51,448 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:00:51,448 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:00:51,449 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration1_Loop [2025-01-10 07:00:51,449 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:00:51,449 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:00:51,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:51,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:51,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:51,535 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:00:51,535 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:00:51,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:51,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:51,539 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:51,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:00:51,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:00:51,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:00:51,561 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:00:51,561 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:00:51,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:00:51,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:51,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:51,570 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:51,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:00:51,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:00:51,572 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:00:51,589 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:00:51,589 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:00:51,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:00:51,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:51,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:51,596 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:51,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:00:51,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:00:51,598 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:00:51,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-01-10 07:00:51,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:51,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:51,617 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:51,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:00:51,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:00:51,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:00:51,681 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:00:51,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:00:51,686 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:00:51,686 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:00:51,686 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:00:51,686 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:00:51,686 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:00:51,686 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:51,686 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:00:51,686 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:00:51,686 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration1_Loop [2025-01-10 07:00:51,686 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:00:51,687 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:00:51,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:51,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:51,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:51,728 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:00:51,731 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:00:51,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:51,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:51,733 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:51,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:00:51,736 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-01-10 07:00:51,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:51,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:51,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:51,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:51,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:00:51,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:00:51,756 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:00:51,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-01-10 07:00:51,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:51,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:51,764 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:51,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:00:51,765 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-01-10 07:00:51,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:51,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:51,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:51,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:51,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:00:51,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:00:51,781 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:00:51,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 07:00:51,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:51,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:51,792 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:51,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:00:51,794 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-01-10 07:00:51,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:51,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:00:51,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:51,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:51,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:51,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:00:51,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:00:51,809 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:00:51,816 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-01-10 07:00:51,818 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:00:51,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:51,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:51,822 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:51,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:00:51,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:00:51,824 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:00:51,824 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:00:51,825 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~y~0#1 - 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-01-10 07:00:51,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-01-10 07:00:51,833 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:00:51,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:51,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:00:51,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:00:51,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:51,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:51,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:00:51,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:51,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:51,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:51,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:51,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:51,876 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:00:51,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:51,942 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-01-10 07:00:51,944 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-01-10 07:00:51,982 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 18 states and 23 transitions. Complement of second has 5 states. [2025-01-10 07:00:51,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:00:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-01-10 07:00:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-01-10 07:00:51,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 3 letters. Loop has 2 letters. [2025-01-10 07:00:51,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:51,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2025-01-10 07:00:51,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:51,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2025-01-10 07:00:51,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:51,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2025-01-10 07:00:51,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:00:52,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 9 states and 12 transitions. [2025-01-10 07:00:52,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 07:00:52,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-01-10 07:00:52,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2025-01-10 07:00:52,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:00:52,001 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-01-10 07:00:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2025-01-10 07:00:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-01-10 07:00:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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-01-10 07:00:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2025-01-10 07:00:52,016 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-01-10 07:00:52,016 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-01-10 07:00:52,016 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:00:52,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2025-01-10 07:00:52,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:00:52,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:00:52,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:00:52,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 07:00:52,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:00:52,017 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_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~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_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;" "assume main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2;" "assume !(main_~x~0#1 < main_~y~0#1);main_~y~0#1 := 1 + main_~y~0#1;" [2025-01-10 07:00:52,017 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2;" "assume main_~x~0#1 < main_~y~0#1;main_~x~0#1 := 1 + main_~x~0#1;" [2025-01-10 07:00:52,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:52,018 INFO L85 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2025-01-10 07:00:52,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:52,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793736695] [2025-01-10 07:00:52,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:52,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:52,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:00:52,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:00:52,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:52,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:52,023 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:52,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:00:52,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:00:52,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:52,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:52,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:52,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:52,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1252, now seen corresponding path program 2 times [2025-01-10 07:00:52,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:52,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236179445] [2025-01-10 07:00:52,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:00:52,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:52,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:52,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:52,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:00:52,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:52,034 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:52,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:52,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:52,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:52,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:52,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:52,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:52,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1804968106, now seen corresponding path program 1 times [2025-01-10 07:00:52,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:52,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817398793] [2025-01-10 07:00:52,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:52,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:52,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:00:52,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:00:52,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:52,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:52,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:00:52,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817398793] [2025-01-10 07:00:52,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817398793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:00:52,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:00:52,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:00:52,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107946559] [2025-01-10 07:00:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:00:52,136 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:00:52,136 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:00:52,136 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:00:52,136 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:00:52,136 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:00:52,136 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:52,136 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:00:52,136 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:00:52,136 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration2_Loop [2025-01-10 07:00:52,136 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:00:52,136 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:00:52,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:52,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:52,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:52,183 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:00:52,183 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:00:52,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:52,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:52,185 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:52,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:00:52,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:00:52,188 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:00:52,205 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:00:52,205 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:00:52,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-01-10 07:00:52,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:52,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:52,212 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:52,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:00:52,214 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:00:52,214 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:00:52,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 07:00:52,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:52,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:52,231 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:52,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:00:52,233 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:00:52,233 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:00:52,296 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:00:52,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-01-10 07:00:52,301 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:00:52,301 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:00:52,301 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:00:52,301 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:00:52,301 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:00:52,301 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:52,301 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:00:52,301 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:00:52,301 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration2_Loop [2025-01-10 07:00:52,301 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:00:52,301 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:00:52,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:52,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:52,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:52,336 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:00:52,336 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:00:52,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:52,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:52,339 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:52,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:00:52,342 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-01-10 07:00:52,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:52,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:00:52,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:52,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:52,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:52,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:00:52,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:00:52,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-01-10 07:00:52,368 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:00:52,374 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-01-10 07:00:52,374 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:00:52,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:52,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:52,376 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:52,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:00:52,381 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:00:52,381 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:00:52,382 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:00:52,382 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~y~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2025-01-10 07:00:52,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-01-10 07:00:52,388 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:00:52,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:52,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:00:52,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:00:52,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:52,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:52,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:00:52,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:52,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:52,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:52,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:52,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:52,417 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:00:52,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:52,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:52,440 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-01-10 07:00:52,440 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:52,457 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 18 transitions. Complement of second has 5 states. [2025-01-10 07:00:52,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:00:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-01-10 07:00:52,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2025-01-10 07:00:52,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:52,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 2 letters. [2025-01-10 07:00:52,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:52,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 4 letters. [2025-01-10 07:00:52,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:52,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2025-01-10 07:00:52,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:00:52,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 18 transitions. [2025-01-10 07:00:52,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-01-10 07:00:52,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-01-10 07:00:52,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2025-01-10 07:00:52,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:00:52,460 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-01-10 07:00:52,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2025-01-10 07:00:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-01-10 07:00:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-01-10 07:00:52,462 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-01-10 07:00:52,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:00:52,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:00:52,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:00:52,466 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:00:52,489 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2025-01-10 07:00:52,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2025-01-10 07:00:52,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:00:52,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 11 states and 13 transitions. [2025-01-10 07:00:52,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 07:00:52,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-01-10 07:00:52,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2025-01-10 07:00:52,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:00:52,492 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 07:00:52,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2025-01-10 07:00:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2025-01-10 07:00:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 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-01-10 07:00:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2025-01-10 07:00:52,493 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-01-10 07:00:52,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:00:52,494 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-01-10 07:00:52,495 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:00:52,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2025-01-10 07:00:52,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:00:52,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:00:52,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:00:52,495 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:00:52,496 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:00:52,496 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_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~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_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;" "assume main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2;" [2025-01-10 07:00:52,496 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~x~0#1 < main_~y~0#1);main_~y~0#1 := 1 + main_~y~0#1;" "assume main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2;" [2025-01-10 07:00:52,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:52,496 INFO L85 PathProgramCache]: Analyzing trace with hash 925607, now seen corresponding path program 1 times [2025-01-10 07:00:52,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:52,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373998409] [2025-01-10 07:00:52,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:52,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:52,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:00:52,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:00:52,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:52,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:52,504 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:52,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:00:52,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:00:52,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:52,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:52,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:52,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:52,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1404, now seen corresponding path program 1 times [2025-01-10 07:00:52,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:52,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236085767] [2025-01-10 07:00:52,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:00:52,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:52,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:52,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:52,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:52,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:52,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:52,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:52,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:52,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:52,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:52,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:52,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:52,521 INFO L85 PathProgramCache]: Analyzing trace with hash 889508770, now seen corresponding path program 2 times [2025-01-10 07:00:52,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:52,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903469861] [2025-01-10 07:00:52,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:00:52,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:52,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-01-10 07:00:52,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:00:52,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:00:52,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:52,536 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:52,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:00:52,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:00:52,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:52,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:52,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:52,568 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:00:52,568 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:00:52,568 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:00:52,568 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:00:52,569 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:00:52,569 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:52,569 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:00:52,569 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:00:52,569 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration3_Loop [2025-01-10 07:00:52,569 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:00:52,569 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:00:52,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:52,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:52,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:52,608 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:00:52,609 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:00:52,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:52,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:52,611 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:52,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 07:00:52,614 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:00:52,614 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:00:52,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-01-10 07:00:52,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:52,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:52,633 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:52,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 07:00:52,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:00:52,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:00:52,716 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:00:52,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-01-10 07:00:52,721 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:00:52,721 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:00:52,721 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:00:52,721 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:00:52,721 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:00:52,721 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:52,721 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:00:52,721 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:00:52,722 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration3_Loop [2025-01-10 07:00:52,722 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:00:52,722 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:00:52,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:52,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:52,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:52,756 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:00:52,757 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:00:52,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:52,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:52,759 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:52,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-01-10 07:00:52,761 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-01-10 07:00:52,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:52,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:00:52,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:52,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:52,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:52,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:00:52,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:00:52,775 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:00:52,777 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:00:52,777 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:00:52,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:52,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:52,780 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:52,781 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:00:52,781 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:00:52,781 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:00:52,782 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2025-01-10 07:00:52,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-01-10 07:00:52,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-01-10 07:00:52,788 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:00:52,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:52,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:00:52,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:00:52,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:52,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:52,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:00:52,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:52,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:52,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:52,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:52,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:52,809 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:00:52,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:52,835 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-01-10 07:00:52,835 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 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-01-10 07:00:52,848 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 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 13 states and 15 transitions. Complement of second has 5 states. [2025-01-10 07:00:52,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:00:52,850 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-01-10 07:00:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-01-10 07:00:52,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2025-01-10 07:00:52,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:52,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-01-10 07:00:52,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:52,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2025-01-10 07:00:52,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:52,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2025-01-10 07:00:52,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:00:52,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 10 transitions. [2025-01-10 07:00:52,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 07:00:52,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-01-10 07:00:52,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2025-01-10 07:00:52,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:00:52,851 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-01-10 07:00:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2025-01-10 07:00:52,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-01-10 07:00:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 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-01-10 07:00:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-01-10 07:00:52,852 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-01-10 07:00:52,852 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-01-10 07:00:52,852 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:00:52,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2025-01-10 07:00:52,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:00:52,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:00:52,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:00:52,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2025-01-10 07:00:52,852 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:00:52,853 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_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~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_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0;" "assume main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2;" "assume main_~x~0#1 < main_~y~0#1;main_~x~0#1 := 1 + main_~x~0#1;" "assume main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2;" [2025-01-10 07:00:52,853 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~x~0#1 < main_~y~0#1);main_~y~0#1 := 1 + main_~y~0#1;" "assume main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2;" [2025-01-10 07:00:52,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash 889508708, now seen corresponding path program 2 times [2025-01-10 07:00:52,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:52,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259500710] [2025-01-10 07:00:52,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:00:52,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:52,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-01-10 07:00:52,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:00:52,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:00:52,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:52,863 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:52,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:00:52,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:00:52,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:52,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:52,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:52,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:52,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1404, now seen corresponding path program 2 times [2025-01-10 07:00:52,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:52,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26592406] [2025-01-10 07:00:52,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:00:52,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:52,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:52,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:52,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:00:52,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:52,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:52,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:52,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:52,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:52,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:52,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:52,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:52,876 INFO L85 PathProgramCache]: Analyzing trace with hash 119376927, now seen corresponding path program 2 times [2025-01-10 07:00:52,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:52,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618537049] [2025-01-10 07:00:52,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:00:52,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:52,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-01-10 07:00:52,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:00:52,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:00:52,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:52,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:00:52,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618537049] [2025-01-10 07:00:52,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618537049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:00:52,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:00:52,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:00:52,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165171] [2025-01-10 07:00:52,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:00:52,943 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:00:52,943 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:00:52,943 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:00:52,943 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:00:52,943 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:00:52,943 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:52,943 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:00:52,943 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:00:52,944 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration4_Loop [2025-01-10 07:00:52,944 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:00:52,944 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:00:52,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:52,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:52,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:52,975 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:00:52,976 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:00:52,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:52,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:52,978 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:52,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-01-10 07:00:52,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:00:52,980 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:00:52,999 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:00:52,999 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:00:53,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-01-10 07:00:53,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:53,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:53,007 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:53,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-01-10 07:00:53,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:00:53,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:00:53,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-01-10 07:00:53,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:53,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:53,030 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:53,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-01-10 07:00:53,032 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:00:53,032 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:00:53,123 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:00:53,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-01-10 07:00:53,129 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:00:53,129 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:00:53,129 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:00:53,129 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:00:53,129 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:00:53,129 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:53,129 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:00:53,129 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:00:53,129 INFO L132 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration4_Loop [2025-01-10 07:00:53,129 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:00:53,129 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:00:53,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:53,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:53,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:00:53,169 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:00:53,169 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:00:53,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:53,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:53,171 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:53,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-01-10 07:00:53,174 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-01-10 07:00:53,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:00:53,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:00:53,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:00:53,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:00:53,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:00:53,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:00:53,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:00:53,187 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:00:53,192 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-01-10 07:00:53,192 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:00:53,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:00:53,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:53,195 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:00:53,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-01-10 07:00:53,196 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:00:53,196 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:00:53,196 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:00:53,196 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~y~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-01-10 07:00:53,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-01-10 07:00:53,203 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:00:53,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:53,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:00:53,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:00:53,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:53,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:53,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:00:53,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:53,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:53,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:53,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:53,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:53,232 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:00:53,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:53,249 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-01-10 07:00:53,249 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:53,256 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 10 transitions. Complement of second has 3 states. [2025-01-10 07:00:53,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 07:00:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2025-01-10 07:00:53,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 6 letters. Loop has 2 letters. [2025-01-10 07:00:53,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:53,259 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:00:53,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:53,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:00:53,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:00:53,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:53,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:53,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:00:53,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:53,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:53,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:53,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:53,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:53,283 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:00:53,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:53,299 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-01-10 07:00:53,299 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:53,304 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 10 transitions. Complement of second has 3 states. [2025-01-10 07:00:53,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 07:00:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2025-01-10 07:00:53,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 6 letters. Loop has 2 letters. [2025-01-10 07:00:53,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:53,305 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:00:53,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:53,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:00:53,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:00:53,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:53,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:53,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:00:53,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:53,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:00:53,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:00:53,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:53,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:53,327 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:00:53,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:00:53,338 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-01-10 07:00:53,338 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:53,349 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 10 states and 11 transitions. Complement of second has 4 states. [2025-01-10 07:00:53,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:00:53,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:53,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2025-01-10 07:00:53,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 2 letters. [2025-01-10 07:00:53,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:53,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 2 letters. [2025-01-10 07:00:53,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:53,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2025-01-10 07:00:53,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:00:53,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2025-01-10 07:00:53,353 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:00:53,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2025-01-10 07:00:53,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:00:53,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:00:53,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:00:53,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:00:53,353 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:00:53,353 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:00:53,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:00:53,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:00:53,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:00:53,354 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:00:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:00:53,354 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-01-10 07:00:53,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-01-10 07:00:53,354 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:00:53,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 07:00:53,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:00:53,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:00:53,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:00:53,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:00:53,354 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:00:53,354 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:00:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 07:00:53,354 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:00:53,354 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:00:53,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 07:00:53,354 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:00:53,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 07:00:53,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:00:53 BoogieIcfgContainer [2025-01-10 07:00:53,361 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:00:53,362 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:00:53,362 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:00:53,362 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:00:53,362 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:00:51" (3/4) ... [2025-01-10 07:00:53,364 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 07:00:53,364 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:00:53,365 INFO L158 Benchmark]: Toolchain (without parser) took 2444.89ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 65.2MB in the end (delta: 57.8MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2025-01-10 07:00:53,365 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:00:53,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 121.43ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 113.1MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:00:53,365 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.16ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 112.1MB in the end (delta: 984.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:00:53,366 INFO L158 Benchmark]: Boogie Preprocessor took 18.46ms. Allocated memory is still 167.8MB. Free memory is still 112.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:00:53,366 INFO L158 Benchmark]: RCFGBuilder took 144.03ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 102.2MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:00:53,366 INFO L158 Benchmark]: BuchiAutomizer took 2136.05ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 66.0MB in the end (delta: 36.2MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2025-01-10 07:00:53,366 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 167.8MB. Free memory was 66.0MB in the beginning and 65.2MB in the end (delta: 811.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:00:53,367 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 121.43ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 113.1MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.16ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 112.1MB in the end (delta: 984.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.46ms. Allocated memory is still 167.8MB. Free memory is still 112.1MB. There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 144.03ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 102.2MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 2136.05ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 66.0MB in the end (delta: 36.2MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 167.8MB. Free memory was 66.0MB in the beginning and 65.2MB in the end (delta: 811.1kB). 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 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (y + ((long) -1 * x)) and consists of 3 locations. One deterministic module has affine ranking function (y + ((long) -1 * x)) and consists of 3 locations. One deterministic module has affine ranking function (((long) -1 * y) + x) and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -1 * y) + x) and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 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 [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 35 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax200 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-01-10 07:00:53,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-01-10 07:00:53,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-01-10 07:00:53,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-01-10 07:00:53,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE