./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.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-restricted-15/McCarthyIterative.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 faa806fd1be90697a522dfc0988145f6572d5d87fac98caf7aa5fe5b66e6095c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:02:16,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:02:16,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 07:02:16,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:02:16,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:02:16,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:02:16,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:02:16,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:02:16,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:02:16,531 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:02:16,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:02:16,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:02:16,532 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:02:16,532 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:02:16,532 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:02:16,532 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:02:16,533 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:02:16,533 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:02:16,533 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:02:16,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:02:16,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:02:16,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:02:16,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:02:16,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:02:16,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:02:16,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:02:16,534 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:02:16,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:02:16,534 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:02:16,534 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:02:16,535 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:02:16,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:02:16,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:02:16,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:02:16,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:02:16,536 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:02:16,536 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 -> faa806fd1be90697a522dfc0988145f6572d5d87fac98caf7aa5fe5b66e6095c [2025-01-10 07:02:16,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:02:16,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:02:16,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:02:16,837 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:02:16,837 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:02:16,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2025-01-10 07:02:18,086 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/309561e2f/3f47a98376594b819db85fd264a6df7c/FLAG0782b304d [2025-01-10 07:02:18,341 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:02:18,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2025-01-10 07:02:18,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/309561e2f/3f47a98376594b819db85fd264a6df7c/FLAG0782b304d [2025-01-10 07:02:18,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/309561e2f/3f47a98376594b819db85fd264a6df7c [2025-01-10 07:02:18,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:02:18,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:02:18,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:02:18,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:02:18,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:02:18,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:02:18" (1/1) ... [2025-01-10 07:02:18,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6961ef5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18, skipping insertion in model container [2025-01-10 07:02:18,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:02:18" (1/1) ... [2025-01-10 07:02:18,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:02:18,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:02:18,511 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:02:18,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:02:18,533 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:02:18,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18 WrapperNode [2025-01-10 07:02:18,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:02:18,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:02:18,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:02:18,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:02:18,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18" (1/1) ... [2025-01-10 07:02:18,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18" (1/1) ... [2025-01-10 07:02:18,557 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 16 [2025-01-10 07:02:18,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:02:18,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:02:18,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:02:18,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:02:18,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18" (1/1) ... [2025-01-10 07:02:18,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18" (1/1) ... [2025-01-10 07:02:18,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18" (1/1) ... [2025-01-10 07:02:18,569 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 07:02:18,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18" (1/1) ... [2025-01-10 07:02:18,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18" (1/1) ... [2025-01-10 07:02:18,572 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18" (1/1) ... [2025-01-10 07:02:18,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18" (1/1) ... [2025-01-10 07:02:18,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18" (1/1) ... [2025-01-10 07:02:18,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18" (1/1) ... [2025-01-10 07:02:18,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18" (1/1) ... [2025-01-10 07:02:18,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:02:18,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:02:18,581 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:02:18,581 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:02:18,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18" (1/1) ... [2025-01-10 07:02:18,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:18,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:18,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:18,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:02:18,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:02:18,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:02:18,698 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:02:18,700 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:02:18,754 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-01-10 07:02:18,756 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:02:18,764 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:02:18,765 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:02:18,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:02:18 BoogieIcfgContainer [2025-01-10 07:02:18,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:02:18,767 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:02:18,767 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:02:18,772 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:02:18,773 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:02:18,773 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:02:18" (1/3) ... [2025-01-10 07:02:18,774 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61632e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:02:18, skipping insertion in model container [2025-01-10 07:02:18,774 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:02:18,774 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:02:18" (2/3) ... [2025-01-10 07:02:18,775 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61632e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:02:18, skipping insertion in model container [2025-01-10 07:02:18,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:02:18,775 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:02:18" (3/3) ... [2025-01-10 07:02:18,776 INFO L363 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative.c [2025-01-10 07:02:18,821 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:02:18,822 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:02:18,822 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:02:18,822 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:02:18,822 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:02:18,823 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:02:18,823 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:02:18,823 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:02:18,828 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 07:02:18,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:18,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:18,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:18,847 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:02:18,847 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:18,847 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:02:18,848 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 07:02:18,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:18,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:18,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:18,849 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:02:18,849 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:18,856 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_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1;" [2025-01-10 07:02:18,856 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" [2025-01-10 07:02:18,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:18,862 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:02:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:18,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800861971] [2025-01-10 07:02:18,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:18,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:18,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:18,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:18,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:18,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:18,940 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:18,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:18,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:18,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:18,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:18,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:18,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1156, now seen corresponding path program 1 times [2025-01-10 07:02:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:18,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240600275] [2025-01-10 07:02:18,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:18,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:18,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:18,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:18,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:18,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:18,975 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:18,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:18,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:18,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:18,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:18,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:18,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:18,987 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2025-01-10 07:02:18,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:18,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041399923] [2025-01-10 07:02:18,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:18,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:18,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:19,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:19,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:19,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:19,006 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:19,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:19,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:19,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:19,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:19,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:19,111 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:19,112 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:19,112 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:19,112 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:19,112 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:19,113 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:19,113 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:19,113 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:19,113 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2025-01-10 07:02:19,113 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:19,113 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:19,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:19,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:19,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:19,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:19,258 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:19,258 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:19,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:19,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:19,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:19,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:02:19,267 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:19,267 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:19,293 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:19,294 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:19,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:19,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:19,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:19,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:19,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:02:19,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:19,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:19,331 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:19,331 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:19,339 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 07:02:19,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:19,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:19,342 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:19,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:02:19,345 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:19,345 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:19,367 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 07:02:19,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:19,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:19,370 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:19,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:02:19,373 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:19,373 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:19,409 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:19,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:02:19,415 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:19,415 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:19,415 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:19,415 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:19,415 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:19,415 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:19,415 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:19,415 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:19,415 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2025-01-10 07:02:19,415 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:19,415 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:19,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:19,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:19,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:19,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:19,514 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:19,518 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:19,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:19,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:19,522 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:19,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:19,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:02:19,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:19,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:19,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:19,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:19,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:19,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:19,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:19,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-01-10 07:02:19,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:19,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:19,564 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:19,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:02:19,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:19,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:19,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:19,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:19,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:19,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:19,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:19,597 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:19,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 07:02:19,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:19,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:19,608 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:19,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:02:19,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:19,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:19,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:19,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:19,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:19,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:19,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:19,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:19,628 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:19,634 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-01-10 07:02:19,636 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:02:19,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:19,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:19,642 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:19,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:02:19,645 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:19,645 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:19,645 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:19,646 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 07:02:19,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-01-10 07:02:19,658 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:19,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:19,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:19,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:19,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:19,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:19,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:19,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:19,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:19,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:19,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:19,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:19,710 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:19,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:19,762 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:02:19,764 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 07:02:19,804 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 07:02:19,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:19,809 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 07:02:19,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-01-10 07:02:19,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2025-01-10 07:02:19,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:19,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2025-01-10 07:02:19,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:19,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2025-01-10 07:02:19,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:19,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-01-10 07:02:19,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:19,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 11 transitions. [2025-01-10 07:02:19,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 07:02:19,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-01-10 07:02:19,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2025-01-10 07:02:19,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:19,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 07:02:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2025-01-10 07:02:19,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-01-10 07:02:19,842 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 07:02:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-01-10 07:02:19,844 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 07:02:19,844 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 07:02:19,844 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:02:19,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2025-01-10 07:02:19,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:19,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:19,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:19,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:02:19,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:19,845 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_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-01-10 07:02:19,845 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" [2025-01-10 07:02:19,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:19,845 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2025-01-10 07:02:19,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:19,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293348839] [2025-01-10 07:02:19,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:19,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:19,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:19,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:19,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:19,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:19,856 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:19,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:19,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:19,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:19,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:19,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:19,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:19,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1156, now seen corresponding path program 2 times [2025-01-10 07:02:19,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:19,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312029687] [2025-01-10 07:02:19,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:19,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:19,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:19,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:19,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:02:19,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:19,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:19,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:19,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:19,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:19,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:19,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:19,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:19,876 INFO L85 PathProgramCache]: Analyzing trace with hash 889540235, now seen corresponding path program 1 times [2025-01-10 07:02:19,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:19,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283895506] [2025-01-10 07:02:19,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:19,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:19,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:19,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:19,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:19,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:19,883 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:19,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:19,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:19,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:19,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:19,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:19,927 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:19,927 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:19,927 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:19,927 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:19,927 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:19,927 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:19,927 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:19,928 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:19,928 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2025-01-10 07:02:19,928 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:19,928 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:19,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:19,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:19,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:19,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:20,001 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:20,001 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:20,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:20,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:20,004 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:20,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:02:20,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:20,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:20,029 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:20,030 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:20,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-01-10 07:02:20,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:20,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:20,038 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:20,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:02:20,040 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:20,040 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:20,058 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:20,058 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 07:02:20,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 07:02:20,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:20,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:20,067 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:20,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:02:20,068 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:20,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:20,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-01-10 07:02:20,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:20,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:20,090 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:20,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:02:20,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:20,094 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:20,121 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:20,126 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 07:02:20,126 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:20,126 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:20,126 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:20,126 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:20,126 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:20,126 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:20,126 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:20,126 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:20,126 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2025-01-10 07:02:20,126 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:20,126 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:20,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:20,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:20,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:20,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:20,195 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:20,195 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:20,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:20,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:20,198 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:20,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:02:20,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:20,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:20,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:20,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:20,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:20,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:20,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:20,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:20,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-01-10 07:02:20,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-01-10 07:02:20,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:20,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:20,258 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:20,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 07:02:20,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:20,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:20,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:20,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:20,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:20,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:20,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:20,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:20,283 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 07:02:20,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:20,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:20,285 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:20,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 07:02:20,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:20,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:20,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:20,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:20,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:20,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:20,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:20,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:20,301 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:20,305 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-01-10 07:02:20,306 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:02:20,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:20,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:20,308 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:20,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-01-10 07:02:20,311 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:20,311 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:20,311 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:20,311 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 07:02:20,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-01-10 07:02:20,318 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:20,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:20,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:20,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:20,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:20,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:20,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:20,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:20,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:20,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:20,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:20,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:20,366 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:20,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:20,387 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:02:20,387 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 07:02:20,409 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 07:02:20,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-01-10 07:02:20,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2025-01-10 07:02:20,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:20,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-01-10 07:02:20,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:20,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2025-01-10 07:02:20,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:20,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-01-10 07:02:20,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:20,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2025-01-10 07:02:20,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:02:20,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:02:20,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-01-10 07:02:20,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:20,414 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-01-10 07:02:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-01-10 07:02:20,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-01-10 07:02:20,416 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 07:02:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-01-10 07:02:20,416 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-01-10 07:02:20,416 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-01-10 07:02:20,416 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:02:20,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2025-01-10 07:02:20,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-01-10 07:02:20,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:20,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:20,417 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2025-01-10 07:02:20,417 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:20,417 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_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-01-10 07:02:20,417 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" [2025-01-10 07:02:20,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:20,418 INFO L85 PathProgramCache]: Analyzing trace with hash 889540237, now seen corresponding path program 2 times [2025-01-10 07:02:20,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:20,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318372933] [2025-01-10 07:02:20,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:20,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:20,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-01-10 07:02:20,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:20,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:20,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:20,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:20,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:20,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:20,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:20,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:20,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:20,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:20,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1156, now seen corresponding path program 3 times [2025-01-10 07:02:20,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:20,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129681644] [2025-01-10 07:02:20,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:20,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:20,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:20,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:20,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:02:20,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:20,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:20,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:20,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:20,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:20,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:20,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:20,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:20,462 INFO L85 PathProgramCache]: Analyzing trace with hash 149676048, now seen corresponding path program 2 times [2025-01-10 07:02:20,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:20,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032109511] [2025-01-10 07:02:20,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:20,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:20,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-01-10 07:02:20,475 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:20,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:20,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:20,477 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:20,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:20,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:20,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:20,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:20,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:20,517 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:20,517 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:20,517 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:20,517 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:20,517 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:20,517 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:20,517 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:20,517 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:20,517 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2025-01-10 07:02:20,517 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:20,517 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:20,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:20,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:20,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:20,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:20,595 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:20,596 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:20,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:20,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:20,598 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:20,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-01-10 07:02:20,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:20,601 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:20,622 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 07:02:20,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:20,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:20,626 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:20,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-01-10 07:02:20,629 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:20,629 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:20,658 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:20,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-01-10 07:02:20,663 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:20,664 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:20,664 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:20,664 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:20,664 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:20,664 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:20,664 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:20,664 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:20,664 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2025-01-10 07:02:20,664 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:20,664 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:20,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:20,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:20,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:20,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:20,741 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:20,742 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:20,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:20,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:20,744 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:20,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-01-10 07:02:20,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:20,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:20,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:20,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:20,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:20,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:20,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:20,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:20,765 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:20,768 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-01-10 07:02:20,769 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:02:20,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:20,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:20,772 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:20,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-01-10 07:02:20,774 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:20,774 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:20,774 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:20,774 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-01-10 07:02:20,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-01-10 07:02:20,781 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:20,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:20,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:20,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:20,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:20,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:20,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:20,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:20,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:20,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:20,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:20,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:20,816 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:20,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:20,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:20,818 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 07:02:20,818 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 07:02:20,827 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 07:02:20,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-01-10 07:02:20,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-01-10 07:02:20,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:20,828 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:20,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:20,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:20,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:20,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:20,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:20,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:20,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:20,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:20,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:20,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:20,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:20,866 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:20,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:20,870 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 07:02:20,870 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 07:02:20,877 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 07:02:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:20,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-01-10 07:02:20,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-01-10 07:02:20,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:20,879 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:20,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:20,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:20,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:20,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:20,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:20,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:20,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:20,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:20,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:20,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:20,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:20,915 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:20,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:20,918 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 07:02:20,919 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 07:02:20,932 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 07:02:20,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-01-10 07:02:20,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2025-01-10 07:02:20,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:20,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2025-01-10 07:02:20,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:20,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2025-01-10 07:02:20,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:20,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 24 transitions. [2025-01-10 07:02:20,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:02:20,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 20 transitions. [2025-01-10 07:02:20,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 07:02:20,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:02:20,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2025-01-10 07:02:20,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:20,937 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-01-10 07:02:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2025-01-10 07:02:20,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 6. [2025-01-10 07:02:20,940 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 07:02:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2025-01-10 07:02:20,941 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-01-10 07:02:20,941 INFO L432 stractBuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-01-10 07:02:20,941 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:02:20,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2025-01-10 07:02:20,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:02:20,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:20,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:20,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:02:20,942 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:20,942 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_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1;" [2025-01-10 07:02:20,942 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-01-10 07:02:20,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:20,943 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2025-01-10 07:02:20,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:20,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431259064] [2025-01-10 07:02:20,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:20,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:20,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:20,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:20,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:02:20,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:20,946 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:20,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:20,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:20,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:20,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:20,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:20,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:20,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1158, now seen corresponding path program 1 times [2025-01-10 07:02:20,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:20,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840767138] [2025-01-10 07:02:20,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:20,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:20,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:20,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:20,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:20,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:20,956 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:20,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:20,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:20,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:20,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:20,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:20,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 3 times [2025-01-10 07:02:20,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:20,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021178528] [2025-01-10 07:02:20,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:20,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:20,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:20,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:20,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:02:20,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:20,967 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:20,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:20,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:20,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:20,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:20,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:21,019 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:21,020 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:21,020 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:21,020 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:21,020 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:21,020 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,020 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:21,020 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:21,020 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2025-01-10 07:02:21,020 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:21,020 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:21,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,082 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:21,082 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:21,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:21,084 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:21,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-01-10 07:02:21,088 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:21,088 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:21,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-01-10 07:02:21,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:21,112 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:21,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-01-10 07:02:21,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:21,116 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:21,143 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:21,144 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 07:02:21,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-01-10 07:02:21,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:21,154 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 07:02:21,157 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 07:02:21,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:21,158 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:21,177 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 07:02:21,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:21,180 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 07:02:21,183 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 07:02:21,183 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:21,183 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:21,208 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:21,212 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 07:02:21,212 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:21,212 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:21,213 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:21,213 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:21,213 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:21,213 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,213 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:21,213 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:21,213 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2025-01-10 07:02:21,213 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:21,213 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:21,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,273 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:21,274 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:21,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:21,276 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 07:02:21,277 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 07:02:21,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:21,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:21,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:21,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:21,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:21,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:21,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:21,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:21,292 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:21,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-01-10 07:02:21,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:21,302 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 07:02:21,305 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 07:02:21,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:21,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:21,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:21,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:21,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:21,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:21,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:21,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:21,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:21,322 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:21,322 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:02:21,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:21,325 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 07:02:21,326 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 07:02:21,326 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:21,326 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:21,326 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:21,326 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 211 Supporting invariants [] [2025-01-10 07:02:21,332 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 07:02:21,333 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:21,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:21,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:21,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:21,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:21,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:21,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:21,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:21,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:21,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:21,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:21,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:21,364 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:21,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:21,368 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 07:02:21,368 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 07:02:21,376 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 07:02:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:21,377 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 07:02:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-01-10 07:02:21,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2025-01-10 07:02:21,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:21,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2025-01-10 07:02:21,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:21,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2025-01-10 07:02:21,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:21,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2025-01-10 07:02:21,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:02:21,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 14 transitions. [2025-01-10 07:02:21,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 07:02:21,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-01-10 07:02:21,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-01-10 07:02:21,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:21,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-01-10 07:02:21,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-01-10 07:02:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-01-10 07:02:21,379 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 07:02:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2025-01-10 07:02:21,380 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-01-10 07:02:21,380 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-01-10 07:02:21,380 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:02:21,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2025-01-10 07:02:21,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:02:21,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:21,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:21,381 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2025-01-10 07:02:21,381 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:02:21,381 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_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 07:02:21,381 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" [2025-01-10 07:02:21,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:21,382 INFO L85 PathProgramCache]: Analyzing trace with hash 28694784, now seen corresponding path program 2 times [2025-01-10 07:02:21,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:21,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440482924] [2025-01-10 07:02:21,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:21,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:21,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 2 equivalence classes. [2025-01-10 07:02:21,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:02:21,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:21,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:21,440 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 07:02:21,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:21,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440482924] [2025-01-10 07:02:21,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440482924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:02:21,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:02:21,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:02:21,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774488727] [2025-01-10 07:02:21,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:02:21,443 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:02:21,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:21,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1308, now seen corresponding path program 2 times [2025-01-10 07:02:21,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:21,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347750601] [2025-01-10 07:02:21,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:21,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:21,446 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:21,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:21,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:02:21,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:21,447 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:21,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:21,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:21,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:21,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:21,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:21,474 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:21,474 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:21,474 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:21,474 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:21,474 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:21,474 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,474 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:21,474 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:21,474 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2025-01-10 07:02:21,474 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:21,474 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:21,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,530 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:21,531 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:21,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:21,533 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 07:02:21,534 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 07:02:21,535 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:21,535 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:21,550 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 07:02:21,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:21,553 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 07:02:21,554 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 07:02:21,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:21,555 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:21,579 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:21,583 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 07:02:21,583 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:21,583 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:21,583 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:21,583 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:21,583 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:21,583 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,583 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:21,583 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:21,583 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2025-01-10 07:02:21,583 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:21,583 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:21,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:21,638 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:21,638 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:21,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:21,643 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 07:02:21,644 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 07:02:21,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 07:02:21,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:21,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:21,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:21,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:21,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:21,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:21,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:21,670 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 07:02:21,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:21,673 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 07:02:21,675 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 07:02:21,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:21,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:21,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:21,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:21,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:21,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:21,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:21,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:21,693 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:21,695 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:21,695 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:02:21,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:21,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:21,698 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 07:02:21,701 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 07:02:21,702 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:21,702 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:21,702 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:21,702 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 211 Supporting invariants [] [2025-01-10 07:02:21,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:21,712 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:21,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:21,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:02:21,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:02:21,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:21,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:21,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:21,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:21,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:21,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:21,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:21,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:21,738 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:21,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:21,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:21,768 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:02:21,768 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 07:02:21,780 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 07:02:21,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:21,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-01-10 07:02:21,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2025-01-10 07:02:21,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:21,781 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:21,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:21,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:02:21,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:02:21,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:21,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:21,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:21,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:21,817 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 07:02:21,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:21,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:21,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-01-10 07:02:21,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:21,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:21,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:21,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:21,837 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:21,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:21,854 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:02:21,854 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 07:02:21,871 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 07:02:21,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 07:02:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:21,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 07:02:21,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 2 letters. [2025-01-10 07:02:21,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:21,872 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:21,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:21,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:02:21,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:02:21,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:21,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:21,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:21,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:21,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:02:21,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:02:21,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:21,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:21,904 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:02:21,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:21,924 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:02:21,924 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 07:02:21,931 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 07:02:21,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-01-10 07:02:21,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2025-01-10 07:02:21,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:21,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2025-01-10 07:02:21,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:21,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2025-01-10 07:02:21,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:21,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2025-01-10 07:02:21,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-01-10 07:02:21,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 17 transitions. [2025-01-10 07:02:21,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 07:02:21,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 07:02:21,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2025-01-10 07:02:21,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:21,934 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-01-10 07:02:21,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2025-01-10 07:02:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2025-01-10 07:02:21,934 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 07:02:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-01-10 07:02:21,934 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-01-10 07:02:21,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:21,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:02:21,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:02:21,938 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 07:02:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:21,957 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2025-01-10 07:02:21,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2025-01-10 07:02:21,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:21,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 11 transitions. [2025-01-10 07:02:21,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 07:02:21,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 07:02:21,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2025-01-10 07:02:21,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:21,960 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-01-10 07:02:21,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2025-01-10 07:02:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-01-10 07:02:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2025-01-10 07:02:21,962 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-01-10 07:02:21,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:02:21,963 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-01-10 07:02:21,965 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:02:21,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2025-01-10 07:02:21,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:02:21,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:21,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:21,965 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2025-01-10 07:02:21,965 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-01-10 07:02:21,966 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_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 07:02:21,966 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 07:02:21,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:21,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1805943515, now seen corresponding path program 3 times [2025-01-10 07:02:21,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:21,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545342614] [2025-01-10 07:02:21,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:21,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:21,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 3 equivalence classes. [2025-01-10 07:02:21,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:02:21,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 07:02:21,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:21,977 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:21,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:02:21,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:02:21,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:21,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:21,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:21,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:21,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1257273, now seen corresponding path program 1 times [2025-01-10 07:02:21,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:21,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888112569] [2025-01-10 07:02:21,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:02:21,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:21,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:21,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:21,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:21,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:21,987 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:21,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:21,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:21,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:21,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:21,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:21,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:21,990 INFO L85 PathProgramCache]: Analyzing trace with hash 765900051, now seen corresponding path program 4 times [2025-01-10 07:02:21,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:21,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799199095] [2025-01-10 07:02:21,990 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:02:21,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:21,992 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 11 statements into 2 equivalence classes. [2025-01-10 07:02:21,997 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 07:02:21,997 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:02:21,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:21,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:21,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:02:22,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:02:22,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:22,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:22,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:22,057 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:22,057 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:22,057 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:22,057 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:22,057 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:22,057 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:22,057 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:22,057 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:22,057 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2025-01-10 07:02:22,057 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:22,057 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:22,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:22,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:22,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:22,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:22,101 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:22,102 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:22,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:22,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:22,104 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 07:02:22,108 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 07:02:22,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:22,108 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:22,127 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:22,127 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 07:02:22,133 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 07:02:22,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:22,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:22,135 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 07:02:22,136 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 07:02:22,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:22,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:22,154 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:22,155 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 07:02:22,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-01-10 07:02:22,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:22,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:22,162 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 07:02:22,163 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 07:02:22,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:22,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:22,182 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:22,182 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 07:02:22,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-01-10 07:02:22,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:22,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:22,190 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 07:02:22,191 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 07:02:22,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:22,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:22,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-01-10 07:02:22,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:22,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:22,210 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 07:02:22,211 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 07:02:22,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:22,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:22,239 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:22,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-01-10 07:02:22,244 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:22,244 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:22,244 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:22,244 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:22,244 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:22,244 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:22,244 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:22,244 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:22,244 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2025-01-10 07:02:22,245 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:22,245 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:22,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:22,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:22,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:22,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:22,307 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:22,307 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:22,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:22,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:22,310 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 07:02:22,312 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 07:02:22,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:22,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:22,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:22,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:22,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:22,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:22,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:22,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:22,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:22,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:22,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:22,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:22,337 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 07:02:22,339 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 07:02:22,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:22,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:22,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:22,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:22,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:22,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:22,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:22,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:22,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-01-10 07:02:22,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:22,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:22,369 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 07:02:22,372 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 07:02:22,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:22,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:22,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:22,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:22,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:22,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:22,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:22,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:22,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-01-10 07:02:22,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:22,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:22,399 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 07:02:22,400 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 07:02:22,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:22,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:22,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:22,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:22,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:22,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:22,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:22,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:22,414 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:22,416 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:22,416 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:02:22,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:22,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:22,419 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 07:02:22,422 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 07:02:22,423 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:22,423 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:22,423 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:22,423 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 201 Supporting invariants [] [2025-01-10 07:02:22,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-01-10 07:02:22,432 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:22,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:22,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:02:22,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:02:22,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:22,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:22,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:22,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:22,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:22,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:22,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:22,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:22,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:02:22,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:22,510 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 07:02:22,512 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 07:02:22,513 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 07:02:22,521 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 07:02:22,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:22,522 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 07:02:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-01-10 07:02:22,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 4 letters. [2025-01-10 07:02:22,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:22,523 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:22,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:22,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:02:22,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:02:22,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:22,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:22,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:22,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:22,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:22,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:22,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:22,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:22,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:02:22,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:22,605 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 07:02:22,606 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 07:02:22,606 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 07:02:22,622 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 07:02:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:22,623 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 07:02:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 07:02:22,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 7 letters. Loop has 4 letters. [2025-01-10 07:02:22,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:22,624 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:22,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:22,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:02:22,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:02:22,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:22,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:22,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:22,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:22,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:22,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:22,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:22,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:22,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:02:22,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:22,692 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 07:02:22,692 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 07:02:22,692 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 07:02:22,699 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 07:02:22,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:22,700 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 07:02:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-01-10 07:02:22,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2025-01-10 07:02:22,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:22,701 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:22,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:22,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:02:22,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:02:22,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:22,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:22,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:22,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:22,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:22,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:22,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:22,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:22,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:02:22,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:22,763 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 07:02:22,764 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 07:02:22,765 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 07:02:22,779 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 07:02:22,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:22,781 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 07:02:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-01-10 07:02:22,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 4 letters. [2025-01-10 07:02:22,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:22,781 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:22,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:22,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:02:22,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:02:22,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:22,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:22,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:22,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:22,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:02:22,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:02:22,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:22,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:22,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:02:22,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:22,849 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 07:02:22,850 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 07:02:22,850 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 07:02:22,914 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 07:02:22,917 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 07:02:22,917 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 07:02:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2025-01-10 07:02:22,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2025-01-10 07:02:22,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:22,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 11 letters. Loop has 4 letters. [2025-01-10 07:02:22,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:22,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 8 letters. [2025-01-10 07:02:22,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:22,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 109 transitions. [2025-01-10 07:02:22,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-01-10 07:02:22,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 37 states and 51 transitions. [2025-01-10 07:02:22,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2025-01-10 07:02:22,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2025-01-10 07:02:22,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 51 transitions. [2025-01-10 07:02:22,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:22,925 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-01-10 07:02:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 51 transitions. [2025-01-10 07:02:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2025-01-10 07:02:22,927 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 07:02:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2025-01-10 07:02:22,930 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2025-01-10 07:02:22,930 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2025-01-10 07:02:22,930 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:02:22,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2025-01-10 07:02:22,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-01-10 07:02:22,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:22,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:22,931 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2025-01-10 07:02:22,931 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 1] [2025-01-10 07:02:22,931 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_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 07:02:22,931 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 07:02:22,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:22,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1805943515, now seen corresponding path program 5 times [2025-01-10 07:02:22,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:22,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232006569] [2025-01-10 07:02:22,933 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:02:22,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:22,936 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 3 equivalence classes. [2025-01-10 07:02:22,939 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:02:22,939 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 07:02:22,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:22,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:22,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:02:22,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:02:22,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:22,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:22,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:22,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:22,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1208239638, now seen corresponding path program 2 times [2025-01-10 07:02:22,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:22,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119574979] [2025-01-10 07:02:22,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:22,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:22,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-01-10 07:02:22,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:22,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:22,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:22,956 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:22,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:22,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:22,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:22,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:22,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:22,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:22,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1590541680, now seen corresponding path program 6 times [2025-01-10 07:02:22,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:22,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109069841] [2025-01-10 07:02:22,961 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:02:22,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:22,967 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 13 statements into 6 equivalence classes. [2025-01-10 07:02:22,976 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:02:22,976 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-10 07:02:22,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:23,027 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 07:02:23,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:23,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109069841] [2025-01-10 07:02:23,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109069841] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:23,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544314461] [2025-01-10 07:02:23,028 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:02:23,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:23,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:23,031 INFO L229 MonitoredProcess]: Starting monitored process 44 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 07:02:23,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-01-10 07:02:23,050 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 13 statements into 6 equivalence classes. [2025-01-10 07:02:23,055 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:02:23,055 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-01-10 07:02:23,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:23,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:02:23,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:23,079 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 07:02:23,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:23,122 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 07:02:23,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544314461] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:23,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:23,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-01-10 07:02:23,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113863273] [2025-01-10 07:02:23,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:23,176 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:23,176 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:23,176 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:23,176 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:23,176 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:23,176 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:23,176 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:23,177 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:23,177 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2025-01-10 07:02:23,177 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:23,177 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:23,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:23,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:23,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:23,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:23,232 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:23,232 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:23,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:23,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:23,235 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 07:02:23,237 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 07:02:23,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:23,238 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:23,260 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:23,260 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 07:02:23,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-01-10 07:02:23,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:23,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:23,271 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 07:02:23,274 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 07:02:23,274 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:23,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:23,295 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 07:02:23,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:23,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:23,299 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:23,302 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:23,302 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:23,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-01-10 07:02:23,319 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:23,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:23,327 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:23,327 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:23,327 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:23,327 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:23,327 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:23,327 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:23,327 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:23,327 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:23,327 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2025-01-10 07:02:23,327 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:23,327 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:23,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:23,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:23,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:23,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:23,396 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:23,396 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:23,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:23,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:23,402 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 07:02:23,403 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 07:02:23,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:23,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-01-10 07:02:23,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:23,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:23,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:23,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:23,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:23,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:23,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:23,433 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 07:02:23,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:23,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:23,436 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 07:02:23,438 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 07:02:23,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:23,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:23,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:23,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:23,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:23,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:23,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:23,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:23,452 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:23,455 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:23,455 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-01-10 07:02:23,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:23,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:23,457 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 07:02:23,458 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 07:02:23,459 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:23,459 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:23,459 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:23,459 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-01-10 07:02:23,464 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 07:02:23,466 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:23,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:23,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:02:23,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:02:23,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:23,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:23,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:23,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:23,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:23,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:23,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:23,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:23,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:02:23,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:23,526 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 07:02:23,526 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 07:02:23,526 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 07:02:23,562 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 07:02:23,563 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 07:02:23,565 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 07:02:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2025-01-10 07:02:23,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 7 letters. Loop has 6 letters. [2025-01-10 07:02:23,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:23,566 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:23,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:23,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:02:23,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:02:23,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:23,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:23,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:23,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:23,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:23,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:23,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:23,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:23,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:02:23,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:23,631 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 07:02:23,631 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 07:02:23,631 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 07:02:23,663 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 07:02:23,664 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 07:02:23,664 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 07:02:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2025-01-10 07:02:23,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 7 letters. Loop has 6 letters. [2025-01-10 07:02:23,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:23,664 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:23,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:23,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:02:23,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:02:23,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:23,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:23,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:23,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:23,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:23,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:23,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:23,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:23,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:02:23,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:23,738 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 07:02:23,738 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 07:02:23,739 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 07:02:23,764 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 07:02:23,765 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 07:02:23,765 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 07:02:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2025-01-10 07:02:23,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2025-01-10 07:02:23,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:23,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2025-01-10 07:02:23,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:23,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 7 letters. Loop has 12 letters. [2025-01-10 07:02:23,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:23,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 99 transitions. [2025-01-10 07:02:23,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-01-10 07:02:23,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 57 states and 81 transitions. [2025-01-10 07:02:23,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 07:02:23,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-01-10 07:02:23,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 81 transitions. [2025-01-10 07:02:23,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:23,770 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 81 transitions. [2025-01-10 07:02:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 81 transitions. [2025-01-10 07:02:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2025-01-10 07:02:23,775 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 07:02:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2025-01-10 07:02:23,776 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 61 transitions. [2025-01-10 07:02:23,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:23,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:02:23,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:02:23,776 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 07:02:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:23,789 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2025-01-10 07:02:23,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 107 transitions. [2025-01-10 07:02:23,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2025-01-10 07:02:23,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 59 states and 85 transitions. [2025-01-10 07:02:23,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-01-10 07:02:23,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:02:23,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 85 transitions. [2025-01-10 07:02:23,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:23,792 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 85 transitions. [2025-01-10 07:02:23,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 85 transitions. [2025-01-10 07:02:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2025-01-10 07:02:23,797 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 07:02:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-01-10 07:02:23,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-01-10 07:02:23,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:02:23,798 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-01-10 07:02:23,798 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:02:23,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 75 transitions. [2025-01-10 07:02:23,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2025-01-10 07:02:23,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:23,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:23,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1] [2025-01-10 07:02:23,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 2, 2] [2025-01-10 07:02:23,800 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_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 07:02:23,800 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 07:02:23,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:23,800 INFO L85 PathProgramCache]: Analyzing trace with hash 344990198, now seen corresponding path program 7 times [2025-01-10 07:02:23,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:23,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617930900] [2025-01-10 07:02:23,800 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:02:23,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:23,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:02:23,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:02:23,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:23,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:23,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:23,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:02:23,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:02:23,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:23,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:23,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:23,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:23,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1534380785, now seen corresponding path program 3 times [2025-01-10 07:02:23,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:23,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009517629] [2025-01-10 07:02:23,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:23,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:23,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 4 equivalence classes. [2025-01-10 07:02:23,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:23,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 07:02:23,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:23,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:23,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:23,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:23,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:23,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:23,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:23,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:23,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1747834906, now seen corresponding path program 8 times [2025-01-10 07:02:23,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:23,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214214889] [2025-01-10 07:02:23,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:02:23,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:23,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-10 07:02:23,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:02:23,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:23,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 07:02:23,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:23,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214214889] [2025-01-10 07:02:23,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214214889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:02:23,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:02:23,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:02:23,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581706683] [2025-01-10 07:02:23,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:02:23,945 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:23,946 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:23,946 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:23,946 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:23,946 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:23,946 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:23,946 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:23,946 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:23,946 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2025-01-10 07:02:23,946 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:23,946 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:23,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:23,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:23,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:23,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:24,000 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:24,000 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:24,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:24,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:24,003 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 07:02:24,005 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 07:02:24,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:24,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:24,027 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:24,027 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 07:02:24,033 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 07:02:24,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:24,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:24,036 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 07:02:24,037 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 07:02:24,038 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:24,038 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:24,055 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:24,055 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:24,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:24,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:24,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:24,063 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 07:02:24,064 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 07:02:24,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:24,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:24,082 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:24,082 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 07:02:24,088 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 07:02:24,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:24,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:24,090 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:24,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-01-10 07:02:24,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:24,093 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:24,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-01-10 07:02:24,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:24,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:24,118 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 07:02:24,119 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 07:02:24,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:24,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:24,132 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:24,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-01-10 07:02:24,138 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:24,138 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:24,138 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:24,138 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:24,138 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:24,138 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:24,138 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:24,138 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:24,138 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2025-01-10 07:02:24,138 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:24,138 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:24,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:24,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:24,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:24,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:24,191 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:24,191 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:24,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:24,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:24,194 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 07:02:24,197 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 07:02:24,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:24,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:24,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:24,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:24,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:24,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:24,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:24,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:24,218 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 07:02:24,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:24,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:24,220 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 07:02:24,221 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 07:02:24,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:24,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:24,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:24,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:24,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:24,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:24,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:24,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:24,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:24,239 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 07:02:24,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:24,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:24,242 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 07:02:24,243 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 07:02:24,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:24,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:24,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:24,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:24,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:24,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:24,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:24,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:24,256 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:24,259 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:02:24,259 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:02:24,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:24,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:24,261 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 07:02:24,263 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 07:02:24,264 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:24,264 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:24,264 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:24,264 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 90 Supporting invariants [] [2025-01-10 07:02:24,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-01-10 07:02:24,270 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:24,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:24,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:02:24,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:02:24,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:24,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:24,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:24,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:24,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:24,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:24,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:02:24,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:24,367 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-01-10 07:02:24,367 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 75 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:24,383 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 75 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 168 states and 224 transitions. Complement of second has 7 states. [2025-01-10 07:02:24,384 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 07:02:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-01-10 07:02:24,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 8 letters. [2025-01-10 07:02:24,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:24,385 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:24,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:24,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:02:24,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:02:24,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:24,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:24,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:24,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:24,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:24,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:24,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:02:24,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:24,483 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2025-01-10 07:02:24,483 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 75 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:24,514 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 75 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 166 states and 225 transitions. Complement of second has 9 states. [2025-01-10 07:02:24,514 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 07:02:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2025-01-10 07:02:24,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 9 letters. Loop has 8 letters. [2025-01-10 07:02:24,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:24,515 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:24,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:24,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:02:24,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:02:24,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:24,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:24,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:24,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:24,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:24,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:24,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:02:24,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:24,610 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 5 loop predicates [2025-01-10 07:02:24,610 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 75 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:24,630 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 75 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 193 states and 264 transitions. Complement of second has 16 states. [2025-01-10 07:02:24,632 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 07:02:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2025-01-10 07:02:24,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 8 letters. [2025-01-10 07:02:24,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:24,633 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:24,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:24,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:02:24,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:02:24,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:24,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:24,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:24,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:24,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:24,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:24,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:02:24,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:24,737 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 5 loop predicates [2025-01-10 07:02:24,737 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 75 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:24,764 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 75 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 183 states and 261 transitions. Complement of second has 18 states. [2025-01-10 07:02:24,764 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 07:02:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-01-10 07:02:24,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 8 letters. [2025-01-10 07:02:24,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:24,765 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:24,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:24,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:02:24,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:02:24,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:24,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:24,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:24,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:02:24,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-01-10 07:02:24,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:02:24,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:24,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:24,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:02:24,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:24,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:24,880 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 5 loop predicates [2025-01-10 07:02:24,880 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 52 states and 75 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:24,964 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,965 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,965 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,967 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,967 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,967 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,968 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,968 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,968 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,968 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,968 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,969 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,970 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,970 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,970 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,970 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:24,999 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:25,010 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:25,011 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:25,011 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:25,014 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:25,014 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:25,014 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:25,014 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:25,014 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:25,014 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:25,014 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:25,015 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:25,015 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:25,015 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:25,029 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 52 states and 75 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1330 states and 2240 transitions. Complement of second has 145 states 13 powerset states132 rank states. The highest rank that occured is 7 [2025-01-10 07:02:25,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:25,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2025-01-10 07:02:25,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 9 letters. Loop has 8 letters. [2025-01-10 07:02:25,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:25,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 17 letters. Loop has 8 letters. [2025-01-10 07:02:25,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:25,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 9 letters. Loop has 16 letters. [2025-01-10 07:02:25,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:25,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2240 transitions. [2025-01-10 07:02:25,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 131 [2025-01-10 07:02:25,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 725 states and 1315 transitions. [2025-01-10 07:02:25,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-01-10 07:02:25,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2025-01-10 07:02:25,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 725 states and 1315 transitions. [2025-01-10 07:02:25,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:25,069 INFO L218 hiAutomatonCegarLoop]: Abstraction has 725 states and 1315 transitions. [2025-01-10 07:02:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states and 1315 transitions. [2025-01-10 07:02:25,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 165. [2025-01-10 07:02:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 165 states have (on average 1.696969696969697) internal successors, (280), 164 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 280 transitions. [2025-01-10 07:02:25,095 INFO L240 hiAutomatonCegarLoop]: Abstraction has 165 states and 280 transitions. [2025-01-10 07:02:25,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:25,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:02:25,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:02:25,096 INFO L87 Difference]: Start difference. First operand 165 states and 280 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:25,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:25,108 INFO L93 Difference]: Finished difference Result 211 states and 336 transitions. [2025-01-10 07:02:25,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 336 transitions. [2025-01-10 07:02:25,109 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2025-01-10 07:02:25,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 178 states and 281 transitions. [2025-01-10 07:02:25,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-01-10 07:02:25,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-01-10 07:02:25,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 281 transitions. [2025-01-10 07:02:25,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:25,111 INFO L218 hiAutomatonCegarLoop]: Abstraction has 178 states and 281 transitions. [2025-01-10 07:02:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 281 transitions. [2025-01-10 07:02:25,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 124. [2025-01-10 07:02:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.717741935483871) internal successors, (213), 123 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 213 transitions. [2025-01-10 07:02:25,118 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 213 transitions. [2025-01-10 07:02:25,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:02:25,119 INFO L432 stractBuchiCegarLoop]: Abstraction has 124 states and 213 transitions. [2025-01-10 07:02:25,119 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 07:02:25,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 213 transitions. [2025-01-10 07:02:25,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2025-01-10 07:02:25,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:25,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:25,120 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1] [2025-01-10 07:02:25,120 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 3, 2] [2025-01-10 07:02:25,120 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_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 07:02:25,120 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 07:02:25,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash 344990198, now seen corresponding path program 9 times [2025-01-10 07:02:25,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:25,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812943987] [2025-01-10 07:02:25,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:02:25,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:25,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 4 equivalence classes. [2025-01-10 07:02:25,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:02:25,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 07:02:25,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:25,125 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:25,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:02:25,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:02:25,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:25,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:25,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:25,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:25,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2062210226, now seen corresponding path program 4 times [2025-01-10 07:02:25,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:25,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129453473] [2025-01-10 07:02:25,129 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:02:25,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:25,131 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 10 statements into 2 equivalence classes. [2025-01-10 07:02:25,133 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:02:25,133 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:02:25,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:25,133 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:25,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:02:25,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:02:25,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:25,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:25,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:25,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:25,140 INFO L85 PathProgramCache]: Analyzing trace with hash 529473283, now seen corresponding path program 10 times [2025-01-10 07:02:25,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:25,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617627580] [2025-01-10 07:02:25,140 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:02:25,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:25,143 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-01-10 07:02:25,149 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:02:25,150 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:02:25,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:25,150 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:25,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 07:02:25,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:02:25,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:25,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:25,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:25,231 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:25,231 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:25,231 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:25,231 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:25,231 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:25,231 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:25,231 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:25,231 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:25,231 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration9_Loop [2025-01-10 07:02:25,231 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:25,231 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:25,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:25,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:25,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:25,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:25,271 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:25,271 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:25,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:25,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:25,273 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 07:02:25,274 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 07:02:25,275 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:25,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:25,292 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:25,293 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 07:02:25,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-01-10 07:02:25,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:25,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:25,300 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 07:02:25,301 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 07:02:25,302 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:25,302 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:25,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-01-10 07:02:25,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:25,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:25,322 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 07:02:25,323 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 07:02:25,324 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:25,324 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:25,336 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:25,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-01-10 07:02:25,342 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:25,342 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:25,342 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:25,342 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:25,342 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:25,342 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:25,342 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:25,342 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:25,342 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration9_Loop [2025-01-10 07:02:25,342 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:25,342 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:25,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:25,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:25,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:25,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:25,400 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:25,400 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:25,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:25,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:25,404 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 07:02:25,406 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 07:02:25,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:25,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:25,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:25,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:25,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:25,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:25,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:25,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:25,437 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 07:02:25,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:25,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:25,439 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 07:02:25,442 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 07:02:25,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:25,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:25,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:25,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:25,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:25,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:25,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:25,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:25,459 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:25,461 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-01-10 07:02:25,462 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:02:25,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:25,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:25,464 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 07:02:25,465 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 07:02:25,467 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:25,467 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:25,467 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:25,467 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-01-10 07:02:25,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:25,475 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:25,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:25,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:02:25,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:02:25,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:25,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:25,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:25,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:25,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:02:25,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:02:25,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:25,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:25,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:02:25,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:25,552 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 07:02:25,553 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 213 transitions. cyclomatic complexity: 96 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 07:02:25,569 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 213 transitions. cyclomatic complexity: 96. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 151 states and 248 transitions. Complement of second has 5 states. [2025-01-10 07:02:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 07:02:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 07:02:25,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 9 letters. Loop has 10 letters. [2025-01-10 07:02:25,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:25,570 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:25,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:25,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:02:25,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:02:25,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:25,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:25,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:25,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:25,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:02:25,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:02:25,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:25,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:25,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:02:25,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:25,643 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 07:02:25,643 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 213 transitions. cyclomatic complexity: 96 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 07:02:25,657 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 213 transitions. cyclomatic complexity: 96. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 151 states and 248 transitions. Complement of second has 5 states. [2025-01-10 07:02:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 07:02:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 07:02:25,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 9 letters. Loop has 10 letters. [2025-01-10 07:02:25,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:25,658 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:25,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:25,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:02:25,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:02:25,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:25,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:25,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:25,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:25,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:02:25,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:02:25,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:25,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:25,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 07:02:25,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:25,741 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 07:02:25,741 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 124 states and 213 transitions. cyclomatic complexity: 96 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 07:02:25,790 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 124 states and 213 transitions. cyclomatic complexity: 96. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 482 states and 696 transitions. Complement of second has 26 states. [2025-01-10 07:02:25,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 07:02:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2025-01-10 07:02:25,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 9 letters. Loop has 10 letters. [2025-01-10 07:02:25,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:25,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 19 letters. Loop has 10 letters. [2025-01-10 07:02:25,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:25,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 9 letters. Loop has 20 letters. [2025-01-10 07:02:25,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:25,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 696 transitions. [2025-01-10 07:02:25,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2025-01-10 07:02:25,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 290 states and 440 transitions. [2025-01-10 07:02:25,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-01-10 07:02:25,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-01-10 07:02:25,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 440 transitions. [2025-01-10 07:02:25,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:25,807 INFO L218 hiAutomatonCegarLoop]: Abstraction has 290 states and 440 transitions. [2025-01-10 07:02:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 440 transitions. [2025-01-10 07:02:25,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 148. [2025-01-10 07:02:25,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 148 states have (on average 1.6756756756756757) internal successors, (248), 147 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 248 transitions. [2025-01-10 07:02:25,812 INFO L240 hiAutomatonCegarLoop]: Abstraction has 148 states and 248 transitions. [2025-01-10 07:02:25,812 INFO L432 stractBuchiCegarLoop]: Abstraction has 148 states and 248 transitions. [2025-01-10 07:02:25,812 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-01-10 07:02:25,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 248 transitions. [2025-01-10 07:02:25,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2025-01-10 07:02:25,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:25,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:25,814 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 2, 2, 1, 1] [2025-01-10 07:02:25,814 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 7, 5] [2025-01-10 07:02:25,814 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_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 07:02:25,814 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" [2025-01-10 07:02:25,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:25,814 INFO L85 PathProgramCache]: Analyzing trace with hash 823098771, now seen corresponding path program 11 times [2025-01-10 07:02:25,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:25,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357265655] [2025-01-10 07:02:25,814 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:02:25,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:25,816 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 11 statements into 5 equivalence classes. [2025-01-10 07:02:25,818 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:02:25,818 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-10 07:02:25,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:25,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:25,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:02:25,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:02:25,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:25,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:25,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:25,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1234332397, now seen corresponding path program 5 times [2025-01-10 07:02:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:25,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259189549] [2025-01-10 07:02:25,832 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:02:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:25,838 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 12 equivalence classes. [2025-01-10 07:02:25,843 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 07:02:25,843 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-01-10 07:02:25,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:25,852 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 07:02:25,945 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 92 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 07:02:25,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:02:25,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259189549] [2025-01-10 07:02:25,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259189549] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:02:25,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990348755] [2025-01-10 07:02:25,945 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:02:25,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:02:25,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:25,948 INFO L229 MonitoredProcess]: Starting monitored process 66 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 07:02:25,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-01-10 07:02:25,969 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 12 equivalence classes. [2025-01-10 07:02:25,979 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 07:02:25,979 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-01-10 07:02:25,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:25,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 07:02:25,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 92 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 07:02:26,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:02:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 92 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 07:02:26,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990348755] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:02:26,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:02:26,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2025-01-10 07:02:26,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157322103] [2025-01-10 07:02:26,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:02:26,114 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:02:26,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:02:26,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 07:02:26,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2025-01-10 07:02:26,115 INFO L87 Difference]: Start difference. First operand 148 states and 248 transitions. cyclomatic complexity: 108 Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:02:26,159 INFO L93 Difference]: Finished difference Result 555 states and 644 transitions. [2025-01-10 07:02:26,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 555 states and 644 transitions. [2025-01-10 07:02:26,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2025-01-10 07:02:26,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 555 states to 286 states and 364 transitions. [2025-01-10 07:02:26,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 07:02:26,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-01-10 07:02:26,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 364 transitions. [2025-01-10 07:02:26,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:26,165 INFO L218 hiAutomatonCegarLoop]: Abstraction has 286 states and 364 transitions. [2025-01-10 07:02:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 364 transitions. [2025-01-10 07:02:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 131. [2025-01-10 07:02:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 130 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2025-01-10 07:02:26,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 131 states and 188 transitions. [2025-01-10 07:02:26,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 07:02:26,179 INFO L432 stractBuchiCegarLoop]: Abstraction has 131 states and 188 transitions. [2025-01-10 07:02:26,179 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-01-10 07:02:26,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 188 transitions. [2025-01-10 07:02:26,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2025-01-10 07:02:26,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:26,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:26,180 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2025-01-10 07:02:26,180 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 9, 8] [2025-01-10 07:02:26,180 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_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-01-10 07:02:26,181 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-01-10 07:02:26,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash 889540237, now seen corresponding path program 4 times [2025-01-10 07:02:26,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:26,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053464768] [2025-01-10 07:02:26,181 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:02:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:26,185 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6 statements into 2 equivalence classes. [2025-01-10 07:02:26,186 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 07:02:26,186 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:02:26,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:26,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:26,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:26,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:26,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:26,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:26,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:26,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:26,189 INFO L85 PathProgramCache]: Analyzing trace with hash -98586044, now seen corresponding path program 6 times [2025-01-10 07:02:26,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:26,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66510630] [2025-01-10 07:02:26,189 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:02:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:26,193 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 17 equivalence classes. [2025-01-10 07:02:26,206 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 07:02:26,206 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-01-10 07:02:26,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:26,206 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:26,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 07:02:26,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 07:02:26,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:26,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:26,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:26,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:26,224 INFO L85 PathProgramCache]: Analyzing trace with hash -153461296, now seen corresponding path program 12 times [2025-01-10 07:02:26,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:26,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002707773] [2025-01-10 07:02:26,224 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:02:26,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:26,230 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 19 equivalence classes. [2025-01-10 07:02:26,245 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 07:02:26,245 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2025-01-10 07:02:26,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:26,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:26,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 07:02:26,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 07:02:26,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:26,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:26,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:26,642 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:26,643 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:26,643 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:26,643 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:26,643 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:26,643 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:26,643 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:26,643 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:26,643 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2025-01-10 07:02:26,643 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:26,643 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:26,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:26,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:26,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:26,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:26,696 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:26,697 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:26,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:26,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:26,698 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:26,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-01-10 07:02:26,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:26,700 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:26,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-01-10 07:02:26,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:26,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:26,725 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:26,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-01-10 07:02:26,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:26,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:26,741 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:26,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-01-10 07:02:26,749 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:26,749 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:26,749 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:26,749 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:26,749 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:26,749 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:26,749 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:26,749 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:26,749 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2025-01-10 07:02:26,749 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:26,749 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:26,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:26,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:26,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:26,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:26,800 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:26,800 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:26,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:26,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:26,802 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:26,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-01-10 07:02:26,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:26,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:26,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:26,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:26,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:26,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:26,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:26,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:26,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-01-10 07:02:26,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:26,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:26,825 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:26,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-01-10 07:02:26,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:26,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:26,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:26,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:26,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:26,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:26,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:26,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:26,839 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:26,841 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-01-10 07:02:26,841 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:02:26,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:26,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:26,843 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:26,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-01-10 07:02:26,844 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:26,844 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:26,844 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:26,844 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-01-10 07:02:26,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-01-10 07:02:26,850 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:26,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:26,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:26,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:26,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:26,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:26,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:26,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:26,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 07:02:26,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 07:02:26,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:26,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:26,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 07:02:26,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 128 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:27,149 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 17 loop predicates [2025-01-10 07:02:27,150 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 188 transitions. cyclomatic complexity: 60 Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:27,159 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 188 transitions. cyclomatic complexity: 60. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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 143 states and 208 transitions. Complement of second has 5 states. [2025-01-10 07:02:27,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 07:02:27,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 34 letters. [2025-01-10 07:02:27,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:27,160 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:27,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:27,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:27,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:27,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:27,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:27,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:27,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:27,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 07:02:27,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 07:02:27,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:27,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:27,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 07:02:27,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 128 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:27,464 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 17 loop predicates [2025-01-10 07:02:27,464 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 188 transitions. cyclomatic complexity: 60 Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:27,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 188 transitions. cyclomatic complexity: 60. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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 143 states and 208 transitions. Complement of second has 5 states. [2025-01-10 07:02:27,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 07:02:27,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 34 letters. [2025-01-10 07:02:27,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:27,472 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:27,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:27,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:27,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:27,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:27,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:27,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:27,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:27,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 07:02:27,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 07:02:27,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:27,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:27,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 07:02:27,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:27,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-01-10 07:02:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 128 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:27,752 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 17 loop predicates [2025-01-10 07:02:27,753 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 188 transitions. cyclomatic complexity: 60 Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:27,763 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 188 transitions. cyclomatic complexity: 60. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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 203 states and 281 transitions. Complement of second has 4 states. [2025-01-10 07:02:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-01-10 07:02:27,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 34 letters. [2025-01-10 07:02:27,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:27,765 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:27,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:27,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:27,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:27,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:27,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:27,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:27,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:27,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 07:02:27,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 07:02:27,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:27,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:27,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 07:02:27,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 128 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:28,010 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 17 loop predicates [2025-01-10 07:02:28,010 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 188 transitions. cyclomatic complexity: 60 Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,062 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 188 transitions. cyclomatic complexity: 60. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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 362 states and 462 transitions. Complement of second has 16 states. [2025-01-10 07:02:28,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2025-01-10 07:02:28,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 6 letters. Loop has 34 letters. [2025-01-10 07:02:28,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:28,064 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:28,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:28,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:28,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:28,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:28,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:28,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 07:02:28,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 07:02:28,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:28,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 07:02:28,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 128 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:02:28,370 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 17 loop predicates [2025-01-10 07:02:28,371 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 131 states and 188 transitions. cyclomatic complexity: 60 Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,427 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,428 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,428 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,428 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,428 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,457 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,459 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,459 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,459 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,487 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,489 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,513 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,513 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,515 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,517 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,517 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,518 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,537 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,537 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,537 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,537 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,538 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,539 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,539 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,539 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,539 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,539 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,540 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,540 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,540 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,560 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,561 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,561 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,562 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,562 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,563 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,564 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,564 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,564 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,565 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,565 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,565 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,566 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,566 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,566 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,566 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,585 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,587 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,587 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,587 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,611 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,613 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,613 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,613 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,613 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,614 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,615 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,615 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,615 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,616 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,616 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,616 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,616 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,616 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,617 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,617 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,617 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,618 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,618 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,618 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,639 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,640 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,640 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,640 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,663 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,664 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,665 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,665 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,665 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,665 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,666 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,667 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,667 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,667 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,667 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,668 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,668 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,668 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,668 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,669 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,669 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,669 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,669 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,669 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,692 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,693 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,693 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,693 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,717 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,718 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,719 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,719 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,719 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,720 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,720 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,721 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,721 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,722 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,722 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,722 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,722 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,722 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,722 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,723 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,723 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,723 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,724 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,724 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,742 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,744 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,744 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,744 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,769 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,770 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,770 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,770 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,771 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,771 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,772 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,773 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,773 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,773 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,774 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,774 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,774 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,774 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,774 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,775 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,775 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,775 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,776 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,776 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,776 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,776 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,776 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,777 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,777 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,777 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,777 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,777 WARN L278 uchiComplementFKVNwa]: big16 [2025-01-10 07:02:28,786 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,786 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,786 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,787 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,787 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,787 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,788 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,788 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,788 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,788 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,788 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,788 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,788 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,789 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,789 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,789 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,789 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,789 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,789 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,789 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,789 WARN L278 uchiComplementFKVNwa]: big8 [2025-01-10 07:02:28,792 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 131 states and 188 transitions. cyclomatic complexity: 60 Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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 3405 states and 5791 transitions. Complement of second has 894 states 36 powerset states858 rank states. The highest rank that occured is 9 [2025-01-10 07:02:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 78 transitions. [2025-01-10 07:02:28,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 78 transitions. Stem has 6 letters. Loop has 34 letters. [2025-01-10 07:02:28,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:28,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 78 transitions. Stem has 40 letters. Loop has 34 letters. [2025-01-10 07:02:28,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:28,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 78 transitions. Stem has 6 letters. Loop has 68 letters. [2025-01-10 07:02:28,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:28,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3405 states and 5791 transitions. [2025-01-10 07:02:28,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2025-01-10 07:02:28,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3405 states to 442 states and 643 transitions. [2025-01-10 07:02:28,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-01-10 07:02:28,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-01-10 07:02:28,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 442 states and 643 transitions. [2025-01-10 07:02:28,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:02:28,841 INFO L218 hiAutomatonCegarLoop]: Abstraction has 442 states and 643 transitions. [2025-01-10 07:02:28,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states and 643 transitions. [2025-01-10 07:02:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 247. [2025-01-10 07:02:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 246 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:02:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 378 transitions. [2025-01-10 07:02:28,848 INFO L240 hiAutomatonCegarLoop]: Abstraction has 247 states and 378 transitions. [2025-01-10 07:02:28,848 INFO L432 stractBuchiCegarLoop]: Abstraction has 247 states and 378 transitions. [2025-01-10 07:02:28,848 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-01-10 07:02:28,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 247 states and 378 transitions. [2025-01-10 07:02:28,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2025-01-10 07:02:28,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:02:28,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:02:28,850 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2025-01-10 07:02:28,851 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 10, 9] [2025-01-10 07:02:28,851 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_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-01-10 07:02:28,851 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume main_~c~0#1 > 0;" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume main_~c~0#1 > 0;" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2025-01-10 07:02:28,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,851 INFO L85 PathProgramCache]: Analyzing trace with hash 889540237, now seen corresponding path program 5 times [2025-01-10 07:02:28,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:28,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817688396] [2025-01-10 07:02:28,852 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:02:28,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:28,854 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-01-10 07:02:28,855 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:28,855 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:02:28,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:28,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:28,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:28,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:28,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,858 INFO L85 PathProgramCache]: Analyzing trace with hash -793393780, now seen corresponding path program 7 times [2025-01-10 07:02:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:28,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285898411] [2025-01-10 07:02:28,858 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:02:28,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:28,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 07:02:28,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 07:02:28,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,866 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:28,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 07:02:28,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 07:02:28,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:28,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:28,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1373096728, now seen corresponding path program 13 times [2025-01-10 07:02:28,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:02:28,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172879841] [2025-01-10 07:02:28,877 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:02:28,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:02:28,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 07:02:28,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 07:02:28,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:02:28,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 07:02:28,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 07:02:28,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:28,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:02:28,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:02:29,320 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:29,321 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:29,321 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:29,321 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:29,321 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:02:29,321 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,321 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:29,321 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:29,321 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2025-01-10 07:02:29,321 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:29,321 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:29,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,367 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:29,367 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:02:29,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,369 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:29,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-01-10 07:02:29,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:29,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:29,391 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:02:29,391 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_21=0} Honda state: {v_rep~unnamed0~0~false_21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:02:29,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-01-10 07:02:29,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,399 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:29,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-01-10 07:02:29,401 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:02:29,401 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:29,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-01-10 07:02:29,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,419 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:29,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-01-10 07:02:29,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:02:29,421 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:02:29,442 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:02:29,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-01-10 07:02:29,446 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:02:29,446 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:02:29,446 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:02:29,446 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:02:29,446 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:02:29,446 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,446 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:02:29,446 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:02:29,446 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2025-01-10 07:02:29,446 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:02:29,446 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:02:29,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:02:29,490 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:02:29,490 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:02:29,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,492 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:29,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-01-10 07:02:29,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:29,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:29,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:29,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:29,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:29,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:29,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:29,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:29,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-01-10 07:02:29,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,516 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:29,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-01-10 07:02:29,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:29,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:29,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:29,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:29,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:29,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:02:29,528 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:02:29,531 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:02:29,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-01-10 07:02:29,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,538 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:29,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-01-10 07:02:29,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:02:29,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:02:29,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:02:29,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:02:29,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:02:29,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:02:29,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:02:29,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:02:29,552 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:02:29,553 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-01-10 07:02:29,553 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:02:29,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:02:29,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:02:29,555 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:02:29,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-01-10 07:02:29,557 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:02:29,557 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:02:29,557 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:02:29,557 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 07:02:29,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-01-10 07:02:29,563 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:02:29,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:29,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:29,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 07:02:29,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 07:02:29,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 150 proven. 80 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-10 07:02:29,753 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 07:02:29,753 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 247 states and 378 transitions. cyclomatic complexity: 136 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 07:02:29,761 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 247 states and 378 transitions. cyclomatic complexity: 136. 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 275 states and 426 transitions. Complement of second has 5 states. [2025-01-10 07:02:29,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:29,762 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 07:02:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 07:02:29,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 38 letters. [2025-01-10 07:02:29,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:29,763 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:29,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:29,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:29,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:29,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 07:02:29,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 07:02:29,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:29,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:29,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 07:02:29,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 150 proven. 80 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-10 07:02:29,989 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 07:02:29,989 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 247 states and 378 transitions. cyclomatic complexity: 136 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 07:02:29,998 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 247 states and 378 transitions. cyclomatic complexity: 136. 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 275 states and 426 transitions. Complement of second has 5 states. [2025-01-10 07:02:29,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:02:30,000 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 07:02:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-01-10 07:02:30,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 38 letters. [2025-01-10 07:02:30,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:30,000 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:30,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:30,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:30,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:30,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:30,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 07:02:30,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 07:02:30,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 07:02:30,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 150 proven. 80 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-10 07:02:30,212 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 07:02:30,212 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 247 states and 378 transitions. cyclomatic complexity: 136 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 07:02:30,231 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 247 states and 378 transitions. cyclomatic complexity: 136. 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 393 states and 580 transitions. Complement of second has 7 states. [2025-01-10 07:02:30,232 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 07:02:30,232 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 07:02:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-01-10 07:02:30,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 38 letters. [2025-01-10 07:02:30,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:30,233 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:02:30,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:02:30,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:02:30,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:02:30,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:02:30,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:30,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 07:02:30,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 07:02:30,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:02:30,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:02:30,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 07:02:30,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:02:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 150 proven. 80 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-10 07:02:30,456 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 07:02:30,456 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 247 states and 378 transitions. cyclomatic complexity: 136 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 07:02:30,498 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 247 states and 378 transitions. cyclomatic complexity: 136. 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 533 states and 730 transitions. Complement of second has 12 states. [2025-01-10 07:02:30,499 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 07:02:30,499 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 07:02:30,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2025-01-10 07:02:30,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 38 letters. [2025-01-10 07:02:30,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:30,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 44 letters. Loop has 38 letters. [2025-01-10 07:02:30,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:30,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 76 letters. [2025-01-10 07:02:30,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:02:30,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 533 states and 730 transitions. [2025-01-10 07:02:30,508 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:02:30,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 533 states to 0 states and 0 transitions. [2025-01-10 07:02:30,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:02:30,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:02:30,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:02:30,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:02:30,508 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:02:30,508 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:02:30,508 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:02:30,509 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-01-10 07:02:30,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 07:02:30,509 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:02:30,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 07:02:30,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:02:30 BoogieIcfgContainer [2025-01-10 07:02:30,517 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:02:30,518 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:02:30,518 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:02:30,518 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:02:30,519 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:02:18" (3/4) ... [2025-01-10 07:02:30,521 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 07:02:30,522 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:02:30,523 INFO L158 Benchmark]: Toolchain (without parser) took 12159.37ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 123.7MB in the beginning and 200.0MB in the end (delta: -76.3MB). Peak memory consumption was 171.0MB. Max. memory is 16.1GB. [2025-01-10 07:02:30,523 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:30,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.24ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 114.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:02:30,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.10ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 113.5MB in the end (delta: 866.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:30,524 INFO L158 Benchmark]: Boogie Preprocessor took 21.40ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 112.6MB in the end (delta: 898.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:02:30,524 INFO L158 Benchmark]: RCFGBuilder took 185.81ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 103.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:02:30,524 INFO L158 Benchmark]: BuchiAutomizer took 11750.49ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 103.1MB in the beginning and 200.0MB in the end (delta: -96.9MB). Peak memory consumption was 145.9MB. Max. memory is 16.1GB. [2025-01-10 07:02:30,524 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 411.0MB. Free memory was 200.0MB in the beginning and 200.0MB in the end (delta: 33.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:02:30,526 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.18ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.24ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 114.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.10ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 113.5MB in the end (delta: 866.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.40ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 112.6MB in the end (delta: 898.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 185.81ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 103.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 11750.49ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 103.1MB in the beginning and 200.0MB in the end (delta: -96.9MB). Peak memory consumption was 145.9MB. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 411.0MB. Free memory was 200.0MB in the beginning and 200.0MB in the end (delta: 33.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (4 trivial, 3 deterministic, 8 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 * x)) and consists of 3 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function (211 + ((long) -2 * x)) and consists of 3 locations. One nondeterministic module has affine ranking function (201 + ((long) -2 * x)) and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function (((long) -1 * x) + 90) and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 19 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 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 13 iterations. TraceHistogramMax:19. Analysis of lassos took 5.9s. Construction of modules took 0.3s. Büchi inclusion checks took 5.1s. Highest rank in rank-based complementation 9. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1161 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 4, 1, 3]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 412/654 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 291 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 337 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 349 IncrementalHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 206 mSDtfsCounter, 349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT8 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax169 hnf100 lsp35 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq161 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 11 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 07:02:30,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-01-10 07:02:30,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:30,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2025-01-10 07:02:31,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE