./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.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 7a5d554c80523420ffafe318e54a94b7662019572fad78d6e8fce2ccc83674b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:59:46,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:59:46,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 06:59:46,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:59:46,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:59:46,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:59:46,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:59:46,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:59:46,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:59:46,842 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:59:46,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:59:46,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:59:46,842 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:59:46,843 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 06:59:46,843 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 06:59:46,843 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 06:59:46,843 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 06:59:46,843 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 06:59:46,843 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 06:59:46,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:59:46,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 06:59:46,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:59:46,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:59:46,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 06:59:46,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 06:59:46,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 06:59:46,845 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:59:46,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:59:46,845 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 06:59:46,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:59:46,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:59:46,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:59:46,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:59:46,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:59:46,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:59:46,846 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 06:59:46,846 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 -> 7a5d554c80523420ffafe318e54a94b7662019572fad78d6e8fce2ccc83674b0 [2025-01-10 06:59:47,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:59:47,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:59:47,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:59:47,147 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:59:47,147 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:59:47,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c [2025-01-10 06:59:48,373 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f3140e11/70e721a178ce455dbabf234daaad18b4/FLAG717d23ad4 [2025-01-10 06:59:48,651 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:59:48,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Iteration.c [2025-01-10 06:59:48,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f3140e11/70e721a178ce455dbabf234daaad18b4/FLAG717d23ad4 [2025-01-10 06:59:48,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f3140e11/70e721a178ce455dbabf234daaad18b4 [2025-01-10 06:59:48,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:59:48,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:59:48,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:59:48,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:59:48,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:59:48,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:59:48" (1/1) ... [2025-01-10 06:59:48,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4017ef47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:48, skipping insertion in model container [2025-01-10 06:59:48,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:59:48" (1/1) ... [2025-01-10 06:59:48,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:59:49,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:59:49,110 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:59:49,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:59:49,141 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:59:49,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:49 WrapperNode [2025-01-10 06:59:49,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:59:49,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:59:49,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:59:49,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:59:49,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:49" (1/1) ... [2025-01-10 06:59:49,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:49" (1/1) ... [2025-01-10 06:59:49,177 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 16 [2025-01-10 06:59:49,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:59:49,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:59:49,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:59:49,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:59:49,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:49" (1/1) ... [2025-01-10 06:59:49,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:49" (1/1) ... [2025-01-10 06:59:49,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:49" (1/1) ... [2025-01-10 06:59:49,192 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 06:59:49,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:49" (1/1) ... [2025-01-10 06:59:49,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:49" (1/1) ... [2025-01-10 06:59:49,197 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:49" (1/1) ... [2025-01-10 06:59:49,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:49" (1/1) ... [2025-01-10 06:59:49,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:49" (1/1) ... [2025-01-10 06:59:49,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:49" (1/1) ... [2025-01-10 06:59:49,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:49" (1/1) ... [2025-01-10 06:59:49,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:59:49,209 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:59:49,209 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:59:49,209 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:59:49,210 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:49" (1/1) ... [2025-01-10 06:59:49,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:49,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:49,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:49,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 06:59:49,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:59:49,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:59:49,323 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:59:49,325 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:59:49,365 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-01-10 06:59:49,365 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:59:49,374 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:59:49,374 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:59:49,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:59:49 BoogieIcfgContainer [2025-01-10 06:59:49,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:59:49,375 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 06:59:49,375 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 06:59:49,379 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 06:59:49,380 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 06:59:49,380 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 06:59:48" (1/3) ... [2025-01-10 06:59:49,381 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57e1f576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 06:59:49, skipping insertion in model container [2025-01-10 06:59:49,381 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 06:59:49,381 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:49" (2/3) ... [2025-01-10 06:59:49,382 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57e1f576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 06:59:49, skipping insertion in model container [2025-01-10 06:59:49,382 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 06:59:49,382 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:59:49" (3/3) ... [2025-01-10 06:59:49,383 INFO L363 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Iteration.c [2025-01-10 06:59:49,422 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 06:59:49,422 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 06:59:49,422 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 06:59:49,423 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 06:59:49,423 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 06:59:49,423 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 06:59:49,424 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 06:59:49,424 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 06:59:49,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:49,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 06:59:49,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:49,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:49,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 06:59:49,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 06:59:49,440 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 06:59:49,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:49,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 06:59:49,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:49,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:49,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 06:59:49,442 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 06:59:49,446 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" [2025-01-10 06:59:49,447 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" [2025-01-10 06:59:49,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:49,451 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 06:59:49,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:49,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344316661] [2025-01-10 06:59:49,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:49,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:49,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:49,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:49,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:49,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:49,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:49,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:49,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:49,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:49,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:49,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:49,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:49,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1156, now seen corresponding path program 1 times [2025-01-10 06:59:49,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:49,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094526082] [2025-01-10 06:59:49,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:49,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:49,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:49,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:49,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:49,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:49,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:49,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:49,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:49,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:49,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:49,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:49,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:49,548 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2025-01-10 06:59:49,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:49,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866340737] [2025-01-10 06:59:49,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:49,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:49,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:49,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:49,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:49,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:49,560 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:49,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:49,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:49,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:49,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:49,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:49,646 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:49,648 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:49,649 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:49,649 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:49,649 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:49,649 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:49,649 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:49,649 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:49,649 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration1_Loop [2025-01-10 06:59:49,649 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:49,650 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:49,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:49,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:49,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:49,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:49,773 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:49,773 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:49,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:49,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:49,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:49,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 06:59:49,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:49,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:49,804 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:49,804 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:49,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 06:59:49,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:49,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:49,813 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:49,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 06:59:49,816 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:49,816 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:49,835 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:49,836 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:49,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:49,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:49,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:49,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:49,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 06:59:49,847 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:49,847 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:49,876 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-01-10 06:59:49,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:49,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:49,882 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:49,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 06:59:49,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:49,892 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:49,926 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:49,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:49,931 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:49,931 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:49,931 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:49,931 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:49,931 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:49,931 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:49,931 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:49,931 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:49,931 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration1_Loop [2025-01-10 06:59:49,931 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:49,931 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:49,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:49,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:49,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:49,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:50,010 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:50,014 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:50,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:50,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:50,020 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:50,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 06:59:50,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:50,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:50,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:50,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:50,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:50,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:50,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:50,051 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:50,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:50,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:50,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:50,062 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:50,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 06:59:50,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:50,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:50,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:50,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:50,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:50,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:50,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:50,086 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:50,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:50,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:50,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:50,095 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:50,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 06:59:50,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:50,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:50,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:50,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:50,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:50,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:50,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:50,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:50,121 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:50,125 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-01-10 06:59:50,127 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 06:59:50,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:50,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:50,131 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:50,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 06:59:50,134 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:50,135 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:50,135 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:50,135 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = 1*ULTIMATE.start_main_~c~0#1 Supporting invariants [] [2025-01-10 06:59:50,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:50,145 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:50,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:50,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:50,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:50,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:50,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:50,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:50,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:50,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:50,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:50,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:50,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:50,188 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:59:50,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:50,230 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 06:59:50,232 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:50,269 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 17 transitions. Complement of second has 5 states. [2025-01-10 06:59:50,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-01-10 06:59:50,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2025-01-10 06:59:50,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:50,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2025-01-10 06:59:50,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:50,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2025-01-10 06:59:50,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:50,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-01-10 06:59:50,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 06:59:50,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 11 transitions. [2025-01-10 06:59:50,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 06:59:50,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-01-10 06:59:50,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2025-01-10 06:59:50,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:50,305 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 06:59:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2025-01-10 06:59:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-01-10 06:59:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-01-10 06:59:50,336 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 06:59:50,337 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 06:59:50,337 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 06:59:50,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2025-01-10 06:59:50,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 06:59:50,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:50,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:50,338 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 06:59:50,338 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 06:59:50,338 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-01-10 06:59:50,338 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" [2025-01-10 06:59:50,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:50,339 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2025-01-10 06:59:50,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:50,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534077690] [2025-01-10 06:59:50,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:50,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:50,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:50,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:50,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:50,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:50,345 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:50,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:50,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:50,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:50,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:50,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:50,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:50,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1156, now seen corresponding path program 2 times [2025-01-10 06:59:50,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:50,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728941823] [2025-01-10 06:59:50,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:50,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:50,353 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:50,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:50,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:59:50,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:50,354 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:50,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:50,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:50,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:50,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:50,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:50,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:50,358 INFO L85 PathProgramCache]: Analyzing trace with hash 889540235, now seen corresponding path program 1 times [2025-01-10 06:59:50,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:50,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229056112] [2025-01-10 06:59:50,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:50,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:50,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:50,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:50,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:50,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:50,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:50,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:50,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:50,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:50,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:50,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:50,405 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:50,406 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:50,406 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:50,406 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:50,406 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:50,406 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:50,406 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:50,406 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:50,406 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration2_Loop [2025-01-10 06:59:50,406 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:50,406 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:50,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:50,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:50,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:50,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:50,488 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:50,488 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:50,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:50,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:50,492 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:50,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 06:59:50,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:50,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:50,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:50,521 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:50,521 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:50,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-01-10 06:59:50,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:50,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:50,528 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:50,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 06:59:50,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:50,537 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:50,554 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:50,554 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-01-10 06:59:50,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:50,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:50,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:50,565 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:50,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 06:59:50,573 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:50,573 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:50,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:50,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:50,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:50,597 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:50,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 06:59:50,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:50,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:50,626 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:50,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-01-10 06:59:50,632 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:50,632 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:50,632 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:50,632 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:50,632 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:50,632 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:50,632 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:50,632 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:50,632 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration2_Loop [2025-01-10 06:59:50,632 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:50,632 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:50,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:50,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:50,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:50,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:50,707 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:50,707 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:50,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:50,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:50,711 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:50,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 06:59:50,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:50,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:50,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:50,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:50,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:50,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:50,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:50,735 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:50,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-01-10 06:59:50,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:50,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:50,747 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:50,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 06:59:50,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:50,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:50,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:50,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:50,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:50,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:50,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:50,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:50,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-01-10 06:59:50,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:50,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:50,779 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:50,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 06:59:50,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:50,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:50,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:50,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:50,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:50,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:50,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:50,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:50,805 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:50,807 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-01-10 06:59:50,807 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 06:59:50,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:50,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:50,809 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:50,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-01-10 06:59:50,811 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:50,812 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:50,812 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:50,812 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = 1*ULTIMATE.start_main_~c~0#1 Supporting invariants [] [2025-01-10 06:59:50,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-01-10 06:59:50,818 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:50,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:50,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:50,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:50,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:50,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:50,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:50,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:50,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:50,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:50,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:50,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:50,861 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:59:50,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:50,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-01-10 06:59:50,880 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:50,898 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. 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 17 transitions. Complement of second has 5 states. [2025-01-10 06:59:50,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-01-10 06:59:50,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2025-01-10 06:59:50,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:50,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-01-10 06:59:50,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:50,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2025-01-10 06:59:50,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:50,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-01-10 06:59:50,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 06:59:50,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2025-01-10 06:59:50,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 06:59:50,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 06:59:50,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-01-10 06:59:50,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:50,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-01-10 06:59:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-01-10 06:59:50,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-01-10 06:59:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-01-10 06:59:50,906 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-01-10 06:59:50,906 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-01-10 06:59:50,906 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 06:59:50,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2025-01-10 06:59:50,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 06:59:50,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:50,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:50,907 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2025-01-10 06:59:50,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 06:59:50,907 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-01-10 06:59:50,908 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" [2025-01-10 06:59:50,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:50,908 INFO L85 PathProgramCache]: Analyzing trace with hash 889540237, now seen corresponding path program 2 times [2025-01-10 06:59:50,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:50,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361561589] [2025-01-10 06:59:50,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:50,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:50,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-01-10 06:59:50,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:50,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:50,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:50,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:50,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:50,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:50,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:50,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:50,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:50,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1156, now seen corresponding path program 3 times [2025-01-10 06:59:50,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:50,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007186663] [2025-01-10 06:59:50,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:50,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:50,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:50,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:50,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:59:50,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:50,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:50,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:50,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:50,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:50,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:50,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:50,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:50,937 INFO L85 PathProgramCache]: Analyzing trace with hash 149676048, now seen corresponding path program 2 times [2025-01-10 06:59:50,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:50,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845322217] [2025-01-10 06:59:50,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:50,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:50,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-01-10 06:59:50,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:59:50,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:50,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:50,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:50,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:59:50,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:59:50,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:50,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:50,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:50,975 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:50,975 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:50,976 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:50,976 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:50,976 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:50,976 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:50,976 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:50,976 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:50,976 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration3_Loop [2025-01-10 06:59:50,976 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:50,976 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:50,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:50,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:50,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:50,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,022 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:51,023 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:51,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:51,028 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:51,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-01-10 06:59:51,034 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:51,034 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:51,052 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:51,052 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-01-10 06:59:51,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-01-10 06:59:51,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:51,061 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:51,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-01-10 06:59:51,064 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:51,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:51,092 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:51,092 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:51,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:51,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:51,102 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:51,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-01-10 06:59:51,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:51,105 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:51,121 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-01-10 06:59:51,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:51,124 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:51,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-01-10 06:59:51,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:51,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:51,170 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:51,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-01-10 06:59:51,177 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:51,177 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:51,177 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:51,177 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:51,177 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:51,177 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,177 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:51,177 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:51,177 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration3_Loop [2025-01-10 06:59:51,177 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:51,177 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:51,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,231 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:51,231 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:51,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:51,236 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:51,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-01-10 06:59:51,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:51,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:51,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:51,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:51,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:51,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:51,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:51,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:51,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-01-10 06:59:51,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:51,279 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:51,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-01-10 06:59:51,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:51,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:51,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:51,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:51,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:51,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:51,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:51,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:51,302 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-01-10 06:59:51,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:51,305 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:51,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-01-10 06:59:51,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:51,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:51,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:51,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:51,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:51,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:51,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:51,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:51,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:51,323 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 06:59:51,323 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 06:59:51,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:51,330 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-01-10 06:59:51,331 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-01-10 06:59:51,331 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:51,331 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:51,332 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:51,332 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-01-10 06:59:51,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:51,338 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:51,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:51,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:51,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:51,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:51,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:51,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:51,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:51,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:51,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:51,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:51,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:51,375 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:59:51,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:51,381 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-01-10 06:59:51,382 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:51,387 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. 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 14 states and 21 transitions. Complement of second has 5 states. [2025-01-10 06:59:51,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-01-10 06:59:51,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-01-10 06:59:51,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:51,388 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:51,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:51,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:51,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:51,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:51,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:51,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:51,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:51,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:51,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:51,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:51,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:51,414 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:59:51,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:51,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-01-10 06:59:51,416 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-01-10 06:59:51,416 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:51,422 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. 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 14 states and 21 transitions. Complement of second has 5 states. [2025-01-10 06:59:51,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-01-10 06:59:51,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-01-10 06:59:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-01-10 06:59:51,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-01-10 06:59:51,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:51,423 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:51,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:51,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:51,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:51,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:51,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:51,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:51,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:51,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:51,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:51,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:51,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:51,453 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:59:51,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:51,455 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-01-10 06:59:51,455 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:51,460 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. 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 16 states and 24 transitions. Complement of second has 4 states. [2025-01-10 06:59:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-01-10 06:59:51,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2025-01-10 06:59:51,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:51,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2025-01-10 06:59:51,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:51,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2025-01-10 06:59:51,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:51,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 24 transitions. [2025-01-10 06:59:51,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 06:59:51,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 20 transitions. [2025-01-10 06:59:51,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 06:59:51,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 06:59:51,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2025-01-10 06:59:51,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:51,463 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-01-10 06:59:51,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2025-01-10 06:59:51,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 6. [2025-01-10 06:59:51,463 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-01-10 06:59:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2025-01-10 06:59:51,463 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-01-10 06:59:51,463 INFO L432 stractBuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-01-10 06:59:51,463 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 06:59:51,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2025-01-10 06:59:51,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 06:59:51,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:51,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:51,464 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 06:59:51,464 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 06:59:51,464 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" [2025-01-10 06:59:51,464 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-01-10 06:59:51,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:51,464 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2025-01-10 06:59:51,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:51,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381817204] [2025-01-10 06:59:51,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:51,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:51,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:51,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:51,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:59:51,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:51,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:51,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:51,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:51,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:51,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:51,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:51,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:51,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1158, now seen corresponding path program 1 times [2025-01-10 06:59:51,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:51,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482455920] [2025-01-10 06:59:51,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:51,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:51,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:51,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:51,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:51,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:51,472 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:51,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:51,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:51,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:51,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:51,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:51,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:51,482 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 3 times [2025-01-10 06:59:51,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:51,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722470613] [2025-01-10 06:59:51,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:51,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:51,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:51,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:51,486 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:59:51,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:51,486 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:51,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:51,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:51,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:51,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:51,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:51,517 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:51,517 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:51,518 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:51,518 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:51,518 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:51,518 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,518 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:51,518 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:51,518 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration4_Loop [2025-01-10 06:59:51,518 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:51,518 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:51,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,581 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:51,582 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:51,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:51,587 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-01-10 06:59:51,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:51,589 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:51,589 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-01-10 06:59:51,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:51,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:51,615 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-01-10 06:59:51,617 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-01-10 06:59:51,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:51,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:51,647 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:51,647 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=1} Honda state: {ULTIMATE.start_main_~c~0#1=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0#1=1}, {ULTIMATE.start_main_~c~0#1=0}, {ULTIMATE.start_main_~c~0#1=0}] Lambdas: [1, 1, 1] Nus: [0, 0] [2025-01-10 06:59:51,655 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-01-10 06:59:51,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:51,657 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-01-10 06:59:51,659 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-01-10 06:59:51,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:51,660 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:51,680 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-01-10 06:59:51,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:51,687 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:51,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-01-10 06:59:51,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:51,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:51,725 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:51,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-01-10 06:59:51,729 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:51,729 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:51,729 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:51,729 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:51,729 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:51,729 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,729 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:51,729 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:51,729 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration4_Loop [2025-01-10 06:59:51,729 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:51,729 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:51,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,784 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:51,784 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:51,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:51,788 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:51,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-01-10 06:59:51,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:51,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:51,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:51,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:51,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:51,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:51,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:51,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:51,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:51,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-01-10 06:59:51,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:51,813 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:51,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-01-10 06:59:51,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:51,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:51,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:51,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:51,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:51,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:51,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:51,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:51,831 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:51,832 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 06:59:51,832 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 06:59:51,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:51,835 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:51,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-01-10 06:59:51,837 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:51,837 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:51,837 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:51,837 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 211 Supporting invariants [] [2025-01-10 06:59:51,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-01-10 06:59:51,844 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:51,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:51,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:51,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:51,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:51,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:51,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:51,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:51,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:51,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:51,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:51,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:51,864 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:59:51,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:51,866 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-01-10 06:59:51,867 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:51,871 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 18 transitions. Complement of second has 5 states. [2025-01-10 06:59:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-01-10 06:59:51,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2025-01-10 06:59:51,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:51,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2025-01-10 06:59:51,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:51,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2025-01-10 06:59:51,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:51,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2025-01-10 06:59:51,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 06:59:51,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 14 transitions. [2025-01-10 06:59:51,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 06:59:51,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-01-10 06:59:51,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-01-10 06:59:51,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:51,874 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-01-10 06:59:51,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-01-10 06:59:51,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-01-10 06:59:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2025-01-10 06:59:51,875 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-01-10 06:59:51,875 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-01-10 06:59:51,875 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 06:59:51,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2025-01-10 06:59:51,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 06:59:51,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:51,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:51,876 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2025-01-10 06:59:51,876 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 06:59:51,876 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 06:59:51,876 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" [2025-01-10 06:59:51,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:51,877 INFO L85 PathProgramCache]: Analyzing trace with hash 28694784, now seen corresponding path program 2 times [2025-01-10 06:59:51,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:51,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631038492] [2025-01-10 06:59:51,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:51,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 2 equivalence classes. [2025-01-10 06:59:51,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:51,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:51,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:51,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:51,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631038492] [2025-01-10 06:59:51,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631038492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:59:51,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:59:51,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:59:51,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260596560] [2025-01-10 06:59:51,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:59:51,910 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 06:59:51,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:51,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1308, now seen corresponding path program 2 times [2025-01-10 06:59:51,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:51,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548469328] [2025-01-10 06:59:51,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:51,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:51,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:51,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:59:51,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:51,934 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:51,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:51,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:51,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:51,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:51,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:51,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-01-10 06:59:51,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-01-10 06:59:51,962 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:51,962 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:51,962 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:51,962 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:51,963 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:51,963 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:51,963 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:51,963 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:51,963 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration5_Loop [2025-01-10 06:59:51,963 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:51,963 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:51,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,965 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-01-10 06:59:51,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:51,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:52,013 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:52,015 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:52,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:52,018 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:52,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-01-10 06:59:52,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:52,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:52,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-01-10 06:59:52,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:52,040 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:52,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-01-10 06:59:52,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:52,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:52,066 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:52,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-01-10 06:59:52,073 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:52,074 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:52,074 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:52,074 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:52,074 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:52,074 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,074 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:52,074 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:52,074 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration5_Loop [2025-01-10 06:59:52,074 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:52,074 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:52,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:52,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:52,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:52,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:52,117 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:52,117 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:52,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:52,122 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:52,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-01-10 06:59:52,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:52,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:52,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:52,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:52,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:52,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:52,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:52,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:52,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:52,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:52,148 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:52,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-01-10 06:59:52,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:52,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:52,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:52,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:52,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:52,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:52,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:52,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:52,164 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:52,166 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 06:59:52,166 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 06:59:52,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:52,169 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:52,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-01-10 06:59:52,171 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:52,171 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:52,171 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:52,171 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 211 Supporting invariants [] [2025-01-10 06:59:52,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:52,177 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:52,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:52,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:52,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:52,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:52,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:52,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:52,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:52,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:52,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:52,206 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:59:52,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:52,231 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 06:59:52,231 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:52,237 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6. 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 14 states and 18 transitions. Complement of second has 5 states. [2025-01-10 06:59:52,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-01-10 06:59:52,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2025-01-10 06:59:52,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:52,238 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:52,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:52,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:52,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:52,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:52,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:52,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:52,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:52,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:52,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:52,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:59:52,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:52,268 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 06:59:52,269 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:52,278 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6. 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 11 states and 15 transitions. Complement of second has 5 states. [2025-01-10 06:59:52,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 06:59:52,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 2 letters. [2025-01-10 06:59:52,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:52,279 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:52,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:52,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:59:52,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:59:52,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:52,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:52,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:52,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:52,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:52,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:52,302 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:59:52,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:52,323 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 06:59:52,323 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:52,331 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 6. 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 17 states and 21 transitions. Complement of second has 4 states. [2025-01-10 06:59:52,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-01-10 06:59:52,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2025-01-10 06:59:52,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:52,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2025-01-10 06:59:52,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:52,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2025-01-10 06:59:52,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:52,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2025-01-10 06:59:52,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 06:59:52,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 17 transitions. [2025-01-10 06:59:52,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 06:59:52,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 06:59:52,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2025-01-10 06:59:52,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:52,333 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-01-10 06:59:52,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2025-01-10 06:59:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2025-01-10 06:59:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-01-10 06:59:52,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 06:59:52,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:52,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:59:52,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:59:52,336 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:52,347 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2025-01-10 06:59:52,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2025-01-10 06:59:52,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:52,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 11 transitions. [2025-01-10 06:59:52,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 06:59:52,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 06:59:52,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2025-01-10 06:59:52,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:52,348 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-01-10 06:59:52,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2025-01-10 06:59:52,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-01-10 06:59:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2025-01-10 06:59:52,349 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-01-10 06:59:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:59:52,350 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-01-10 06:59:52,350 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 06:59:52,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2025-01-10 06:59:52,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 06:59:52,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:52,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:52,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2025-01-10 06:59:52,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-01-10 06:59:52,351 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 06:59:52,351 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 06:59:52,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:52,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1805943515, now seen corresponding path program 3 times [2025-01-10 06:59:52,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:52,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743545285] [2025-01-10 06:59:52,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:52,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:52,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 3 equivalence classes. [2025-01-10 06:59:52,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:59:52,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 06:59:52,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:52,356 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:52,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:59:52,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:59:52,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:52,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:52,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1257273, now seen corresponding path program 1 times [2025-01-10 06:59:52,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:52,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594932356] [2025-01-10 06:59:52,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:52,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:52,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:52,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:52,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:52,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:52,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:52,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:52,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:52,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:52,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:52,366 INFO L85 PathProgramCache]: Analyzing trace with hash 765900051, now seen corresponding path program 4 times [2025-01-10 06:59:52,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:52,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681477326] [2025-01-10 06:59:52,366 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:59:52,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:52,369 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 11 statements into 2 equivalence classes. [2025-01-10 06:59:52,372 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:59:52,372 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:59:52,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:52,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:52,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:59:52,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:59:52,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:52,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:52,422 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:52,422 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:52,422 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:52,422 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:52,422 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:52,422 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,422 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:52,423 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:52,423 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration6_Loop [2025-01-10 06:59:52,423 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:52,423 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:52,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:52,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:52,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:52,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:52,470 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:52,472 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:52,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:52,474 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:52,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-01-10 06:59:52,477 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:52,477 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:52,496 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:52,496 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:52,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:52,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:52,505 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:52,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-01-10 06:59:52,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:52,507 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:52,526 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:52,527 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:52,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-01-10 06:59:52,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:52,537 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:52,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-01-10 06:59:52,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:52,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:52,558 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:52,558 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=1} Honda state: {ULTIMATE.start_main_~c~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:52,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:52,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:52,566 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:52,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-01-10 06:59:52,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:52,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:52,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:52,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:52,592 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:52,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-01-10 06:59:52,594 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:52,594 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:52,607 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:52,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:52,613 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:52,613 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:52,613 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:52,613 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:52,613 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:52,613 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,613 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:52,613 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:52,613 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration6_Loop [2025-01-10 06:59:52,613 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:52,613 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:52,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:52,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:52,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:52,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:52,658 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:52,658 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:52,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:52,662 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:52,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-01-10 06:59:52,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:52,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:52,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:52,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:52,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:52,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:52,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:52,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:52,687 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:52,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:52,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:52,698 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:52,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-01-10 06:59:52,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:52,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:52,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:52,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:52,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:52,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:52,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:52,719 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:52,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:52,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:52,728 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:52,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-01-10 06:59:52,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:52,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:52,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:52,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:52,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:52,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:52,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:52,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:52,744 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:52,746 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 06:59:52,746 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 06:59:52,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:52,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:52,749 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:52,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-01-10 06:59:52,751 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:52,751 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:52,751 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:52,751 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 201 Supporting invariants [] [2025-01-10 06:59:52,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:52,757 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:52,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:52,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:59:52,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:59:52,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:52,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:52,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:52,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:52,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:52,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:52,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:59:52,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:52,808 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 06:59:52,808 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:52,813 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 17 transitions. Complement of second has 5 states. [2025-01-10 06:59:52,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-01-10 06:59:52,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 4 letters. [2025-01-10 06:59:52,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:52,814 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:52,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:52,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:59:52,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:59:52,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:52,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:52,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:52,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:52,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:52,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:52,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:59:52,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:52,864 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 06:59:52,864 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:52,874 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 15 transitions. Complement of second has 5 states. [2025-01-10 06:59:52,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 06:59:52,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 7 letters. Loop has 4 letters. [2025-01-10 06:59:52,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:52,876 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:52,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:52,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:59:52,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:59:52,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:52,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:52,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:52,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:52,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:52,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:52,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:59:52,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:52,927 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 3 loop predicates [2025-01-10 06:59:52,927 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:52,932 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 20 transitions. Complement of second has 4 states. [2025-01-10 06:59:52,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-01-10 06:59:52,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2025-01-10 06:59:52,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:52,933 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:52,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:52,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:59:52,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:59:52,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:52,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:52,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:52,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:52,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:52,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:52,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:52,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:59:52,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:52,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:52,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-01-10 06:59:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:52,999 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 06:59:53,000 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:53,009 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 19 transitions. Complement of second has 4 states. [2025-01-10 06:59:53,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-01-10 06:59:53,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 4 letters. [2025-01-10 06:59:53,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:53,011 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:53,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:53,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:59:53,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:59:53,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:53,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:53,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:53,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:53,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:53,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:53,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:53,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:53,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:59:53,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:53,057 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 06:59:53,058 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:53,094 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 82 states and 109 transitions. Complement of second has 37 states 8 powerset states29 rank states. The highest rank that occured is 5 [2025-01-10 06:59:53,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:53,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2025-01-10 06:59:53,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2025-01-10 06:59:53,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:53,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 11 letters. Loop has 4 letters. [2025-01-10 06:59:53,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:53,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 8 letters. [2025-01-10 06:59:53,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:53,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 109 transitions. [2025-01-10 06:59:53,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-01-10 06:59:53,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 37 states and 51 transitions. [2025-01-10 06:59:53,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2025-01-10 06:59:53,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2025-01-10 06:59:53,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 51 transitions. [2025-01-10 06:59:53,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:53,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-01-10 06:59:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 51 transitions. [2025-01-10 06:59:53,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2025-01-10 06:59:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2025-01-10 06:59:53,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2025-01-10 06:59:53,101 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2025-01-10 06:59:53,101 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 06:59:53,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2025-01-10 06:59:53,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-01-10 06:59:53,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:53,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:53,102 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2025-01-10 06:59:53,102 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 1] [2025-01-10 06:59:53,102 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 06:59:53,102 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 06:59:53,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:53,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1805943515, now seen corresponding path program 5 times [2025-01-10 06:59:53,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:53,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901843864] [2025-01-10 06:59:53,102 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 06:59:53,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:53,105 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 3 equivalence classes. [2025-01-10 06:59:53,106 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:59:53,107 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 06:59:53,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:53,107 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:53,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:59:53,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:59:53,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:53,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:53,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:53,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:53,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1208239638, now seen corresponding path program 2 times [2025-01-10 06:59:53,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:53,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138782501] [2025-01-10 06:59:53,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:53,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:53,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-01-10 06:59:53,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:53,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:53,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:53,114 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:53,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:53,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:53,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:53,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:53,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:53,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1590541680, now seen corresponding path program 6 times [2025-01-10 06:59:53,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:53,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080137353] [2025-01-10 06:59:53,117 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 06:59:53,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:53,120 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 13 statements into 6 equivalence classes. [2025-01-10 06:59:53,123 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:59:53,124 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-10 06:59:53,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:59:53,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:53,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080137353] [2025-01-10 06:59:53,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080137353] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:59:53,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570612181] [2025-01-10 06:59:53,164 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 06:59:53,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:59:53,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:53,166 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:59:53,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-01-10 06:59:53,198 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 13 statements into 6 equivalence classes. [2025-01-10 06:59:53,202 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:59:53,202 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-10 06:59:53,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:53,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:59:53,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:59:53,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:59:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:59:53,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570612181] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:59:53,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:59:53,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-01-10 06:59:53,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844719766] [2025-01-10 06:59:53,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:59:53,283 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:53,284 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:53,284 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:53,284 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:53,284 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:53,284 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:53,284 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:53,284 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:53,284 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration7_Loop [2025-01-10 06:59:53,284 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:53,284 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:53,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:53,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:53,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:53,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:53,328 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:53,328 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:53,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:53,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:53,334 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:53,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-01-10 06:59:53,336 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:53,336 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:53,353 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:53,354 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:53,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-01-10 06:59:53,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:53,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:53,361 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:53,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-01-10 06:59:53,364 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:53,364 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:53,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:53,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:53,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:53,382 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:53,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-01-10 06:59:53,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:53,384 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:53,415 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:53,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:53,419 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:53,419 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:53,419 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:53,419 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:53,420 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:53,420 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:53,420 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:53,420 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:53,420 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration7_Loop [2025-01-10 06:59:53,420 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:53,420 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:53,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:53,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:53,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:53,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:53,463 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:53,464 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:53,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:53,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:53,466 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:53,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:53,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-01-10 06:59:53,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:53,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:53,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:53,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:53,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:53,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:53,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:53,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-01-10 06:59:53,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:53,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:53,496 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:53,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-01-10 06:59:53,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:53,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:53,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:53,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:53,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:53,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:53,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:53,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:53,516 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:53,520 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 06:59:53,520 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 06:59:53,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:53,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:53,524 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:53,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-01-10 06:59:53,527 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:53,527 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:53,527 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:53,527 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-01-10 06:59:53,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-01-10 06:59:53,540 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:53,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:53,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:59:53,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:59:53,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:53,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:53,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:53,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:53,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:53,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:53,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:53,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:53,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:59:53,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:53,612 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-01-10 06:59:53,612 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.4) 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-01-10 06:59:53,641 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.4) 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) Result 81 states and 108 transitions. Complement of second has 9 states. [2025-01-10 06:59:53,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) 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-01-10 06:59:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2025-01-10 06:59:53,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 7 letters. Loop has 6 letters. [2025-01-10 06:59:53,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:53,643 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:53,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:53,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:59:53,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:59:53,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:53,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:53,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:53,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:53,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:53,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:53,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:53,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:53,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:59:53,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:53,713 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2025-01-10 06:59:53,713 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.4) 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-01-10 06:59:53,745 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.4) 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) Result 77 states and 105 transitions. Complement of second has 9 states. [2025-01-10 06:59:53,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) 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-01-10 06:59:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2025-01-10 06:59:53,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 7 letters. Loop has 6 letters. [2025-01-10 06:59:53,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:53,746 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:53,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:53,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:59:53,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:59:53,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:53,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:53,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:53,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:53,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:53,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:53,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:53,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:53,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:59:53,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:53,818 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 4 loop predicates [2025-01-10 06:59:53,818 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.4) 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-01-10 06:59:53,842 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.4) 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) Result 72 states and 99 transitions. Complement of second has 13 states. [2025-01-10 06:59:53,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) 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-01-10 06:59:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2025-01-10 06:59:53,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2025-01-10 06:59:53,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:53,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2025-01-10 06:59:53,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:53,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 7 letters. Loop has 12 letters. [2025-01-10 06:59:53,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:53,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 99 transitions. [2025-01-10 06:59:53,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-01-10 06:59:53,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 57 states and 81 transitions. [2025-01-10 06:59:53,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 06:59:53,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-01-10 06:59:53,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 81 transitions. [2025-01-10 06:59:53,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:53,846 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 81 transitions. [2025-01-10 06:59:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 81 transitions. [2025-01-10 06:59:53,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2025-01-10 06:59:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 40 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2025-01-10 06:59:53,848 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 61 transitions. [2025-01-10 06:59:53,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:53,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:59:53,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:59:53,849 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:53,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:53,862 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2025-01-10 06:59:53,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 107 transitions. [2025-01-10 06:59:53,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2025-01-10 06:59:53,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 59 states and 85 transitions. [2025-01-10 06:59:53,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-01-10 06:59:53,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 06:59:53,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 85 transitions. [2025-01-10 06:59:53,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:53,864 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 85 transitions. [2025-01-10 06:59:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 85 transitions. [2025-01-10 06:59:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2025-01-10 06:59:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 51 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-01-10 06:59:53,867 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-01-10 06:59:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:59:53,867 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-01-10 06:59:53,868 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 06:59:53,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 75 transitions. [2025-01-10 06:59:53,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2025-01-10 06:59:53,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:53,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:53,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1] [2025-01-10 06:59:53,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 4, 3] [2025-01-10 06:59:53,869 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 06:59:53,869 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 06:59:53,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash 344990198, now seen corresponding path program 7 times [2025-01-10 06:59:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:53,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495233946] [2025-01-10 06:59:53,869 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 06:59:53,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:53,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:59:53,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:59:53,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:53,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:53,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:53,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:59:53,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:59:53,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:53,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:53,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:53,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:53,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1064315910, now seen corresponding path program 3 times [2025-01-10 06:59:53,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:53,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546698807] [2025-01-10 06:59:53,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:53,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:53,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 7 equivalence classes. [2025-01-10 06:59:53,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:59:53,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-10 06:59:53,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:59:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:53,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546698807] [2025-01-10 06:59:53,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546698807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:59:53,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:59:53,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:59:53,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982839573] [2025-01-10 06:59:53,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:59:53,917 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 06:59:53,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:53,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:59:53,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:59:53,918 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. cyclomatic complexity: 28 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:53,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:53,923 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2025-01-10 06:59:53,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 95 transitions. [2025-01-10 06:59:53,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2025-01-10 06:59:53,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 55 states and 75 transitions. [2025-01-10 06:59:53,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 06:59:53,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-01-10 06:59:53,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 75 transitions. [2025-01-10 06:59:53,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:53,925 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 75 transitions. [2025-01-10 06:59:53,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 75 transitions. [2025-01-10 06:59:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2025-01-10 06:59:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-01-10 06:59:53,927 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-01-10 06:59:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:59:53,928 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-01-10 06:59:53,928 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 06:59:53,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 69 transitions. [2025-01-10 06:59:53,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2025-01-10 06:59:53,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:53,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:53,934 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1] [2025-01-10 06:59:53,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 5, 3] [2025-01-10 06:59:53,934 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 06:59:53,935 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 06:59:53,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:53,935 INFO L85 PathProgramCache]: Analyzing trace with hash 344990198, now seen corresponding path program 8 times [2025-01-10 06:59:53,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:53,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658906347] [2025-01-10 06:59:53,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:53,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:53,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-01-10 06:59:53,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:59:53,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:53,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:53,940 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:53,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:59:53,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:59:53,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:53,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:53,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:53,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:53,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1471978275, now seen corresponding path program 4 times [2025-01-10 06:59:53,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:53,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981038491] [2025-01-10 06:59:53,971 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:59:53,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:53,974 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:59:53,977 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:59:53,978 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:59:53,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:53,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-01-10 06:59:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:54,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981038491] [2025-01-10 06:59:54,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981038491] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:59:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805499101] [2025-01-10 06:59:54,051 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:59:54,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:59:54,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:54,053 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:59:54,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-01-10 06:59:54,070 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:59:54,075 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:59:54,075 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:59:54,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:54,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:59:54,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:54,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:59:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:54,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805499101] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:59:54,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:59:54,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-01-10 06:59:54,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193905410] [2025-01-10 06:59:54,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:59:54,149 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 06:59:54,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:54,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 06:59:54,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-01-10 06:59:54,150 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. cyclomatic complexity: 25 Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:54,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:54,183 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2025-01-10 06:59:54,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 168 transitions. [2025-01-10 06:59:54,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2025-01-10 06:59:54,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 93 states and 107 transitions. [2025-01-10 06:59:54,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 06:59:54,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-01-10 06:59:54,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 107 transitions. [2025-01-10 06:59:54,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:54,184 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 107 transitions. [2025-01-10 06:59:54,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 107 transitions. [2025-01-10 06:59:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2025-01-10 06:59:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.15) internal successors, (92), 79 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2025-01-10 06:59:54,187 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 92 transitions. [2025-01-10 06:59:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:59:54,188 INFO L432 stractBuchiCegarLoop]: Abstraction has 80 states and 92 transitions. [2025-01-10 06:59:54,188 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-01-10 06:59:54,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 92 transitions. [2025-01-10 06:59:54,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2025-01-10 06:59:54,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:54,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:54,189 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2025-01-10 06:59:54,189 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 7, 6] [2025-01-10 06:59:54,189 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-01-10 06:59:54,189 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-01-10 06:59:54,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:54,190 INFO L85 PathProgramCache]: Analyzing trace with hash 889540237, now seen corresponding path program 4 times [2025-01-10 06:59:54,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:54,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137788845] [2025-01-10 06:59:54,190 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:59:54,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:54,192 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6 statements into 2 equivalence classes. [2025-01-10 06:59:54,193 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:54,193 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:59:54,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:54,193 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:54,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:54,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:54,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:54,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:54,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:54,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:54,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1322890956, now seen corresponding path program 5 times [2025-01-10 06:59:54,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:54,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762209124] [2025-01-10 06:59:54,196 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 06:59:54,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:54,199 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 13 equivalence classes. [2025-01-10 06:59:54,210 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:59:54,211 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-01-10 06:59:54,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:54,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:54,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:59:54,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:59:54,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:54,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:54,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:54,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:54,217 INFO L85 PathProgramCache]: Analyzing trace with hash 89866432, now seen corresponding path program 9 times [2025-01-10 06:59:54,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:54,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797092272] [2025-01-10 06:59:54,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:54,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:54,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 15 equivalence classes. [2025-01-10 06:59:54,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 06:59:54,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-01-10 06:59:54,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:54,229 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:54,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 06:59:54,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 06:59:54,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:54,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:54,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:54,436 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:54,437 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:54,437 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:54,437 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:54,437 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:54,437 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:54,437 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:54,437 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:54,437 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration10_Loop [2025-01-10 06:59:54,437 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:54,437 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:54,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:54,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:54,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:54,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:54,482 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:54,483 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:54,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:54,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:54,485 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:54,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-01-10 06:59:54,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:54,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:54,505 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:54,505 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:54,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:54,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:54,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:54,516 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:54,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-01-10 06:59:54,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:54,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:54,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:54,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:54,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:54,538 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:54,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-01-10 06:59:54,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:54,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:54,575 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:54,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-01-10 06:59:54,580 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:54,580 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:54,580 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:54,580 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:54,580 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:54,580 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:54,580 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:54,580 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:54,580 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration10_Loop [2025-01-10 06:59:54,580 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:54,580 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:54,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:54,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:54,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:54,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:54,638 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:54,638 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:54,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:54,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:54,642 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:54,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-01-10 06:59:54,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:54,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:54,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:54,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:54,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:54,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:54,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:54,659 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:54,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:54,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:54,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:54,667 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:54,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-01-10 06:59:54,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:54,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:54,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:54,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:54,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:54,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:54,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:54,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:54,683 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:54,685 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 06:59:54,685 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 06:59:54,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:54,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:54,688 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:54,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-01-10 06:59:54,690 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:54,690 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:54,690 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:54,690 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2025-01-10 06:59:54,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-01-10 06:59:54,696 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:54,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:54,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:54,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:54,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:54,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:54,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:54,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:54,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:54,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:59:54,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:59:54,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:54,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:54,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:59:54,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 66 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:54,950 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2025-01-10 06:59:54,950 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17 Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:54,954 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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 86 states and 101 transitions. Complement of second has 5 states. [2025-01-10 06:59:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 06:59:54,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 26 letters. [2025-01-10 06:59:54,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:54,955 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:54,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:54,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:54,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:54,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:54,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:54,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:54,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:54,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:59:54,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:59:54,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:54,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:54,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:59:54,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 66 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:55,214 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 13 loop predicates [2025-01-10 06:59:55,214 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17 Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:55,222 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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 86 states and 101 transitions. Complement of second has 5 states. [2025-01-10 06:59:55,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:55,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 06:59:55,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 26 letters. [2025-01-10 06:59:55,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:55,224 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:55,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:55,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:55,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:55,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:55,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:55,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:55,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:55,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:59:55,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:59:55,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:55,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:55,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:59:55,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 66 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:55,487 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 13 loop predicates [2025-01-10 06:59:55,487 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17 Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:55,493 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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 115 states and 134 transitions. Complement of second has 4 states. [2025-01-10 06:59:55,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-01-10 06:59:55,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 26 letters. [2025-01-10 06:59:55,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:55,495 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:55,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:55,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:55,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:55,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:55,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:55,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:55,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:55,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:59:55,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:59:55,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:55,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:55,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:59:55,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 66 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:55,775 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 13 loop predicates [2025-01-10 06:59:55,775 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17 Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:55,811 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 92 transitions. cyclomatic complexity: 17. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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 137 states and 157 transitions. Complement of second has 8 states. [2025-01-10 06:59:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2025-01-10 06:59:55,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 6 letters. Loop has 26 letters. [2025-01-10 06:59:55,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:55,813 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:55,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:55,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:55,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:55,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:55,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:55,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:55,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:55,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:59:55,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:59:55,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:55,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:55,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:59:55,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:56,085 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 66 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:59:56,086 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2025-01-10 06:59:56,086 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 80 states and 92 transitions. cyclomatic complexity: 17 Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:56,139 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,141 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,141 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,141 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,141 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,187 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,188 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,188 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,188 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,219 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,220 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,220 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,220 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,258 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,259 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,259 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,259 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,295 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,296 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,296 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,296 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,337 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,337 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,338 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,338 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,338 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,339 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,339 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,339 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 06:59:56,344 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 80 states and 92 transitions. cyclomatic complexity: 17 Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 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 859 states and 1158 transitions. Complement of second has 221 states 28 powerset states193 rank states. The highest rank that occured is 7 [2025-01-10 06:59:56,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2025-01-10 06:59:56,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 63 transitions. Stem has 6 letters. Loop has 26 letters. [2025-01-10 06:59:56,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:56,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 63 transitions. Stem has 32 letters. Loop has 26 letters. [2025-01-10 06:59:56,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:56,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 63 transitions. Stem has 6 letters. Loop has 52 letters. [2025-01-10 06:59:56,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:56,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 859 states and 1158 transitions. [2025-01-10 06:59:56,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2025-01-10 06:59:56,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 859 states to 289 states and 350 transitions. [2025-01-10 06:59:56,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 06:59:56,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 06:59:56,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 350 transitions. [2025-01-10 06:59:56,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 06:59:56,363 INFO L218 hiAutomatonCegarLoop]: Abstraction has 289 states and 350 transitions. [2025-01-10 06:59:56,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 350 transitions. [2025-01-10 06:59:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 215. [2025-01-10 06:59:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 215 states have (on average 1.2186046511627906) internal successors, (262), 214 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 262 transitions. [2025-01-10 06:59:56,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 215 states and 262 transitions. [2025-01-10 06:59:56,371 INFO L432 stractBuchiCegarLoop]: Abstraction has 215 states and 262 transitions. [2025-01-10 06:59:56,371 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-01-10 06:59:56,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 215 states and 262 transitions. [2025-01-10 06:59:56,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2025-01-10 06:59:56,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:56,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:56,373 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2025-01-10 06:59:56,373 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 8, 7] [2025-01-10 06:59:56,374 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~c~0#1, main_~n~0#1;havoc main_~c~0#1;havoc main_~n~0#1;main_~c~0#1 := 1;havoc main_#t~nondet0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-01-10 06:59:56,374 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~n~0#1 > 100;main_~n~0#1 := main_~n~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~n~0#1 > 100);main_~n~0#1 := 11 + main_~n~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-01-10 06:59:56,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:56,374 INFO L85 PathProgramCache]: Analyzing trace with hash 889540237, now seen corresponding path program 5 times [2025-01-10 06:59:56,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:56,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631582402] [2025-01-10 06:59:56,374 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 06:59:56,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:56,377 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-01-10 06:59:56,378 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:56,379 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:56,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:56,379 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:56,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:56,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:56,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:56,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:56,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:56,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:56,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1246139396, now seen corresponding path program 6 times [2025-01-10 06:59:56,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:56,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549849854] [2025-01-10 06:59:56,382 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 06:59:56,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:56,384 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 15 equivalence classes. [2025-01-10 06:59:56,390 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:59:56,390 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-01-10 06:59:56,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:56,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:56,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:59:56,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:59:56,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:56,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:56,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:56,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:56,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1884274056, now seen corresponding path program 10 times [2025-01-10 06:59:56,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:56,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264916175] [2025-01-10 06:59:56,407 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:59:56,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:56,409 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-01-10 06:59:56,414 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:59:56,415 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:59:56,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:56,415 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:56,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:59:56,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:59:56,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:56,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:56,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:56,662 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:56,663 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:56,663 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:56,663 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:56,663 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 06:59:56,663 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:56,663 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:56,663 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:56,663 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration11_Loop [2025-01-10 06:59:56,663 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:56,663 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:56,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:56,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:56,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:56,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:56,703 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:56,703 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 06:59:56,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:56,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:56,705 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:56,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-01-10 06:59:56,708 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:56,708 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:56,727 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 06:59:56,727 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 06:59:56,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:56,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:56,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:56,736 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:56,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-01-10 06:59:56,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 06:59:56,739 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:56,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:56,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:56,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:56,757 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:56,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-01-10 06:59:56,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 06:59:56,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 06:59:56,809 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 06:59:56,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-01-10 06:59:56,814 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:56,814 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:56,814 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:56,814 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:56,814 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:56,814 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:56,814 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:56,814 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:56,814 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration.c_Iteration11_Loop [2025-01-10 06:59:56,814 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:56,814 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:56,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:56,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:56,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:56,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:56,871 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:56,871 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:56,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:56,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:56,874 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:56,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-01-10 06:59:56,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:56,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:56,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:56,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:56,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:56,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:56,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:56,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:56,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-01-10 06:59:56,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:56,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:56,910 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:56,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-01-10 06:59:56,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:56,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:56,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:56,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:56,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:56,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:56,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:56,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:56,927 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:56,929 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 06:59:56,929 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 06:59:56,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:56,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:56,932 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:56,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-01-10 06:59:56,933 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:56,933 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 06:59:56,933 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:56,934 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = 1*ULTIMATE.start_main_~c~0#1 Supporting invariants [] [2025-01-10 06:59:56,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-01-10 06:59:56,940 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 06:59:56,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:56,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:56,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:56,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:56,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:56,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:56,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:56,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:59:56,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:59:56,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:56,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:56,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 06:59:56,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 102 proven. 48 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 06:59:57,123 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-01-10 06:59:57,124 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-01-10 06:59:57,130 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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) Result 227 states and 286 transitions. Complement of second has 5 states. [2025-01-10 06:59:57,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-01-10 06:59:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 06:59:57,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 30 letters. [2025-01-10 06:59:57,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:57,131 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:57,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:57,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:57,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:57,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:57,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:57,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:57,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:57,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:59:57,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:59:57,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:57,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:57,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 06:59:57,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 102 proven. 48 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 06:59:57,309 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2025-01-10 06:59:57,309 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-01-10 06:59:57,314 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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) Result 227 states and 286 transitions. Complement of second has 5 states. [2025-01-10 06:59:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:57,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-01-10 06:59:57,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 06:59:57,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 30 letters. [2025-01-10 06:59:57,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:57,319 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:57,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:57,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:57,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:57,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-01-10 06:59:57,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:57,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:57,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:57,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:57,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:59:57,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:59:57,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:57,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:57,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 06:59:57,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 102 proven. 48 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 06:59:57,551 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 6 loop predicates [2025-01-10 06:59:57,552 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-01-10 06:59:57,594 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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) Result 329 states and 404 transitions. Complement of second has 7 states. [2025-01-10 06:59:57,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-01-10 06:59:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-01-10 06:59:57,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 30 letters. [2025-01-10 06:59:57,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:57,600 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 06:59:57,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:57,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:59:57,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:59:57,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:57,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:57,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:57,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:57,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:59:57,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:59:57,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:57,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:57,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 06:59:57,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 102 proven. 48 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-10 06:59:57,769 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2025-01-10 06:59:57,769 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-01-10 06:59:57,802 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 215 states and 262 transitions. cyclomatic complexity: 58. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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) Result 461 states and 551 transitions. Complement of second has 12 states. [2025-01-10 06:59:57,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-01-10 06:59:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-01-10 06:59:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2025-01-10 06:59:57,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 30 letters. [2025-01-10 06:59:57,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:57,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 36 letters. Loop has 30 letters. [2025-01-10 06:59:57,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:57,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 60 letters. [2025-01-10 06:59:57,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:57,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 461 states and 551 transitions. [2025-01-10 06:59:57,818 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 06:59:57,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 461 states to 0 states and 0 transitions. [2025-01-10 06:59:57,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 06:59:57,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 06:59:57,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 06:59:57,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 06:59:57,818 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:57,818 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:57,818 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 06:59:57,818 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-01-10 06:59:57,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 06:59:57,818 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 06:59:57,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 06:59:57,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 06:59:57 BoogieIcfgContainer [2025-01-10 06:59:57,836 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 06:59:57,837 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:59:57,840 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:59:57,840 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:59:57,841 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:59:49" (3/4) ... [2025-01-10 06:59:57,842 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 06:59:57,843 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:59:57,848 INFO L158 Benchmark]: Toolchain (without parser) took 8863.90ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.6MB in the beginning and 98.5MB in the end (delta: 15.1MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2025-01-10 06:59:57,848 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:57,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.91ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 103.9MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:59:57,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.65ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 102.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:57,849 INFO L158 Benchmark]: Boogie Preprocessor took 30.53ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 101.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:57,849 INFO L158 Benchmark]: RCFGBuilder took 165.46ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 93.1MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:59:57,850 INFO L158 Benchmark]: BuchiAutomizer took 8461.20ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 93.1MB in the beginning and 98.5MB in the end (delta: -5.4MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2025-01-10 06:59:57,850 INFO L158 Benchmark]: Witness Printer took 5.98ms. Allocated memory is still 176.2MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:59:57,852 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.19ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 160.91ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 103.9MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.65ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 102.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.53ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 101.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 165.46ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 93.1MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 8461.20ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 93.1MB in the beginning and 98.5MB in the end (delta: -5.4MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * Witness Printer took 5.98ms. Allocated memory is still 176.2MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (4 trivial, 3 deterministic, 6 nondeterministic). One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function (211 + ((long) -2 * n)) and consists of 3 locations. One nondeterministic module has affine ranking function n and consists of 3 locations. One nondeterministic module has affine ranking function (211 + ((long) -2 * n)) and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -2 * n) + 201) and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 15 locations. One nondeterministic module has affine ranking function c and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 12 iterations. TraceHistogramMax:15. Analysis of lassos took 4.4s. Construction of modules took 0.2s. Büchi inclusion checks took 3.5s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 148 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 3, 1, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 233/374 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 193 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 159 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT7 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax163 hnf100 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp98 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-01-10 06:59:57,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:58,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:58,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE