./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_22.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/NO_22.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 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:20:40,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:20:40,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-08 14:20:41,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:20:41,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:20:41,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:20:41,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:20:41,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:20:41,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:20:41,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:20:41,015 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:20:41,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:20:41,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:20:41,016 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:20:41,016 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:20:41,016 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:20:41,016 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:20:41,016 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:20:41,016 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:20:41,016 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:20:41,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:20:41,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:20:41,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:20:41,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:20:41,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:20:41,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:20:41,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:20:41,017 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:20:41,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:20:41,017 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:20:41,017 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:20:41,017 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:20:41,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:20:41,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:20:41,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:20:41,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:20:41,018 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:20:41,018 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 -> 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 [2025-02-08 14:20:41,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:20:41,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:20:41,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:20:41,231 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:20:41,233 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:20:41,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_22.c [2025-02-08 14:20:42,336 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c242acae5/0995915ae00847989af04873bd3264a7/FLAG537bc07c1 [2025-02-08 14:20:42,583 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:20:42,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_22.c [2025-02-08 14:20:42,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c242acae5/0995915ae00847989af04873bd3264a7/FLAG537bc07c1 [2025-02-08 14:20:42,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c242acae5/0995915ae00847989af04873bd3264a7 [2025-02-08 14:20:42,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:20:42,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:20:42,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:20:42,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:20:42,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:20:42,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:20:42" (1/1) ... [2025-02-08 14:20:42,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7436d962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:42, skipping insertion in model container [2025-02-08 14:20:42,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:20:42" (1/1) ... [2025-02-08 14:20:42,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:20:42,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:20:42,748 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:20:42,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:20:42,762 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:20:42,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:42 WrapperNode [2025-02-08 14:20:42,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:20:42,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:20:42,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:20:42,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:20:42,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:42" (1/1) ... [2025-02-08 14:20:42,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:42" (1/1) ... [2025-02-08 14:20:42,776 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 10 [2025-02-08 14:20:42,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:20:42,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:20:42,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:20:42,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:20:42,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:42" (1/1) ... [2025-02-08 14:20:42,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:42" (1/1) ... [2025-02-08 14:20:42,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:42" (1/1) ... [2025-02-08 14:20:42,785 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 14:20:42,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:42" (1/1) ... [2025-02-08 14:20:42,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:42" (1/1) ... [2025-02-08 14:20:42,786 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:42" (1/1) ... [2025-02-08 14:20:42,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:42" (1/1) ... [2025-02-08 14:20:42,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:42" (1/1) ... [2025-02-08 14:20:42,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:42" (1/1) ... [2025-02-08 14:20:42,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:20:42,788 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:20:42,788 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:20:42,789 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:20:42,790 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:42" (1/1) ... [2025-02-08 14:20:42,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:42,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:42,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:42,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:20:42,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:20:42,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:20:42,879 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:20:42,880 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:20:42,930 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-02-08 14:20:42,931 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:20:42,936 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:20:42,936 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:20:42,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:20:42 BoogieIcfgContainer [2025-02-08 14:20:42,937 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:20:42,938 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:20:42,938 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:20:42,942 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:20:42,942 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:20:42,942 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:20:42" (1/3) ... [2025-02-08 14:20:42,943 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59820562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:20:42, skipping insertion in model container [2025-02-08 14:20:42,943 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:20:42,943 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:20:42" (2/3) ... [2025-02-08 14:20:42,944 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59820562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:20:42, skipping insertion in model container [2025-02-08 14:20:42,944 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:20:42,944 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:20:42" (3/3) ... [2025-02-08 14:20:42,945 INFO L363 chiAutomizerObserver]: Analyzing ICFG NO_22.c [2025-02-08 14:20:42,977 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:20:42,977 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:20:42,977 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:20:42,977 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:20:42,977 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:20:42,977 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:20:42,978 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:20:42,978 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:20:42,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:42,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:20:42,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:42,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:42,992 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:20:42,992 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:20:42,992 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:20:42,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:42,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:20:42,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:42,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:42,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:20:42,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:20:42,997 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" [2025-02-08 14:20:42,997 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-08 14:20:43,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash 35, now seen corresponding path program 1 times [2025-02-08 14:20:43,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:43,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860738339] [2025-02-08 14:20:43,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:43,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:43,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:20:43,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:20:43,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:43,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:43,047 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:43,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:20:43,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:20:43,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:43,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:43,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:43,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:43,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1055, now seen corresponding path program 1 times [2025-02-08 14:20:43,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:43,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218806181] [2025-02-08 14:20:43,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:43,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:43,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:43,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:43,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:43,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:43,063 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:43,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:43,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:43,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:43,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:43,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:43,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash 33729, now seen corresponding path program 1 times [2025-02-08 14:20:43,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:43,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121951991] [2025-02-08 14:20:43,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:43,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:43,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:20:43,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:20:43,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:43,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:43,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:43,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:20:43,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:20:43,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:43,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:43,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:43,109 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:43,111 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:43,112 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:43,112 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:43,112 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:20:43,112 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,112 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:43,112 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:43,112 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2025-02-08 14:20:43,112 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:43,112 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:43,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:43,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:43,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:43,201 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:43,203 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:20:43,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-08 14:20:43,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:43,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:43,236 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:20:43,237 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-02-08 14:20:43,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:43,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-08 14:20:43,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:43,251 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:43,271 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:20:43,271 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-02-08 14:20:43,281 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-02-08 14:20:43,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,283 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-08 14:20:43,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:43,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:43,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:43,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,310 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-08 14:20:43,313 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:20:43,313 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:43,336 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:20:43,340 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-02-08 14:20:43,340 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:43,340 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:43,340 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:43,340 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:43,340 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:20:43,340 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,340 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:43,340 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:43,340 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2025-02-08 14:20:43,340 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:43,340 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:43,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:43,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:43,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:43,381 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:43,384 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:20:43,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,387 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-08 14:20:43,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:43,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:43,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:43,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:43,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:43,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:20:43,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:20:43,410 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:20:43,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-08 14:20:43,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,418 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-08 14:20:43,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:43,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:43,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:43,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:43,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:43,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:20:43,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:20:43,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:20:43,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-08 14:20:43,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,444 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-08 14:20:43,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:43,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:43,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:20:43,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:43,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:43,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:43,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:20:43,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:20:43,460 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:20:43,463 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:20:43,465 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:20:43,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,468 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-08 14:20:43,473 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:20:43,473 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:20:43,473 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:20:43,474 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2025-02-08 14:20:43,479 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-02-08 14:20:43,486 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:20:43,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:43,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:20:43,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:20:43,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:43,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:43,511 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:20:43,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:43,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:43,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:43,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:43,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:43,516 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:20:43,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:43,537 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-08 14:20:43,538 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:43,561 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 10 states and 15 transitions. Complement of second has 5 states. [2025-02-08 14:20:43,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-08 14:20:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2025-02-08 14:20:43,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2025-02-08 14:20:43,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:43,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-08 14:20:43,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:43,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2025-02-08 14:20:43,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:43,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 15 transitions. [2025-02-08 14:20:43,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:20:43,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 7 states and 10 transitions. [2025-02-08 14:20:43,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-02-08 14:20:43,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-02-08 14:20:43,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2025-02-08 14:20:43,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:43,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 10 transitions. [2025-02-08 14:20:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2025-02-08 14:20:43,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-02-08 14:20:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2025-02-08 14:20:43,590 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 10 transitions. [2025-02-08 14:20:43,590 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2025-02-08 14:20:43,590 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:20:43,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2025-02-08 14:20:43,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:20:43,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:43,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:43,591 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:20:43,591 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:20:43,591 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 100;" "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" [2025-02-08 14:20:43,591 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-08 14:20:43,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:43,592 INFO L85 PathProgramCache]: Analyzing trace with hash 33730, now seen corresponding path program 1 times [2025-02-08 14:20:43,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:43,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167938056] [2025-02-08 14:20:43,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:43,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:43,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:20:43,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:20:43,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:43,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:43,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:43,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167938056] [2025-02-08 14:20:43,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167938056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:20:43,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:20:43,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:20:43,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065514136] [2025-02-08 14:20:43,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:20:43,621 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:20:43,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:43,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1055, now seen corresponding path program 2 times [2025-02-08 14:20:43,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:43,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730304075] [2025-02-08 14:20:43,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:20:43,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:43,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:43,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:43,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:20:43,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:43,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:43,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:43,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:43,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:43,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:43,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:43,648 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:43,648 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:43,648 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:43,648 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:43,648 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:20:43,648 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,648 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:43,648 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:43,648 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2025-02-08 14:20:43,648 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:43,648 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:43,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:43,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:43,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:43,687 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:43,687 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:20:43,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,694 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-08 14:20:43,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:43,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:43,734 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:20:43,735 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-02-08 14:20:43,740 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-02-08 14:20:43,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,743 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-08 14:20:43,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:43,745 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:43,764 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:20:43,764 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:20:43,770 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-02-08 14:20:43,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,772 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-08 14:20:43,791 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:43,791 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:43,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-08 14:20:43,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:43,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,821 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-08 14:20:43,827 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:20:43,827 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:43,852 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:20:43,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:43,856 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:43,856 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:43,856 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:43,856 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:43,856 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:20:43,856 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,856 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:43,856 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:43,857 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2025-02-08 14:20:43,857 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:43,857 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:43,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:43,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:43,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:43,898 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:43,899 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:20:43,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,901 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-08 14:20:43,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:43,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:43,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:43,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:43,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:43,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:20:43,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:20:43,920 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:20:43,927 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-02-08 14:20:43,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,930 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:43,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-08 14:20:43,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:43,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:43,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:43,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:43,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:20:43,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:20:43,951 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:20:43,956 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-02-08 14:20:43,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,958 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-08 14:20:43,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:43,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:43,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:20:43,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:43,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:43,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:43,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:20:43,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:20:43,974 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:20:43,976 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:20:43,976 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:20:43,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:43,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:43,979 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:43,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-08 14:20:43,984 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:20:43,984 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:20:43,984 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:20:43,984 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2025-02-08 14:20:43,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:43,994 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:20:44,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:44,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:20:44,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:20:44,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:44,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:44,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,027 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:44,030 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-08 14:20:44,030 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 1.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-02-08 14:20:44,040 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 1.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 11 states and 16 transitions. Complement of second has 5 states. [2025-02-08 14:20:44,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-08 14:20:44,041 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-02-08 14:20:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-02-08 14:20:44,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-08 14:20:44,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:44,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-08 14:20:44,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:44,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-08 14:20:44,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:44,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2025-02-08 14:20:44,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:20:44,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2025-02-08 14:20:44,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-02-08 14:20:44,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-02-08 14:20:44,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2025-02-08 14:20:44,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:44,046 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-02-08 14:20:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2025-02-08 14:20:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-08 14:20:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2025-02-08 14:20:44,047 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-02-08 14:20:44,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:20:44,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:20:44,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:20:44,050 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:20:44,057 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2025-02-08 14:20:44,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2025-02-08 14:20:44,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:20:44,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2025-02-08 14:20:44,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-02-08 14:20:44,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-02-08 14:20:44,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2025-02-08 14:20:44,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:44,057 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-02-08 14:20:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2025-02-08 14:20:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-02-08 14:20:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2025-02-08 14:20:44,058 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-02-08 14:20:44,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:20:44,060 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-02-08 14:20:44,060 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:20:44,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2025-02-08 14:20:44,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-08 14:20:44,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:44,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:44,062 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1] [2025-02-08 14:20:44,062 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:20:44,062 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" [2025-02-08 14:20:44,063 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" [2025-02-08 14:20:44,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1084760127, now seen corresponding path program 1 times [2025-02-08 14:20:44,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:44,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367017966] [2025-02-08 14:20:44,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:44,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:44,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:20:44,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:20:44,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:44,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:44,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367017966] [2025-02-08 14:20:44,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367017966] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:20:44,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448684975] [2025-02-08 14:20:44,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:44,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:20:44,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:44,092 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:20:44,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 14:20:44,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:20:44,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:20:44,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:44,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:20:44,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:44,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448684975] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:20:44,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:20:44,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 14:20:44,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535331302] [2025-02-08 14:20:44,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:20:44,141 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:20:44,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:44,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1055, now seen corresponding path program 3 times [2025-02-08 14:20:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:44,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010071895] [2025-02-08 14:20:44,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:20:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:44,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:44,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:44,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:20:44,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:44,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:44,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:44,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:44,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:44,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:44,158 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:44,158 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:44,158 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:44,158 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:44,159 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:20:44,159 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:44,159 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:44,159 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:44,159 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2025-02-08 14:20:44,159 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:44,159 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:44,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:44,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:44,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:44,190 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:44,190 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:20:44,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:44,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:44,193 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:44,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-08 14:20:44,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:44,196 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:44,213 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-08 14:20:44,213 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-08 14:20:44,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:44,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:44,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:44,221 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-02-08 14:20:44,222 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-02-08 14:20:44,222 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:44,223 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:44,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:44,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:44,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:44,242 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:44,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-08 14:20:44,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:20:44,244 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:44,265 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:20:44,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:44,269 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:44,269 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:44,269 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:44,269 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:44,269 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:20:44,269 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:44,269 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:44,269 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:44,269 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2025-02-08 14:20:44,269 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:44,269 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:44,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:44,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:44,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:44,300 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:44,300 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:20:44,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:44,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:44,302 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:44,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-08 14:20:44,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:44,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:44,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:20:44,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:44,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:44,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:44,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:20:44,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:20:44,317 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:20:44,319 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:20:44,319 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-08 14:20:44,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:44,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:44,321 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:44,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-08 14:20:44,324 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:20:44,324 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:20:44,324 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:20:44,324 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2025-02-08 14:20:44,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-08 14:20:44,329 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:20:44,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:44,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:20:44,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:20:44,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:44,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:44,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,355 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:44,357 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-08 14:20:44,357 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 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-02-08 14:20:44,364 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. 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 19 transitions. Complement of second has 5 states. [2025-02-08 14:20:44,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-08 14:20:44,364 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-02-08 14:20:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-02-08 14:20:44,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-08 14:20:44,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:44,365 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:20:44,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:44,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:20:44,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:20:44,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:44,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:44,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,385 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:44,387 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-08 14:20:44,387 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 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-02-08 14:20:44,392 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. 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 19 transitions. Complement of second has 5 states. [2025-02-08 14:20:44,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-08 14:20:44,393 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-02-08 14:20:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-02-08 14:20:44,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-08 14:20:44,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:44,393 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:20:44,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:44,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:20:44,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:20:44,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:44,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:44,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,414 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:44,416 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 1 loop predicates [2025-02-08 14:20:44,417 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 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-02-08 14:20:44,422 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. 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 15 states and 22 transitions. Complement of second has 4 states. [2025-02-08 14:20:44,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-08 14:20:44,423 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-02-08 14:20:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-02-08 14:20:44,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-08 14:20:44,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:44,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2025-02-08 14:20:44,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:44,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2025-02-08 14:20:44,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:44,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2025-02-08 14:20:44,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:20:44,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 18 transitions. [2025-02-08 14:20:44,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-02-08 14:20:44,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-02-08 14:20:44,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2025-02-08 14:20:44,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:44,425 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-02-08 14:20:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2025-02-08 14:20:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 6. [2025-02-08 14:20:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) 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-02-08 14:20:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2025-02-08 14:20:44,426 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-02-08 14:20:44,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:20:44,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:20:44,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:20:44,426 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-02-08 14:20:44,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:20:44,440 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2025-02-08 14:20:44,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2025-02-08 14:20:44,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:20:44,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 13 states and 15 transitions. [2025-02-08 14:20:44,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-02-08 14:20:44,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-02-08 14:20:44,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2025-02-08 14:20:44,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:44,440 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-02-08 14:20:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2025-02-08 14:20:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-02-08 14:20:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-02-08 14:20:44,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-02-08 14:20:44,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:20:44,442 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-02-08 14:20:44,442 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:20:44,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2025-02-08 14:20:44,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-08 14:20:44,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:44,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:44,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1] [2025-02-08 14:20:44,442 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:20:44,443 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-02-08 14:20:44,443 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" [2025-02-08 14:20:44,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:44,443 INFO L85 PathProgramCache]: Analyzing trace with hash 726352328, now seen corresponding path program 2 times [2025-02-08 14:20:44,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:44,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160464447] [2025-02-08 14:20:44,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:20:44,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:44,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-08 14:20:44,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:20:44,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:20:44,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:44,448 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:44,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:20:44,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:20:44,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:44,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:44,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:44,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1026, now seen corresponding path program 1 times [2025-02-08 14:20:44,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:44,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938827530] [2025-02-08 14:20:44,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:44,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:44,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:44,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:44,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:44,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:44,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:44,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:44,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:44,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:44,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:44,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2055081975, now seen corresponding path program 2 times [2025-02-08 14:20:44,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:44,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379071663] [2025-02-08 14:20:44,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:20:44,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:44,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-08 14:20:44,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:20:44,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:20:44,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:44,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:44,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379071663] [2025-02-08 14:20:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379071663] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:20:44,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578710483] [2025-02-08 14:20:44,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:20:44,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:20:44,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:44,513 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:20:44,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-08 14:20:44,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-08 14:20:44,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:20:44,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:20:44,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:44,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:20:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578710483] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:20:44,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:20:44,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-08 14:20:44,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721573583] [2025-02-08 14:20:44,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:20:44,632 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:44,632 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:44,632 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:44,632 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:44,632 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-08 14:20:44,632 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:44,632 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:44,633 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:44,633 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2025-02-08 14:20:44,633 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:44,633 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:44,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:44,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:44,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:44,671 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:44,672 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-08 14:20:44,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:44,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:44,674 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:44,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-08 14:20:44,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-08 14:20:44,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:44,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-08 14:20:44,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:44,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:44,694 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:44,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-08 14:20:44,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-08 14:20:44,697 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-08 14:20:44,719 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-08 14:20:44,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-08 14:20:44,723 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:20:44,723 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:20:44,723 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:20:44,723 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:20:44,723 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:20:44,723 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:44,723 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:20:44,723 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:20:44,723 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2025-02-08 14:20:44,723 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:20:44,723 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:20:44,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:44,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:44,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:20:44,761 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:20:44,762 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:20:44,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:44,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:44,765 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:44,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-08 14:20:44,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:20:44,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:20:44,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:20:44,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:20:44,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:20:44,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:20:44,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:20:44,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:20:44,784 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:20:44,786 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-08 14:20:44,786 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-08 14:20:44,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:20:44,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:44,794 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:20:44,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-08 14:20:44,822 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:20:44,822 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-08 14:20:44,822 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:20:44,823 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-08 14:20:44,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-08 14:20:44,829 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-08 14:20:44,833 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-02-08 14:20:44,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:44,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:44,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:20:44,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:20:44,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:44,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:44,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,866 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:44,880 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:20:44,880 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 3 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-02-08 14:20:44,883 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 14 transitions. Complement of second has 3 states. [2025-02-08 14:20:44,883 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-02-08 14:20:44,883 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-02-08 14:20:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2025-02-08 14:20:44,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-08 14:20:44,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:44,883 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:20:44,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:44,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:20:44,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:20:44,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:44,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:44,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,904 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:44,914 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-02-08 14:20:44,914 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 3 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-02-08 14:20:44,918 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 14 transitions. Complement of second has 3 states. [2025-02-08 14:20:44,918 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-02-08 14:20:44,918 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-02-08 14:20:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2025-02-08 14:20:44,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-08 14:20:44,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:44,918 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:20:44,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:44,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:20:44,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:20:44,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:20:44,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:20:44,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:44,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:44,946 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:20:44,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:44,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:20:44,957 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-02-08 14:20:44,957 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 3 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-02-08 14:20:44,962 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 3. 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 16 states and 18 transitions. Complement of second has 4 states. [2025-02-08 14:20:44,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-08 14:20:44,963 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-02-08 14:20:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-02-08 14:20:44,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-08 14:20:44,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:44,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2025-02-08 14:20:44,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:44,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 4 letters. [2025-02-08 14:20:44,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:20:44,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2025-02-08 14:20:44,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-08 14:20:44,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 16 transitions. [2025-02-08 14:20:44,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2025-02-08 14:20:44,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2025-02-08 14:20:44,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2025-02-08 14:20:44,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:44,965 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-02-08 14:20:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2025-02-08 14:20:44,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-02-08 14:20:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-02-08 14:20:44,965 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-02-08 14:20:44,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:20:44,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:20:44,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:20:44,966 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:44,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:20:44,992 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-02-08 14:20:44,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2025-02-08 14:20:44,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:20:44,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 28 transitions. [2025-02-08 14:20:44,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2025-02-08 14:20:44,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2025-02-08 14:20:44,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2025-02-08 14:20:44,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:44,993 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-02-08 14:20:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2025-02-08 14:20:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2025-02-08 14:20:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-02-08 14:20:44,994 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-02-08 14:20:44,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:20:44,995 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-02-08 14:20:44,995 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:20:44,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2025-02-08 14:20:44,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:20:44,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:44,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:44,995 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1] [2025-02-08 14:20:44,995 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-02-08 14:20:44,995 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-02-08 14:20:44,995 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-02-08 14:20:44,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:44,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1380397292, now seen corresponding path program 3 times [2025-02-08 14:20:44,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:44,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332198862] [2025-02-08 14:20:44,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:20:44,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:44,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 11 equivalence classes. [2025-02-08 14:20:45,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:20:45,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 14:20:45,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:45,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:45,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 14:20:45,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:20:45,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:45,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:45,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:45,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:45,012 INFO L85 PathProgramCache]: Analyzing trace with hash 986020, now seen corresponding path program 1 times [2025-02-08 14:20:45,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:45,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029604859] [2025-02-08 14:20:45,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:20:45,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:45,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:45,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:45,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:45,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:45,015 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:45,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:45,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:45,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:45,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:45,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:45,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:45,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2010388791, now seen corresponding path program 3 times [2025-02-08 14:20:45,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:45,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806918787] [2025-02-08 14:20:45,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:20:45,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:45,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 13 equivalence classes. [2025-02-08 14:20:45,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 14:20:45,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-08 14:20:45,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:20:45,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:45,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806918787] [2025-02-08 14:20:45,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806918787] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:20:45,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949288664] [2025-02-08 14:20:45,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:20:45,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:20:45,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:45,168 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:20:45,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-02-08 14:20:45,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 13 equivalence classes. [2025-02-08 14:20:45,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 14:20:45,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-08 14:20:45,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:45,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:20:45,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:45,233 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:20:45,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:20:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:20:45,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949288664] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:20:45,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:20:45,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-02-08 14:20:45,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483797054] [2025-02-08 14:20:45,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:20:45,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:20:45,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 14:20:45,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-02-08 14:20:45,421 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. cyclomatic complexity: 3 Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:20:45,471 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2025-02-08 14:20:45,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 64 transitions. [2025-02-08 14:20:45,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:20:45,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 50 states and 52 transitions. [2025-02-08 14:20:45,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2025-02-08 14:20:45,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2025-02-08 14:20:45,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 52 transitions. [2025-02-08 14:20:45,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:45,473 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-02-08 14:20:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 52 transitions. [2025-02-08 14:20:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2025-02-08 14:20:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2025-02-08 14:20:45,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 51 transitions. [2025-02-08 14:20:45,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 14:20:45,478 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 51 transitions. [2025-02-08 14:20:45,479 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:20:45,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 51 transitions. [2025-02-08 14:20:45,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:20:45,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:45,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:45,480 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 1] [2025-02-08 14:20:45,480 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-02-08 14:20:45,480 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-02-08 14:20:45,480 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-02-08 14:20:45,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash 307114924, now seen corresponding path program 4 times [2025-02-08 14:20:45,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:45,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998281185] [2025-02-08 14:20:45,480 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:20:45,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:45,484 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-02-08 14:20:45,493 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 14:20:45,493 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:20:45,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:45,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:45,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 14:20:45,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 14:20:45,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:45,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:45,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:45,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:45,525 INFO L85 PathProgramCache]: Analyzing trace with hash 986020, now seen corresponding path program 2 times [2025-02-08 14:20:45,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:45,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976301921] [2025-02-08 14:20:45,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:20:45,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:45,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 2 equivalence classes. [2025-02-08 14:20:45,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:45,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:20:45,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:45,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:45,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:45,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:45,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:45,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:45,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:45,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-08 14:20:45,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:45,530 INFO L85 PathProgramCache]: Analyzing trace with hash 326463951, now seen corresponding path program 4 times [2025-02-08 14:20:45,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:45,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150944749] [2025-02-08 14:20:45,530 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:20:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:45,536 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-02-08 14:20:45,543 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 14:20:45,543 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:20:45,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:20:45,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:45,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150944749] [2025-02-08 14:20:45,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150944749] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:20:45,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699376347] [2025-02-08 14:20:45,908 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:20:45,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:20:45,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:45,910 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:20:45,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-02-08 14:20:45,928 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-02-08 14:20:45,937 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 14:20:45,937 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:20:45,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:45,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 14:20:45,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:20:46,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:20:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:20:46,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699376347] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:20:46,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:20:46,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-02-08 14:20:46,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651303635] [2025-02-08 14:20:46,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:20:46,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:20:46,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 14:20:46,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 14:20:46,680 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. cyclomatic complexity: 3 Second operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:46,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:20:46,796 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2025-02-08 14:20:46,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 124 transitions. [2025-02-08 14:20:46,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:20:46,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 98 states and 100 transitions. [2025-02-08 14:20:46,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2025-02-08 14:20:46,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2025-02-08 14:20:46,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 100 transitions. [2025-02-08 14:20:46,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:46,801 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98 states and 100 transitions. [2025-02-08 14:20:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 100 transitions. [2025-02-08 14:20:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-02-08 14:20:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 96 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2025-02-08 14:20:46,804 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 99 transitions. [2025-02-08 14:20:46,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-08 14:20:46,804 INFO L432 stractBuchiCegarLoop]: Abstraction has 97 states and 99 transitions. [2025-02-08 14:20:46,804 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:20:46,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 99 transitions. [2025-02-08 14:20:46,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:20:46,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:46,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:46,806 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 46, 1] [2025-02-08 14:20:46,806 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-02-08 14:20:46,806 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-02-08 14:20:46,807 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-02-08 14:20:46,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:46,807 INFO L85 PathProgramCache]: Analyzing trace with hash 588653788, now seen corresponding path program 5 times [2025-02-08 14:20:46,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:46,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331989733] [2025-02-08 14:20:46,807 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:20:46,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:46,816 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 94 statements into 47 equivalence classes. [2025-02-08 14:20:46,844 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 14:20:46,844 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-08 14:20:46,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:46,844 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:46,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 14:20:46,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 14:20:46,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:46,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:46,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:46,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:46,861 INFO L85 PathProgramCache]: Analyzing trace with hash 986020, now seen corresponding path program 3 times [2025-02-08 14:20:46,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:46,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738141002] [2025-02-08 14:20:46,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:20:46,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:46,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 2 equivalence classes. [2025-02-08 14:20:46,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:46,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 14:20:46,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:46,863 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:46,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:46,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:46,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:46,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:46,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:46,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:46,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1350481153, now seen corresponding path program 5 times [2025-02-08 14:20:46,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:46,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89632547] [2025-02-08 14:20:46,865 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:20:46,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:46,869 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 98 statements into 49 equivalence classes. [2025-02-08 14:20:46,893 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 14:20:46,893 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2025-02-08 14:20:46,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:48,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:20:48,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:20:48,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89632547] [2025-02-08 14:20:48,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89632547] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:20:48,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267183781] [2025-02-08 14:20:48,043 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:20:48,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:20:48,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:20:48,044 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:20:48,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-02-08 14:20:48,067 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 98 statements into 49 equivalence classes. [2025-02-08 14:20:48,093 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 14:20:48,093 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2025-02-08 14:20:48,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:20:48,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-08 14:20:48,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:20:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:20:48,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:20:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:20:49,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267183781] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:20:49,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:20:49,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 51 [2025-02-08 14:20:49,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640395916] [2025-02-08 14:20:49,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:20:49,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:20:49,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-08 14:20:49,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-02-08 14:20:49,171 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. cyclomatic complexity: 3 Second operand has 52 states, 52 states have (on average 2.019230769230769) internal successors, (105), 51 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:20:49,292 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2025-02-08 14:20:49,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 112 transitions. [2025-02-08 14:20:49,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:20:49,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 106 states and 108 transitions. [2025-02-08 14:20:49,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2025-02-08 14:20:49,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2025-02-08 14:20:49,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 108 transitions. [2025-02-08 14:20:49,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:20:49,300 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 108 transitions. [2025-02-08 14:20:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 108 transitions. [2025-02-08 14:20:49,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-08 14:20:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 105 states have (on average 1.019047619047619) internal successors, (107), 104 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:20:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2025-02-08 14:20:49,310 INFO L240 hiAutomatonCegarLoop]: Abstraction has 105 states and 107 transitions. [2025-02-08 14:20:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-08 14:20:49,310 INFO L432 stractBuchiCegarLoop]: Abstraction has 105 states and 107 transitions. [2025-02-08 14:20:49,311 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:20:49,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 107 transitions. [2025-02-08 14:20:49,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:20:49,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:20:49,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:20:49,316 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [51, 50, 1] [2025-02-08 14:20:49,319 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-02-08 14:20:49,320 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_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-02-08 14:20:49,320 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1;" "assume main_~i~0#1 < 100;" "assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~i~0#1 < 100;" [2025-02-08 14:20:49,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:49,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1074461084, now seen corresponding path program 6 times [2025-02-08 14:20:49,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:49,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353171409] [2025-02-08 14:20:49,320 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:20:49,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:49,331 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 102 statements into 51 equivalence classes. [2025-02-08 14:20:49,367 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 14:20:49,370 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2025-02-08 14:20:49,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:49,371 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:49,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 14:20:49,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 14:20:49,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:49,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:49,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:49,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:49,412 INFO L85 PathProgramCache]: Analyzing trace with hash 986020, now seen corresponding path program 4 times [2025-02-08 14:20:49,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:49,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805894291] [2025-02-08 14:20:49,412 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:20:49,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:49,413 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-02-08 14:20:49,415 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:49,415 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:20:49,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:49,415 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:49,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:20:49,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:20:49,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:49,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:49,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:49,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:20:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash 394537095, now seen corresponding path program 6 times [2025-02-08 14:20:49,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:20:49,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156207422] [2025-02-08 14:20:49,421 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:20:49,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:20:49,424 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 106 statements into 53 equivalence classes. [2025-02-08 14:20:49,456 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 53 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 14:20:49,459 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 53 check-sat command(s) [2025-02-08 14:20:49,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:49,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:49,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 14:20:49,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 14:20:49,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:49,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:49,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:20:50,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 14:20:50,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 14:20:50,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:50,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:50,683 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:20:50,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 14:20:50,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 14:20:50,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:20:50,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:20:50,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:20:50 BoogieIcfgContainer [2025-02-08 14:20:50,809 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:20:50,809 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:20:50,809 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:20:50,809 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:20:50,810 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:20:42" (3/4) ... [2025-02-08 14:20:50,811 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-08 14:20:50,895 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:20:50,896 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:20:50,897 INFO L158 Benchmark]: Toolchain (without parser) took 8267.32ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 106.6MB in the beginning and 162.3MB in the end (delta: -55.7MB). Peak memory consumption was 137.2MB. Max. memory is 16.1GB. [2025-02-08 14:20:50,897 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:20:50,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 132.09ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 96.9MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:20:50,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 13.36ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:20:50,899 INFO L158 Benchmark]: Boogie Preprocessor took 10.96ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.4MB in the end (delta: 820.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:20:50,900 INFO L158 Benchmark]: IcfgBuilder took 148.63ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 85.2MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:20:50,900 INFO L158 Benchmark]: BuchiAutomizer took 7870.70ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 85.2MB in the beginning and 166.9MB in the end (delta: -81.6MB). Peak memory consumption was 112.0MB. Max. memory is 16.1GB. [2025-02-08 14:20:50,901 INFO L158 Benchmark]: Witness Printer took 86.80ms. Allocated memory is still 335.5MB. Free memory was 166.9MB in the beginning and 162.3MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:20:50,902 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 132.09ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 96.9MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 13.36ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 10.96ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.4MB in the end (delta: 820.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 148.63ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 85.2MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 7870.70ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 85.2MB in the beginning and 166.9MB in the end (delta: -81.6MB). Peak memory consumption was 112.0MB. Max. memory is 16.1GB. * Witness Printer took 86.80ms. Allocated memory is still 335.5MB. Free memory was 166.9MB in the beginning and 162.3MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. 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 10 terminating modules (6 trivial, 2 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long) -2 * i) + 99) and consists of 3 locations. One deterministic module has affine ranking function (((long) -2 * i) + 99) and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 99) and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 52 locations. The remainder module has 105 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 8 iterations. TraceHistogramMax:51. Analysis of lassos took 6.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 14 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 347 IncrementalHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 37 mSDtfsCounter, 347 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc3 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax213 hnf100 lsp47 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 10]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] i = 0 VAL [i=0] [L9] COND TRUE i < 100 VAL [i=0] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=1] [L9] COND TRUE i < 100 VAL [i=1] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=2] [L9] COND TRUE i < 100 VAL [i=2] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=3] [L9] COND TRUE i < 100 VAL [i=3] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=4] [L9] COND TRUE i < 100 VAL [i=4] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=5] [L9] COND TRUE i < 100 VAL [i=5] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=6] [L9] COND TRUE i < 100 VAL [i=6] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=7] [L9] COND TRUE i < 100 VAL [i=7] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=8] [L9] COND TRUE i < 100 VAL [i=8] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=9] [L9] COND TRUE i < 100 VAL [i=9] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=10] [L9] COND TRUE i < 100 VAL [i=10] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=11] [L9] COND TRUE i < 100 VAL [i=11] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=12] [L9] COND TRUE i < 100 VAL [i=12] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=13] [L9] COND TRUE i < 100 VAL [i=13] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=14] [L9] COND TRUE i < 100 VAL [i=14] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=15] [L9] COND TRUE i < 100 VAL [i=15] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=16] [L9] COND TRUE i < 100 VAL [i=16] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=17] [L9] COND TRUE i < 100 VAL [i=17] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=18] [L9] COND TRUE i < 100 VAL [i=18] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=19] [L9] COND TRUE i < 100 VAL [i=19] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=20] [L9] COND TRUE i < 100 VAL [i=20] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=21] [L9] COND TRUE i < 100 VAL [i=21] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=22] [L9] COND TRUE i < 100 VAL [i=22] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=23] [L9] COND TRUE i < 100 VAL [i=23] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=24] [L9] COND TRUE i < 100 VAL [i=24] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=25] [L9] COND TRUE i < 100 VAL [i=25] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=26] [L9] COND TRUE i < 100 VAL [i=26] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=27] [L9] COND TRUE i < 100 VAL [i=27] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=28] [L9] COND TRUE i < 100 VAL [i=28] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=29] [L9] COND TRUE i < 100 VAL [i=29] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=30] [L9] COND TRUE i < 100 VAL [i=30] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=31] [L9] COND TRUE i < 100 VAL [i=31] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=32] [L9] COND TRUE i < 100 VAL [i=32] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=33] [L9] COND TRUE i < 100 VAL [i=33] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=34] [L9] COND TRUE i < 100 VAL [i=34] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=35] [L9] COND TRUE i < 100 VAL [i=35] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=36] [L9] COND TRUE i < 100 VAL [i=36] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=37] [L9] COND TRUE i < 100 VAL [i=37] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=38] [L9] COND TRUE i < 100 VAL [i=38] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=39] [L9] COND TRUE i < 100 VAL [i=39] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=40] [L9] COND TRUE i < 100 VAL [i=40] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=41] [L9] COND TRUE i < 100 VAL [i=41] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=42] [L9] COND TRUE i < 100 VAL [i=42] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=43] [L9] COND TRUE i < 100 VAL [i=43] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=44] [L9] COND TRUE i < 100 VAL [i=44] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=45] [L9] COND TRUE i < 100 VAL [i=45] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=46] [L9] COND TRUE i < 100 VAL [i=46] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=47] [L9] COND TRUE i < 100 VAL [i=47] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=48] [L9] COND TRUE i < 100 VAL [i=48] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=50] [L9] COND TRUE i < 100 VAL [i=50] Loop: [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 10]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = 0 VAL [i=0] [L9] COND TRUE i < 100 VAL [i=0] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=1] [L9] COND TRUE i < 100 VAL [i=1] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=2] [L9] COND TRUE i < 100 VAL [i=2] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=3] [L9] COND TRUE i < 100 VAL [i=3] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=4] [L9] COND TRUE i < 100 VAL [i=4] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=5] [L9] COND TRUE i < 100 VAL [i=5] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=6] [L9] COND TRUE i < 100 VAL [i=6] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=7] [L9] COND TRUE i < 100 VAL [i=7] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=8] [L9] COND TRUE i < 100 VAL [i=8] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=9] [L9] COND TRUE i < 100 VAL [i=9] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=10] [L9] COND TRUE i < 100 VAL [i=10] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=11] [L9] COND TRUE i < 100 VAL [i=11] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=12] [L9] COND TRUE i < 100 VAL [i=12] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=13] [L9] COND TRUE i < 100 VAL [i=13] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=14] [L9] COND TRUE i < 100 VAL [i=14] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=15] [L9] COND TRUE i < 100 VAL [i=15] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=16] [L9] COND TRUE i < 100 VAL [i=16] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=17] [L9] COND TRUE i < 100 VAL [i=17] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=18] [L9] COND TRUE i < 100 VAL [i=18] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=19] [L9] COND TRUE i < 100 VAL [i=19] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=20] [L9] COND TRUE i < 100 VAL [i=20] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=21] [L9] COND TRUE i < 100 VAL [i=21] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=22] [L9] COND TRUE i < 100 VAL [i=22] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=23] [L9] COND TRUE i < 100 VAL [i=23] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=24] [L9] COND TRUE i < 100 VAL [i=24] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=25] [L9] COND TRUE i < 100 VAL [i=25] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=26] [L9] COND TRUE i < 100 VAL [i=26] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=27] [L9] COND TRUE i < 100 VAL [i=27] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=28] [L9] COND TRUE i < 100 VAL [i=28] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=29] [L9] COND TRUE i < 100 VAL [i=29] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=30] [L9] COND TRUE i < 100 VAL [i=30] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=31] [L9] COND TRUE i < 100 VAL [i=31] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=32] [L9] COND TRUE i < 100 VAL [i=32] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=33] [L9] COND TRUE i < 100 VAL [i=33] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=34] [L9] COND TRUE i < 100 VAL [i=34] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=35] [L9] COND TRUE i < 100 VAL [i=35] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=36] [L9] COND TRUE i < 100 VAL [i=36] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=37] [L9] COND TRUE i < 100 VAL [i=37] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=38] [L9] COND TRUE i < 100 VAL [i=38] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=39] [L9] COND TRUE i < 100 VAL [i=39] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=40] [L9] COND TRUE i < 100 VAL [i=40] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=41] [L9] COND TRUE i < 100 VAL [i=41] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=42] [L9] COND TRUE i < 100 VAL [i=42] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=43] [L9] COND TRUE i < 100 VAL [i=43] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=44] [L9] COND TRUE i < 100 VAL [i=44] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=45] [L9] COND TRUE i < 100 VAL [i=45] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=46] [L9] COND TRUE i < 100 VAL [i=46] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=47] [L9] COND TRUE i < 100 VAL [i=47] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=48] [L9] COND TRUE i < 100 VAL [i=48] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=50] [L9] COND TRUE i < 100 VAL [i=50] Loop: [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-08 14:20:50,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-02-08 14:20:51,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-02-08 14:20:51,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:51,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-02-08 14:20:51,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-08 14:20:51,929 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)