./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash faa806fd1be90697a522dfc0988145f6572d5d87fac98caf7aa5fe5b66e6095c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:36:02,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:36:02,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:36:02,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:36:02,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:36:02,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:36:02,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:36:02,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:36:02,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:36:02,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:36:02,275 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:36:02,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:36:02,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:36:02,275 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:36:02,275 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:36:02,275 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:36:02,277 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:36:02,277 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:36:02,277 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:36:02,277 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:36:02,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:36:02,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:36:02,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:36:02,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:36:02,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:36:02,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:36:02,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:36:02,278 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:36:02,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:36:02,278 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:36:02,279 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:36:02,279 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:36:02,279 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:36:02,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:36:02,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:36:02,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:36:02,280 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:36:02,280 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> faa806fd1be90697a522dfc0988145f6572d5d87fac98caf7aa5fe5b66e6095c [2025-03-04 15:36:02,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:36:02,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:36:02,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:36:02,492 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:36:02,492 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:36:02,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2025-03-04 15:36:03,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a172c26/4396bc31f0584f3d97d0ad3f357d3cc7/FLAG75fecfdff [2025-03-04 15:36:03,797 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:36:03,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2025-03-04 15:36:03,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a172c26/4396bc31f0584f3d97d0ad3f357d3cc7/FLAG75fecfdff [2025-03-04 15:36:04,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a172c26/4396bc31f0584f3d97d0ad3f357d3cc7 [2025-03-04 15:36:04,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:36:04,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:36:04,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:36:04,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:36:04,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:36:04,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:36:04" (1/1) ... [2025-03-04 15:36:04,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e4d3338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:04, skipping insertion in model container [2025-03-04 15:36:04,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:36:04" (1/1) ... [2025-03-04 15:36:04,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:36:04,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:36:04,273 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:36:04,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:36:04,291 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:36:04,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:04 WrapperNode [2025-03-04 15:36:04,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:36:04,292 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:36:04,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:36:04,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:36:04,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:04" (1/1) ... [2025-03-04 15:36:04,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:04" (1/1) ... [2025-03-04 15:36:04,314 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 16 [2025-03-04 15:36:04,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:36:04,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:36:04,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:36:04,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:36:04,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:04" (1/1) ... [2025-03-04 15:36:04,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:04" (1/1) ... [2025-03-04 15:36:04,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:04" (1/1) ... [2025-03-04 15:36:04,323 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 15:36:04,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:04" (1/1) ... [2025-03-04 15:36:04,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:04" (1/1) ... [2025-03-04 15:36:04,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:04" (1/1) ... [2025-03-04 15:36:04,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:04" (1/1) ... [2025-03-04 15:36:04,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:04" (1/1) ... [2025-03-04 15:36:04,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:04" (1/1) ... [2025-03-04 15:36:04,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:36:04,328 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:36:04,329 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:36:04,329 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:36:04,329 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:04" (1/1) ... [2025-03-04 15:36:04,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:04,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:04,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:04,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:36:04,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:36:04,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:36:04,411 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:36:04,412 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:36:04,462 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-03-04 15:36:04,462 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:36:04,469 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:36:04,469 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:36:04,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:36:04 BoogieIcfgContainer [2025-03-04 15:36:04,470 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:36:04,471 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:36:04,471 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:36:04,475 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:36:04,475 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:36:04,475 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:36:04" (1/3) ... [2025-03-04 15:36:04,476 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60857ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:36:04, skipping insertion in model container [2025-03-04 15:36:04,476 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:36:04,477 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:36:04" (2/3) ... [2025-03-04 15:36:04,477 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60857ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:36:04, skipping insertion in model container [2025-03-04 15:36:04,477 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:36:04,478 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:36:04" (3/3) ... [2025-03-04 15:36:04,478 INFO L363 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative.c [2025-03-04 15:36:04,523 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:36:04,524 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:36:04,524 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:36:04,524 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:36:04,524 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:36:04,524 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:36:04,524 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:36:04,525 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:36:04,529 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-03-04 15:36:04,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:36:04,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:04,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:04,542 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:04,543 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:36:04,543 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:36:04,543 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-03-04 15:36:04,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:36:04,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:04,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:04,544 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:04,545 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:36:04,550 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-03-04 15:36:04,550 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-03-04 15:36:04,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:04,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 1 times [2025-03-04 15:36:04,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:04,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482696690] [2025-03-04 15:36:04,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:04,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:04,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:04,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:04,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:04,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:04,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:04,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:04,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:04,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:04,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:04,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:04,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1119, now seen corresponding path program 1 times [2025-03-04 15:36:04,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:04,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166565377] [2025-03-04 15:36:04,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:04,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:04,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:04,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:04,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:04,630 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:04,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:04,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:04,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:04,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:04,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:04,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:04,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1137982, now seen corresponding path program 1 times [2025-03-04 15:36:04,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:04,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490901455] [2025-03-04 15:36:04,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:04,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:04,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:04,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:04,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:04,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:04,643 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:04,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:04,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:04,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:04,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:04,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:04,715 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:04,716 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:04,716 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:04,716 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:04,716 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:04,716 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:04,716 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:04,716 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:04,716 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2025-03-04 15:36:04,716 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:04,716 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:04,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:04,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:04,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:04,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:04,818 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:04,818 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:04,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:04,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:04,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:04,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 15:36:04,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:04,825 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:04,848 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:04,849 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-03-04 15:36:04,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 15:36:04,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:04,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:04,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:04,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 15:36:04,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:04,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:04,878 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:04,878 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-03-04 15:36:04,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-04 15:36:04,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:04,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:04,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:04,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 15:36:04,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:04,887 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:04,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-04 15:36:04,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:04,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:04,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:04,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 15:36:04,907 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:04,907 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:04,931 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:04,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 15:36:04,934 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:04,934 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:04,935 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:04,935 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:04,935 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:04,935 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:04,935 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:04,935 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:04,935 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2025-03-04 15:36:04,935 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:04,935 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:04,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:04,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:04,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:04,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,010 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:05,013 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:05,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,015 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 15:36:05,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:05,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:05,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:05,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:05,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:05,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:05,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:05,044 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:05,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:05,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,052 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 15:36:05,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:05,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:05,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:05,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:05,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:05,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:05,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:05,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:05,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:05,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 15:36:05,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:05,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:05,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:05,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:05,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:05,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:05,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:05,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:05,094 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:05,096 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:36:05,098 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:05,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,120 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 15:36:05,122 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:05,122 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:05,122 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:05,122 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-03-04 15:36:05,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 15:36:05,130 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:05,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:05,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:05,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:05,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:05,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:05,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:05,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:05,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:05,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:05,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:05,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:05,163 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:36:05,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:05,198 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:36:05,199 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-03-04 15:36:05,227 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-03-04 15:36:05,229 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-03-04 15:36:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-03-04 15:36:05,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-04 15:36:05,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:05,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-04 15:36:05,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:05,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-04 15:36:05,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:05,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-03-04 15:36:05,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:36:05,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 11 transitions. [2025-03-04 15:36:05,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-04 15:36:05,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-03-04 15:36:05,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2025-03-04 15:36:05,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:05,244 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-04 15:36:05,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2025-03-04 15:36:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-04 15:36:05,263 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-03-04 15:36:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-03-04 15:36:05,264 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-04 15:36:05,264 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-04 15:36:05,264 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:36:05,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2025-03-04 15:36:05,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:36:05,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:05,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:05,265 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:36:05,265 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:36:05,265 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-03-04 15:36:05,266 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-03-04 15:36:05,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:05,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1137983, now seen corresponding path program 1 times [2025-03-04 15:36:05,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:05,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075120837] [2025-03-04 15:36:05,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:05,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:05,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:05,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:05,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:05,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:05,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:05,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:05,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:05,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:05,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:05,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:05,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:05,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1119, now seen corresponding path program 2 times [2025-03-04 15:36:05,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:05,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354887990] [2025-03-04 15:36:05,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:05,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:05,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:05,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:05,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:36:05,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:05,287 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:05,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:05,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:05,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:05,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:05,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:05,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:05,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1093601821, now seen corresponding path program 1 times [2025-03-04 15:36:05,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:05,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942565508] [2025-03-04 15:36:05,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:05,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:05,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:05,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:05,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:05,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:05,300 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:05,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:05,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:05,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:05,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:05,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:05,336 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:05,336 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:05,336 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:05,337 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:05,337 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:05,337 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,337 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:05,337 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:05,337 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2025-03-04 15:36:05,337 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:05,337 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:05,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,396 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:05,396 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:05,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,399 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 15:36:05,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:05,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:05,419 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:05,420 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-03-04 15:36:05,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-04 15:36:05,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,428 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 15:36:05,432 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:05,432 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:05,450 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:05,451 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-03-04 15:36:05,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:05,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,459 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 15:36:05,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:05,461 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:05,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 15:36:05,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,480 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 15:36:05,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:05,481 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:05,504 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:05,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-04 15:36:05,508 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:05,508 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:05,509 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:05,509 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:05,509 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:05,509 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,509 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:05,509 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:05,509 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2025-03-04 15:36:05,509 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:05,509 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:05,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,570 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:05,571 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:05,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,573 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 15:36:05,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:05,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:05,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:05,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:05,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:05,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:05,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:05,592 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:05,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:05,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,599 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 15:36:05,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:05,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:05,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:05,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:05,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:05,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:05,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:05,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:05,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-04 15:36:05,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,625 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 15:36:05,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:05,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:05,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:05,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:05,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:05,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:05,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:05,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:05,640 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:05,642 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:36:05,642 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:05,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,644 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 15:36:05,647 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:05,647 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:05,647 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:05,647 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-03-04 15:36:05,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 15:36:05,654 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:05,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:05,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:05,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:05,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:05,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:05,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:05,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:05,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:05,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:05,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:05,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:05,690 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:36:05,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:05,712 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:36:05,712 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-03-04 15:36:05,733 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-03-04 15:36:05,733 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-03-04 15:36:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-04 15:36:05,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-04 15:36:05,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:05,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-04 15:36:05,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:05,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-04 15:36:05,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:05,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-03-04 15:36:05,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:36:05,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2025-03-04 15:36:05,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-03-04 15:36:05,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:36:05,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-03-04 15:36:05,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:05,735 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-04 15:36:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-03-04 15:36:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-04 15:36:05,736 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-03-04 15:36:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-03-04 15:36:05,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-04 15:36:05,736 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-03-04 15:36:05,736 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:36:05,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2025-03-04 15:36:05,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:36:05,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:05,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:05,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2025-03-04 15:36:05,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:36:05,739 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-03-04 15:36:05,739 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-03-04 15:36:05,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1093601822, now seen corresponding path program 2 times [2025-03-04 15:36:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:05,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748095165] [2025-03-04 15:36:05,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:05,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:05,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-04 15:36:05,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:05,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:05,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:05,749 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:05,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:05,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:05,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:05,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:05,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:05,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:05,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1119, now seen corresponding path program 3 times [2025-03-04 15:36:05,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:05,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927521808] [2025-03-04 15:36:05,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:05,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:05,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:05,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:05,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:36:05,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:05,757 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:05,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:05,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:05,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:05,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:05,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:05,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1315636420, now seen corresponding path program 2 times [2025-03-04 15:36:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:05,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127097147] [2025-03-04 15:36:05,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:05,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-04 15:36:05,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:36:05,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:05,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:05,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:05,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:36:05,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:36:05,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:05,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:05,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:05,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 15:36:05,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 15:36:05,818 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:05,818 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:05,818 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:05,818 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:05,819 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:05,819 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,819 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:05,819 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:05,819 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2025-03-04 15:36:05,819 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:05,819 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:05,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,867 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:05,868 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:05,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,869 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 15:36:05,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:05,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:05,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:05,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,892 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 15:36:05,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:05,894 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:05,916 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:05,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-04 15:36:05,920 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:05,920 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:05,920 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:05,920 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:05,920 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:05,920 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,920 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:05,920 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:05,920 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2025-03-04 15:36:05,920 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:05,920 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:05,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:05,966 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:05,966 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:05,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,969 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 15:36:05,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:05,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:05,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:05,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:05,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:05,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:05,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:05,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:05,984 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:05,985 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:36:05,985 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:05,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:05,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:05,987 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:05,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-04 15:36:05,990 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:05,990 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:05,990 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:05,990 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-03-04 15:36:05,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:05,996 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:06,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:06,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:06,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:06,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:06,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:06,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:06,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,025 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:36:06,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:06,027 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-03-04 15:36:06,027 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-03-04 15:36:06,034 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-03-04 15:36:06,035 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-03-04 15:36:06,035 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-03-04 15:36:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-04 15:36:06,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-04 15:36:06,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:06,036 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:06,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:06,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:06,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:06,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:06,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:06,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:06,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,062 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:36:06,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:06,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:06,071 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-03-04 15:36:06,072 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-03-04 15:36:06,077 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-03-04 15:36:06,078 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-03-04 15:36:06,079 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-03-04 15:36:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-03-04 15:36:06,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-04 15:36:06,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:06,080 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:06,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:06,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:06,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:06,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:06,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:06,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:06,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,109 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:36:06,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:06,112 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-03-04 15:36:06,112 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-03-04 15:36:06,118 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-03-04 15:36:06,119 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-03-04 15:36:06,119 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-03-04 15:36:06,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-04 15:36:06,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-04 15:36:06,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:06,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2025-03-04 15:36:06,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:06,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2025-03-04 15:36:06,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:06,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 24 transitions. [2025-03-04 15:36:06,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:36:06,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 20 transitions. [2025-03-04 15:36:06,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-03-04 15:36:06,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:36:06,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2025-03-04 15:36:06,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:06,121 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-03-04 15:36:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2025-03-04 15:36:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 6. [2025-03-04 15:36:06,122 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-03-04 15:36:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2025-03-04 15:36:06,122 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-03-04 15:36:06,122 INFO L432 stractBuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-03-04 15:36:06,122 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:36:06,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2025-03-04 15:36:06,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:36:06,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:06,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:06,123 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:36:06,123 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:36:06,123 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-03-04 15:36:06,123 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-03-04 15:36:06,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 2 times [2025-03-04 15:36:06,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:06,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322917090] [2025-03-04 15:36:06,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:06,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:06,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:06,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:06,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:36:06,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,127 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:06,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:06,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:06,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:06,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1120, now seen corresponding path program 1 times [2025-03-04 15:36:06,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:06,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773002699] [2025-03-04 15:36:06,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:06,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:06,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:06,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:06,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:06,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:06,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:06,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:06,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1137983, now seen corresponding path program 3 times [2025-03-04 15:36:06,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:06,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083747294] [2025-03-04 15:36:06,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:06,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:06,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:06,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:06,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:36:06,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:06,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:06,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:06,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:06,160 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:06,160 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:06,160 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:06,160 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:06,160 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:06,160 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,160 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:06,160 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:06,160 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2025-03-04 15:36:06,160 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:06,160 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:06,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,206 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:06,206 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:06,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:06,208 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:06,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 15:36:06,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:06,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:06,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-04 15:36:06,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:06,245 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:06,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 15:36:06,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:06,247 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:06,268 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:06,268 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-03-04 15:36:06,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-04 15:36:06,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:06,275 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:06,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 15:36:06,277 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:06,277 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:06,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-04 15:36:06,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:06,294 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:06,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 15:36:06,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:06,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:06,317 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:06,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 15:36:06,323 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:06,323 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:06,323 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:06,323 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:06,323 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:06,323 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,323 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:06,323 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:06,323 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2025-03-04 15:36:06,323 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:06,323 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:06,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,380 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:06,380 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:06,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:06,382 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:06,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 15:36:06,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:06,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:06,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:06,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:06,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:06,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:06,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:06,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:06,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:06,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-04 15:36:06,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:06,403 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:06,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-04 15:36:06,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-03-04 15:36:06,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:06,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:06,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:06,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:06,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:06,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:06,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:06,417 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:06,420 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:06,420 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:06,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:06,422 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:06,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-04 15:36:06,423 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:06,423 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:06,423 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:06,423 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-03-04 15:36:06,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:06,430 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:06,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:06,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:06,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:06,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:06,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:06,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:06,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,462 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:36:06,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:06,464 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-03-04 15:36:06,465 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-03-04 15:36:06,471 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-03-04 15:36:06,472 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-03-04 15:36:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2025-03-04 15:36:06,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-04 15:36:06,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:06,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-04 15:36:06,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:06,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2025-03-04 15:36:06,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:06,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2025-03-04 15:36:06,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:36:06,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 14 transitions. [2025-03-04 15:36:06,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-04 15:36:06,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-03-04 15:36:06,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-03-04 15:36:06,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:06,476 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-04 15:36:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-03-04 15:36:06,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-04 15:36:06,476 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-03-04 15:36:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2025-03-04 15:36:06,476 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-04 15:36:06,476 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-04 15:36:06,476 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:36:06,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2025-03-04 15:36:06,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-04 15:36:06,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:06,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:06,479 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2025-03-04 15:36:06,479 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:36:06,479 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-03-04 15:36:06,479 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-03-04 15:36:06,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,480 INFO L85 PathProgramCache]: Analyzing trace with hash 35277447, now seen corresponding path program 2 times [2025-03-04 15:36:06,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:06,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197529968] [2025-03-04 15:36:06,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:06,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:06,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 2 equivalence classes. [2025-03-04 15:36:06,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:06,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:06,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:06,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:06,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197529968] [2025-03-04 15:36:06,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197529968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:06,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:06,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:36:06,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945719779] [2025-03-04 15:36:06,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:06,523 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:36:06,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1090, now seen corresponding path program 2 times [2025-03-04 15:36:06,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:06,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928656668] [2025-03-04 15:36:06,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:06,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:06,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:06,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:06,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:36:06,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:06,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:06,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:06,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:06,548 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:06,548 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:06,548 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:06,548 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:06,548 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:06,548 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,548 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:06,548 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:06,548 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2025-03-04 15:36:06,548 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:06,548 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:06,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,593 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:06,593 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:06,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:06,595 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:06,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-04 15:36:06,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:06,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:06,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:06,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:06,615 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:06,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-04 15:36:06,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:06,616 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:06,637 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:06,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 15:36:06,641 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:06,641 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:06,641 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:06,641 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:06,641 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:06,641 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,641 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:06,641 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:06,641 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2025-03-04 15:36:06,641 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:06,641 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:06,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:06,689 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:06,689 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:06,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:06,692 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:06,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-04 15:36:06,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:06,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:06,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:06,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:06,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:06,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:06,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:06,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:06,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-04 15:36:06,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:06,715 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:06,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-04 15:36:06,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:06,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:06,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:06,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:06,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:06,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:06,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:06,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:06,731 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:06,734 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:06,734 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:06,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:06,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:06,736 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:06,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-04 15:36:06,740 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:06,740 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:06,740 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:06,740 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-03-04 15:36:06,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-04 15:36:06,746 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:06,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:06,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:06,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:06,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:06,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:06,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:06,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,777 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:36:06,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:06,798 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:36:06,798 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-03-04 15:36:06,804 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-03-04 15:36:06,807 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-03-04 15:36:06,807 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-03-04 15:36:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-03-04 15:36:06,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-04 15:36:06,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:06,807 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:06,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:06,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:06,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:06,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:06,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:06,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:06,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,836 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:36:06,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:06,849 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:36:06,849 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-03-04 15:36:06,861 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-03-04 15:36:06,862 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-03-04 15:36:06,862 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-03-04 15:36:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-04 15:36:06,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-04 15:36:06,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:06,863 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:06,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:36:06,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:36:06,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:06,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:06,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:36:06,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:36:06,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:06,889 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:36:06,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:06,905 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:36:06,906 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-03-04 15:36:06,912 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-03-04 15:36:06,912 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-03-04 15:36:06,913 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-03-04 15:36:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-04 15:36:06,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-04 15:36:06,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:06,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-04 15:36:06,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:06,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-04 15:36:06,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:06,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2025-03-04 15:36:06,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-03-04 15:36:06,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 17 transitions. [2025-03-04 15:36:06,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-04 15:36:06,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-03-04 15:36:06,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2025-03-04 15:36:06,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:06,914 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-04 15:36:06,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2025-03-04 15:36:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2025-03-04 15:36:06,915 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-03-04 15:36:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-03-04 15:36:06,915 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-04 15:36:06,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:06,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:36:06,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:36:06,919 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-03-04 15:36:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:06,931 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2025-03-04 15:36:06,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2025-03-04 15:36:06,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:36:06,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 11 transitions. [2025-03-04 15:36:06,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-03-04 15:36:06,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-03-04 15:36:06,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2025-03-04 15:36:06,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:06,932 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-03-04 15:36:06,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2025-03-04 15:36:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-04 15:36:06,933 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-03-04 15:36:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2025-03-04 15:36:06,933 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-03-04 15:36:06,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:36:06,934 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-03-04 15:36:06,934 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:36:06,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2025-03-04 15:36:06,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:36:06,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:06,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:06,935 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2025-03-04 15:36:06,935 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2025-03-04 15:36:06,935 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-03-04 15:36:06,935 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-03-04 15:36:06,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,936 INFO L85 PathProgramCache]: Analyzing trace with hash -458081912, now seen corresponding path program 3 times [2025-03-04 15:36:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:06,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233072883] [2025-03-04 15:36:06,936 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:06,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:06,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 3 equivalence classes. [2025-03-04 15:36:06,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:36:06,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 15:36:06,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:06,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:36:06,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:36:06,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:06,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1047588, now seen corresponding path program 1 times [2025-03-04 15:36:06,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:06,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692521470] [2025-03-04 15:36:06,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:36:06,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:06,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:06,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:06,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:06,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:06,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:06,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:06,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:06,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1718360619, now seen corresponding path program 4 times [2025-03-04 15:36:06,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:06,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546431892] [2025-03-04 15:36:06,958 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:06,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:06,962 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 11 statements into 2 equivalence classes. [2025-03-04 15:36:06,965 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:36:06,965 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:06,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,965 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:06,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:36:06,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:36:06,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:06,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:06,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:07,009 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:07,010 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:07,010 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:07,010 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:07,010 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:07,010 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,010 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:07,010 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:07,010 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2025-03-04 15:36:07,010 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:07,010 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:07,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,055 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:07,056 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:07,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,058 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:07,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-04 15:36:07,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:07,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,078 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:07,078 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-03-04 15:36:07,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-04 15:36:07,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,085 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:07,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-04 15:36:07,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:07,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,103 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:07,104 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-03-04 15:36:07,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 15:36:07,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,111 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:07,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 15:36:07,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:07,113 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,130 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:07,130 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-03-04 15:36:07,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-04 15:36:07,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,137 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:07,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 15:36:07,138 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:07,138 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-04 15:36:07,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,157 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:07,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-04 15:36:07,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:07,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:07,183 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:07,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-04 15:36:07,191 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:07,191 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:07,191 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:07,191 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:07,191 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:07,191 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,191 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:07,191 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:07,191 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2025-03-04 15:36:07,191 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:07,191 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:07,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:07,293 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:07,293 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:07,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,295 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:07,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-04 15:36:07,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:07,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:07,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:07,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:07,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:07,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:07,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:07,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:07,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:07,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-04 15:36:07,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,317 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:07,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-04 15:36:07,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:07,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:07,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:07,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:07,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:07,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:07,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:07,336 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:07,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:07,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,344 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:07,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-04 15:36:07,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:07,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:07,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:07,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:07,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:07,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:07,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:07,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:07,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:07,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,379 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:07,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-04 15:36:07,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:07,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:07,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:07,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:07,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:07,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:07,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:07,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:07,395 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:07,397 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:07,397 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:07,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:07,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,399 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:07,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-04 15:36:07,401 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:07,402 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:07,402 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:07,402 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-03-04 15:36:07,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:07,408 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:07,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:07,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:36:07,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:36:07,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:07,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:07,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-04 15:36:07,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:07,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:07,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:07,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-04 15:36:07,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:07,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:07,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:07,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:07,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:36:07,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:07,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:07,526 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-03-04 15:36:07,527 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-03-04 15:36:07,532 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-03-04 15:36:07,533 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-03-04 15:36:07,533 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-03-04 15:36:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2025-03-04 15:36:07,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-04 15:36:07,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:07,534 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:07,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:07,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:36:07,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:36:07,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:07,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:07,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:07,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:07,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:07,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:07,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:07,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:07,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:36:07,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:07,618 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-03-04 15:36:07,618 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-03-04 15:36:07,628 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-03-04 15:36:07,628 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-03-04 15:36:07,628 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-03-04 15:36:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-04 15:36:07,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-04 15:36:07,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:07,629 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:07,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:07,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:36:07,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:36:07,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:07,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:07,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:07,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:07,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:07,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:07,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:07,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:07,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:36:07,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:07,677 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-03-04 15:36:07,677 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-03-04 15:36:07,684 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-03-04 15:36:07,684 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-03-04 15:36:07,685 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-03-04 15:36:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-03-04 15:36:07,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-04 15:36:07,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:07,685 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:07,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:07,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:36:07,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:36:07,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:07,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:07,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:07,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:07,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:07,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:07,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:07,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:07,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:36:07,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:07,742 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-03-04 15:36:07,742 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-03-04 15:36:07,754 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-03-04 15:36:07,754 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-03-04 15:36:07,755 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-03-04 15:36:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-04 15:36:07,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-04 15:36:07,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:07,755 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:07,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:07,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:36:07,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:36:07,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:07,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:07,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:07,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:07,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:36:07,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:36:07,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:07,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:07,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:36:07,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:07,813 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-03-04 15:36:07,814 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-03-04 15:36:07,854 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-03-04 15:36:07,855 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-03-04 15:36:07,856 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-03-04 15:36:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2025-03-04 15:36:07,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-04 15:36:07,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:07,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 11 letters. Loop has 4 letters. [2025-03-04 15:36:07,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:07,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 8 letters. [2025-03-04 15:36:07,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:07,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 109 transitions. [2025-03-04 15:36:07,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2025-03-04 15:36:07,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 37 states and 51 transitions. [2025-03-04 15:36:07,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2025-03-04 15:36:07,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2025-03-04 15:36:07,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 51 transitions. [2025-03-04 15:36:07,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:07,860 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-03-04 15:36:07,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 51 transitions. [2025-03-04 15:36:07,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2025-03-04 15:36:07,863 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-03-04 15:36:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2025-03-04 15:36:07,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2025-03-04 15:36:07,863 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2025-03-04 15:36:07,863 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:36:07,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2025-03-04 15:36:07,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-04 15:36:07,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:07,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:07,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2025-03-04 15:36:07,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 1] [2025-03-04 15:36:07,864 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-03-04 15:36:07,864 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-03-04 15:36:07,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:07,864 INFO L85 PathProgramCache]: Analyzing trace with hash -458081912, now seen corresponding path program 5 times [2025-03-04 15:36:07,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:07,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495571500] [2025-03-04 15:36:07,864 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:07,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:07,869 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 3 equivalence classes. [2025-03-04 15:36:07,873 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:36:07,873 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 15:36:07,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:07,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:07,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:36:07,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:36:07,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:07,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:07,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:07,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1006732166, now seen corresponding path program 2 times [2025-03-04 15:36:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:07,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087590408] [2025-03-04 15:36:07,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:07,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:07,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-04 15:36:07,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:07,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:07,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:07,886 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:07,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:07,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:07,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:07,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:07,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:07,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:07,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2077113293, now seen corresponding path program 6 times [2025-03-04 15:36:07,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:07,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928951907] [2025-03-04 15:36:07,889 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:07,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:07,891 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 13 statements into 6 equivalence classes. [2025-03-04 15:36:07,894 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:36:07,894 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-04 15:36:07,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:36:07,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:07,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928951907] [2025-03-04 15:36:07,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928951907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:07,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261301070] [2025-03-04 15:36:07,953 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:07,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:07,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:07,955 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:07,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-03-04 15:36:07,971 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 13 statements into 6 equivalence classes. [2025-03-04 15:36:07,975 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:36:07,976 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-04 15:36:07,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:07,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:36:07,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:36:07,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 15:36:08,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261301070] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:08,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:08,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-04 15:36:08,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050685070] [2025-03-04 15:36:08,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:08,057 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:08,058 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:08,058 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:08,058 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:08,058 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:08,058 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,058 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:08,058 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:08,058 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2025-03-04 15:36:08,058 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:08,058 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:08,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,103 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:08,103 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:08,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,106 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-04 15:36:08,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:08,108 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:08,126 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:08,126 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-03-04 15:36:08,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:08,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,133 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-04 15:36:08,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:08,134 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:08,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:08,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,152 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-04 15:36:08,153 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:08,153 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:08,165 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:08,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-04 15:36:08,170 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:08,170 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:08,171 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:08,171 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:08,171 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:08,171 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,171 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:08,171 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:08,171 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2025-03-04 15:36:08,171 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:08,171 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:08,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,214 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:08,214 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:08,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,216 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-04 15:36:08,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:08,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:08,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:08,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:08,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:08,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,239 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-04 15:36:08,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:08,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:08,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:08,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:08,253 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:08,254 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:08,254 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:36:08,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,256 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-04 15:36:08,258 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:08,258 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:08,258 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:08,258 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-03-04 15:36:08,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-04 15:36:08,263 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:08,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:08,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:36:08,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:36:08,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:08,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:08,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:08,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:08,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:08,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:08,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:08,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:08,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:36:08,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:08,318 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-03-04 15:36:08,318 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-03-04 15:36:08,343 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-03-04 15:36:08,344 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-03-04 15:36:08,344 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-03-04 15:36:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2025-03-04 15:36:08,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 15:36:08,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:08,344 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:08,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:08,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:36:08,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:36:08,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:08,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:08,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:08,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:08,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:08,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:08,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:08,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:08,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:36:08,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:08,401 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-03-04 15:36:08,401 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-03-04 15:36:08,423 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-03-04 15:36:08,424 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-03-04 15:36:08,424 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-03-04 15:36:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2025-03-04 15:36:08,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 15:36:08,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:08,424 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:08,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:08,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:36:08,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:36:08,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:08,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:08,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:08,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:08,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:08,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:08,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:08,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:08,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:36:08,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:08,477 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-03-04 15:36:08,477 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-03-04 15:36:08,496 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-03-04 15:36:08,496 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-03-04 15:36:08,497 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-03-04 15:36:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2025-03-04 15:36:08,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 15:36:08,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:08,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-04 15:36:08,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:08,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 7 letters. Loop has 12 letters. [2025-03-04 15:36:08,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:08,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 99 transitions. [2025-03-04 15:36:08,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-03-04 15:36:08,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 57 states and 81 transitions. [2025-03-04 15:36:08,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-03-04 15:36:08,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-03-04 15:36:08,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 81 transitions. [2025-03-04 15:36:08,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:08,499 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 81 transitions. [2025-03-04 15:36:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 81 transitions. [2025-03-04 15:36:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2025-03-04 15:36:08,501 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-03-04 15:36:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2025-03-04 15:36:08,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 61 transitions. [2025-03-04 15:36:08,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:08,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:36:08,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:36:08,501 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-03-04 15:36:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:08,515 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2025-03-04 15:36:08,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 107 transitions. [2025-03-04 15:36:08,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2025-03-04 15:36:08,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 59 states and 85 transitions. [2025-03-04 15:36:08,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:36:08,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:36:08,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 85 transitions. [2025-03-04 15:36:08,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:08,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 85 transitions. [2025-03-04 15:36:08,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 85 transitions. [2025-03-04 15:36:08,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2025-03-04 15:36:08,523 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-03-04 15:36:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-03-04 15:36:08,523 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-03-04 15:36:08,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:36:08,525 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-03-04 15:36:08,525 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:36:08,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 75 transitions. [2025-03-04 15:36:08,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2025-03-04 15:36:08,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:08,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:08,527 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1] [2025-03-04 15:36:08,527 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 2, 2] [2025-03-04 15:36:08,527 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-03-04 15:36:08,527 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-03-04 15:36:08,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:08,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2130023351, now seen corresponding path program 7 times [2025-03-04 15:36:08,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:08,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10322766] [2025-03-04 15:36:08,528 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:08,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:08,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:36:08,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:36:08,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:08,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:08,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:08,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:36:08,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:36:08,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:08,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:08,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:08,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:08,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1130599175, now seen corresponding path program 3 times [2025-03-04 15:36:08,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:08,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261580753] [2025-03-04 15:36:08,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:08,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:08,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 4 equivalence classes. [2025-03-04 15:36:08,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:36:08,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:36:08,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:08,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:08,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:36:08,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:36:08,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:08,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:08,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:08,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:08,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1400817841, now seen corresponding path program 8 times [2025-03-04 15:36:08,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:08,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52325358] [2025-03-04 15:36:08,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:36:08,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:08,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 15:36:08,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:36:08,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:08,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 15:36:08,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:08,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52325358] [2025-03-04 15:36:08,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52325358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:36:08,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:36:08,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:36:08,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168736195] [2025-03-04 15:36:08,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:36:08,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:08,655 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:08,655 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:08,656 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:08,656 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:08,656 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:08,656 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,656 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:08,656 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:08,656 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2025-03-04 15:36:08,656 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:08,656 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:08,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,693 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:08,694 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:08,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,696 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-04 15:36:08,698 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:08,698 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:08,717 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:08,717 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-03-04 15:36:08,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-04 15:36:08,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,726 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-04 15:36:08,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:08,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:08,745 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:08,745 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-03-04 15:36:08,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-04 15:36:08,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,753 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-04 15:36:08,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:08,754 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:08,773 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:08,774 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-03-04 15:36:08,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-04 15:36:08,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,781 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-04 15:36:08,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:08,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:08,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-04 15:36:08,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,806 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-04 15:36:08,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:08,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:08,819 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:08,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-04 15:36:08,826 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:08,826 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:08,826 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:08,826 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:08,826 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:08,826 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,826 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:08,826 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:08,826 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2025-03-04 15:36:08,826 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:08,826 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:08,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:08,866 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:08,866 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:08,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,892 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-04 15:36:08,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:08,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:08,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:08,907 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:08,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:08,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,915 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-04 15:36:08,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:08,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:08,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:08,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:08,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:08,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:08,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,937 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-04 15:36:08,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:08,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:08,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:08,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:08,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:08,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:08,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:08,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:08,950 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:08,951 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:08,951 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:08,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:08,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:08,953 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:08,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-04 15:36:08,954 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:08,954 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:08,954 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:08,954 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-03-04 15:36:08,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:08,960 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:08,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:08,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:36:08,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:36:08,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:08,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:08,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:08,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:08,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:36:08,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:36:08,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:08,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:08,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:36:08,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:09,047 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-03-04 15:36:09,047 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-03-04 15:36:09,058 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-03-04 15:36:09,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:09,059 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-03-04 15:36:09,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-03-04 15:36:09,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 9 letters. Loop has 8 letters. [2025-03-04 15:36:09,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:09,059 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:09,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:09,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:36:09,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:36:09,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:09,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:09,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:09,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:36:09,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:36:09,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:09,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:36:09,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:09,138 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-03-04 15:36:09,138 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-03-04 15:36:09,160 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-03-04 15:36:09,161 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-03-04 15:36:09,161 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-03-04 15:36:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2025-03-04 15:36:09,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 9 letters. Loop has 8 letters. [2025-03-04 15:36:09,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:09,161 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:09,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:09,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:36:09,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:36:09,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:09,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:09,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:09,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:36:09,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:36:09,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:09,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:36:09,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:09,249 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-03-04 15:36:09,249 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-03-04 15:36:09,268 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-03-04 15:36:09,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:09,270 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-03-04 15:36:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2025-03-04 15:36:09,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 8 letters. [2025-03-04 15:36:09,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:09,271 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:09,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:09,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:36:09,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:36:09,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:09,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:09,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:09,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:36:09,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:36:09,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:09,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:36:09,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:09,345 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-03-04 15:36:09,345 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-03-04 15:36:09,364 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-03-04 15:36:09,364 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-03-04 15:36:09,364 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-03-04 15:36:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-03-04 15:36:09,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 8 letters. [2025-03-04 15:36:09,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:09,365 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:09,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:09,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:36:09,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:36:09,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:09,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:09,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:09,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:36:09,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:36:09,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:09,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:36:09,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:09,434 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-03-04 15:36:09,434 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-03-04 15:36:09,490 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,490 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,490 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,492 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,492 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,492 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,492 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,492 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,493 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,493 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,493 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,493 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,494 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,494 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,494 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,494 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,513 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,522 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,522 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,522 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,523 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,523 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,523 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,523 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,523 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,523 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,523 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,523 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,524 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,524 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:09,533 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-03-04 15:36:09,533 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-03-04 15:36:09,533 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-03-04 15:36:09,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2025-03-04 15:36:09,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 9 letters. Loop has 8 letters. [2025-03-04 15:36:09,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:09,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 17 letters. Loop has 8 letters. [2025-03-04 15:36:09,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:09,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 9 letters. Loop has 16 letters. [2025-03-04 15:36:09,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:09,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2240 transitions. [2025-03-04 15:36:09,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 131 [2025-03-04 15:36:09,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 725 states and 1315 transitions. [2025-03-04 15:36:09,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-03-04 15:36:09,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2025-03-04 15:36:09,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 725 states and 1315 transitions. [2025-03-04 15:36:09,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:09,558 INFO L218 hiAutomatonCegarLoop]: Abstraction has 725 states and 1315 transitions. [2025-03-04 15:36:09,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states and 1315 transitions. [2025-03-04 15:36:09,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 165. [2025-03-04 15:36:09,578 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-03-04 15:36:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 280 transitions. [2025-03-04 15:36:09,579 INFO L240 hiAutomatonCegarLoop]: Abstraction has 165 states and 280 transitions. [2025-03-04 15:36:09,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:09,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:36:09,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:36:09,579 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-03-04 15:36:09,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:09,590 INFO L93 Difference]: Finished difference Result 211 states and 336 transitions. [2025-03-04 15:36:09,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 336 transitions. [2025-03-04 15:36:09,592 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2025-03-04 15:36:09,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 178 states and 281 transitions. [2025-03-04 15:36:09,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-03-04 15:36:09,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-03-04 15:36:09,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 281 transitions. [2025-03-04 15:36:09,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:09,593 INFO L218 hiAutomatonCegarLoop]: Abstraction has 178 states and 281 transitions. [2025-03-04 15:36:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 281 transitions. [2025-03-04 15:36:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 124. [2025-03-04 15:36:09,600 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-03-04 15:36:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 213 transitions. [2025-03-04 15:36:09,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 213 transitions. [2025-03-04 15:36:09,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:36:09,604 INFO L432 stractBuchiCegarLoop]: Abstraction has 124 states and 213 transitions. [2025-03-04 15:36:09,604 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 15:36:09,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 213 transitions. [2025-03-04 15:36:09,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2025-03-04 15:36:09,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:09,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:09,605 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1] [2025-03-04 15:36:09,605 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 3, 2] [2025-03-04 15:36:09,605 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-03-04 15:36:09,605 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-03-04 15:36:09,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:09,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2130023351, now seen corresponding path program 9 times [2025-03-04 15:36:09,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:09,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028705129] [2025-03-04 15:36:09,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:36:09,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:09,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 4 equivalence classes. [2025-03-04 15:36:09,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:36:09,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 15:36:09,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:09,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:09,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:36:09,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:36:09,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:09,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:09,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:09,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1835099799, now seen corresponding path program 4 times [2025-03-04 15:36:09,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:09,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139589542] [2025-03-04 15:36:09,611 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:09,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:09,612 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 10 statements into 2 equivalence classes. [2025-03-04 15:36:09,614 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:36:09,614 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:09,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:09,614 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:09,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:36:09,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:36:09,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:09,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:09,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:09,621 INFO L85 PathProgramCache]: Analyzing trace with hash 719604657, now seen corresponding path program 10 times [2025-03-04 15:36:09,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:09,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667291715] [2025-03-04 15:36:09,621 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:09,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:09,623 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 15:36:09,625 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:36:09,625 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:09,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:09,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:09,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:36:09,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:36:09,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:09,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:09,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-04 15:36:09,703 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:09,703 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:09,703 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:09,703 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:09,703 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:09,703 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:09,703 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:09,703 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:09,703 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration9_Loop [2025-03-04 15:36:09,703 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:09,703 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:09,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:09,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:09,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:09,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:09,738 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:09,738 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:09,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:09,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:09,744 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:09,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-04 15:36:09,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:09,745 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:09,762 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:36:09,762 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-03-04 15:36:09,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-04 15:36:09,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:09,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:09,769 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:09,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-04 15:36:09,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:09,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:09,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:09,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:09,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:09,787 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:09,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-04 15:36:09,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:09,789 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:09,800 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:09,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-04 15:36:09,805 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:09,805 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:09,805 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:09,805 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:09,805 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:09,805 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:09,805 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:09,805 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:09,805 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration9_Loop [2025-03-04 15:36:09,805 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:09,805 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:09,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:09,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:09,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:09,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:09,839 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:09,839 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:09,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:09,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:09,841 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:09,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-04 15:36:09,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:09,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:09,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:09,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:09,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:09,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:09,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:09,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:09,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-04 15:36:09,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:09,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:09,864 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:09,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-04 15:36:09,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:09,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:09,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:09,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:09,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:09,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:09,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:09,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:09,879 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:09,880 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-04 15:36:09,880 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:36:09,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:09,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:09,882 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:09,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-04 15:36:09,883 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:09,883 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:09,883 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:09,883 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-03-04 15:36:09,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:09,889 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:09,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:09,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:36:09,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:36:09,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:09,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:09,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:09,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:36:09,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:36:09,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:09,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:36:09,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:09,957 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-03-04 15:36:09,957 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-03-04 15:36:09,966 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-03-04 15:36:09,967 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-03-04 15:36:09,967 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-03-04 15:36:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-04 15:36:09,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 9 letters. Loop has 10 letters. [2025-03-04 15:36:09,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:09,968 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:09,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:09,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:36:09,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:36:09,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:09,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:09,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:09,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:36:09,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:36:09,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:09,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:09,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:36:09,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:10,041 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-03-04 15:36:10,041 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-03-04 15:36:10,052 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-03-04 15:36:10,052 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-03-04 15:36:10,053 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-03-04 15:36:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-04 15:36:10,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 9 letters. Loop has 10 letters. [2025-03-04 15:36:10,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:10,053 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:10,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:10,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:36:10,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:36:10,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:10,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:10,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:10,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:10,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:36:10,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:36:10,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:10,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:10,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:36:10,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:10,125 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-03-04 15:36:10,125 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-03-04 15:36:10,161 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-03-04 15:36:10,161 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-03-04 15:36:10,165 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-03-04 15:36:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2025-03-04 15:36:10,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 9 letters. Loop has 10 letters. [2025-03-04 15:36:10,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:10,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 19 letters. Loop has 10 letters. [2025-03-04 15:36:10,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:10,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 9 letters. Loop has 20 letters. [2025-03-04 15:36:10,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:10,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 696 transitions. [2025-03-04 15:36:10,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2025-03-04 15:36:10,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 290 states and 440 transitions. [2025-03-04 15:36:10,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-03-04 15:36:10,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-04 15:36:10,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 440 transitions. [2025-03-04 15:36:10,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:10,171 INFO L218 hiAutomatonCegarLoop]: Abstraction has 290 states and 440 transitions. [2025-03-04 15:36:10,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 440 transitions. [2025-03-04 15:36:10,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 148. [2025-03-04 15:36:10,180 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-03-04 15:36:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 248 transitions. [2025-03-04 15:36:10,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 148 states and 248 transitions. [2025-03-04 15:36:10,180 INFO L432 stractBuchiCegarLoop]: Abstraction has 148 states and 248 transitions. [2025-03-04 15:36:10,180 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 15:36:10,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 248 transitions. [2025-03-04 15:36:10,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2025-03-04 15:36:10,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:10,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:10,181 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 2, 2, 1, 1] [2025-03-04 15:36:10,181 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 6, 4] [2025-03-04 15:36:10,181 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-03-04 15:36:10,181 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;" "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-03-04 15:36:10,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:10,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1746959979, now seen corresponding path program 11 times [2025-03-04 15:36:10,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:10,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064588663] [2025-03-04 15:36:10,182 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:10,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:10,184 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 11 statements into 5 equivalence classes. [2025-03-04 15:36:10,188 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:36:10,189 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 15:36:10,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:10,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:10,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:36:10,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:36:10,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:10,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:10,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:10,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:10,191 INFO L85 PathProgramCache]: Analyzing trace with hash 600210577, now seen corresponding path program 5 times [2025-03-04 15:36:10,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:10,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590400538] [2025-03-04 15:36:10,191 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:10,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:10,196 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 10 equivalence classes. [2025-03-04 15:36:10,199 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:36:10,199 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-04 15:36:10,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 54 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:10,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:36:10,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590400538] [2025-03-04 15:36:10,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590400538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:36:10,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633073326] [2025-03-04 15:36:10,280 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:10,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:36:10,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:10,282 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:36:10,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-03-04 15:36:10,298 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 10 equivalence classes. [2025-03-04 15:36:10,303 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:36:10,303 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-03-04 15:36:10,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:10,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:36:10,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 54 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:10,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:36:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 54 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:10,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633073326] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:36:10,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:36:10,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-03-04 15:36:10,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450102097] [2025-03-04 15:36:10,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:36:10,403 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:36:10,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:36:10,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:36:10,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2025-03-04 15:36:10,404 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 1.95) 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-03-04 15:36:10,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:36:10,441 INFO L93 Difference]: Finished difference Result 555 states and 644 transitions. [2025-03-04 15:36:10,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 555 states and 644 transitions. [2025-03-04 15:36:10,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2025-03-04 15:36:10,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 555 states to 286 states and 364 transitions. [2025-03-04 15:36:10,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:36:10,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-03-04 15:36:10,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 364 transitions. [2025-03-04 15:36:10,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:10,447 INFO L218 hiAutomatonCegarLoop]: Abstraction has 286 states and 364 transitions. [2025-03-04 15:36:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 364 transitions. [2025-03-04 15:36:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 131. [2025-03-04 15:36:10,452 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-03-04 15:36:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2025-03-04 15:36:10,453 INFO L240 hiAutomatonCegarLoop]: Abstraction has 131 states and 188 transitions. [2025-03-04 15:36:10,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 15:36:10,455 INFO L432 stractBuchiCegarLoop]: Abstraction has 131 states and 188 transitions. [2025-03-04 15:36:10,455 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 15:36:10,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 188 transitions. [2025-03-04 15:36:10,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2025-03-04 15:36:10,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:10,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:10,456 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2025-03-04 15:36:10,456 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 9, 8] [2025-03-04 15:36:10,456 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-03-04 15:36:10,456 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;" [2025-03-04 15:36:10,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:10,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1093601822, now seen corresponding path program 4 times [2025-03-04 15:36:10,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:10,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833703428] [2025-03-04 15:36:10,457 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:36:10,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:10,458 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6 statements into 2 equivalence classes. [2025-03-04 15:36:10,459 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:10,459 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:36:10,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:10,459 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:10,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:10,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:10,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:10,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:10,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:10,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:10,460 INFO L85 PathProgramCache]: Analyzing trace with hash 99033159, now seen corresponding path program 6 times [2025-03-04 15:36:10,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:10,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63621020] [2025-03-04 15:36:10,460 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:10,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:10,462 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 17 equivalence classes. [2025-03-04 15:36:10,468 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:36:10,468 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-03-04 15:36:10,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:10,468 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:10,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:36:10,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:36:10,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:10,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:10,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:10,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1499554596, now seen corresponding path program 12 times [2025-03-04 15:36:10,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:10,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876552500] [2025-03-04 15:36:10,479 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:36:10,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:10,481 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 19 equivalence classes. [2025-03-04 15:36:10,491 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:36:10,492 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2025-03-04 15:36:10,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:10,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:10,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 15:36:10,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:36:10,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:10,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:10,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:10,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-04 15:36:10,783 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:10,783 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:10,783 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:10,783 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:10,783 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:10,783 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:10,783 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:10,783 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:10,783 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2025-03-04 15:36:10,783 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:10,783 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:10,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:10,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:10,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:10,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:10,820 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:10,820 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:10,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:10,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:10,823 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:10,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-04 15:36:10,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:10,825 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:10,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-04 15:36:10,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:10,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:10,849 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:10,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-04 15:36:10,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:10,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:10,874 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:10,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-04 15:36:10,882 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:10,882 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:10,882 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:10,882 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:10,882 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:10,882 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:10,882 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:10,882 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:10,882 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2025-03-04 15:36:10,882 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:10,882 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:10,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:10,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:10,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:10,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:10,930 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:10,931 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:10,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:10,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:10,933 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:10,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-04 15:36:10,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:10,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:10,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:10,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:10,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:10,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:36:10,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:36:10,949 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:36:10,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:10,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:10,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:10,957 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:10,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-04 15:36:10,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:10,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:10,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:10,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:10,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:10,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:10,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:10,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:10,971 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:10,972 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:10,973 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:36:10,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:10,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:10,974 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:10,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-04 15:36:10,976 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:10,976 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:10,976 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:10,976 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2025-03-04 15:36:10,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:10,982 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:10,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:10,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:10,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:10,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:10,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:10,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:10,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:11,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:36:11,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:36:11,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:11,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:11,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:36:11,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 104 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:11,238 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-03-04 15:36:11,238 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-03-04 15:36:11,248 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-03-04 15:36:11,251 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-03-04 15:36:11,251 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-03-04 15:36:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-04 15:36:11,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 34 letters. [2025-03-04 15:36:11,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:11,251 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:11,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:11,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:11,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:11,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:11,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:11,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:11,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:11,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:36:11,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:36:11,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:11,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:11,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:36:11,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 104 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:11,542 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-03-04 15:36:11,542 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-03-04 15:36:11,546 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-03-04 15:36:11,546 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-03-04 15:36:11,547 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-03-04 15:36:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-04 15:36:11,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 34 letters. [2025-03-04 15:36:11,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:11,547 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:11,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:11,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-04 15:36:11,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:11,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:11,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:11,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:11,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:11,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:11,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:36:11,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:36:11,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:11,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:11,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:36:11,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 104 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:11,831 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-03-04 15:36:11,832 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-03-04 15:36:11,839 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-03-04 15:36:11,840 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-03-04 15:36:11,840 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-03-04 15:36:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-03-04 15:36:11,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 34 letters. [2025-03-04 15:36:11,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:11,841 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:11,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:11,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:11,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:11,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:11,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:11,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:11,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:11,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:36:11,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:36:11,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:11,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:11,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:36:11,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 104 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:12,082 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-03-04 15:36:12,083 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-03-04 15:36:12,114 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 230 states and 314 transitions. Complement of second has 8 states. [2025-03-04 15:36:12,114 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-03-04 15:36:12,115 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-03-04 15:36:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2025-03-04 15:36:12,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 6 letters. Loop has 34 letters. [2025-03-04 15:36:12,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:12,115 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:12,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:12,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:12,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:12,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:12,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:12,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:36:12,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:36:12,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:12,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:36:12,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 104 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:36:12,379 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-03-04 15:36:12,379 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-03-04 15:36:12,413 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,414 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,414 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,414 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,414 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,464 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,465 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,465 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,465 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,493 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,493 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,493 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,493 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,520 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,521 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,521 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,521 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,549 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,549 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,549 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,549 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,581 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,581 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,581 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,582 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,614 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,616 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,616 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,616 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,616 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,616 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,616 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,616 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,652 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,653 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,653 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,653 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,653 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,653 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,653 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,653 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,653 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,653 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,653 WARN L278 uchiComplementFKVNwa]: big8 [2025-03-04 15:36:12,657 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 1377 states and 2026 transitions. Complement of second has 289 states 36 powerset states253 rank states. The highest rank that occured is 7 [2025-03-04 15:36:12,657 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-03-04 15:36:12,658 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-03-04 15:36:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2025-03-04 15:36:12,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 79 transitions. Stem has 6 letters. Loop has 34 letters. [2025-03-04 15:36:12,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:12,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 79 transitions. Stem has 40 letters. Loop has 34 letters. [2025-03-04 15:36:12,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:12,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 79 transitions. Stem has 6 letters. Loop has 68 letters. [2025-03-04 15:36:12,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:12,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1377 states and 2026 transitions. [2025-03-04 15:36:12,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2025-03-04 15:36:12,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1377 states to 511 states and 766 transitions. [2025-03-04 15:36:12,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-03-04 15:36:12,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-03-04 15:36:12,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 511 states and 766 transitions. [2025-03-04 15:36:12,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:36:12,676 INFO L218 hiAutomatonCegarLoop]: Abstraction has 511 states and 766 transitions. [2025-03-04 15:36:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states and 766 transitions. [2025-03-04 15:36:12,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 350. [2025-03-04 15:36:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 350 states have (on average 1.5371428571428571) internal successors, (538), 349 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:36:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 538 transitions. [2025-03-04 15:36:12,684 INFO L240 hiAutomatonCegarLoop]: Abstraction has 350 states and 538 transitions. [2025-03-04 15:36:12,684 INFO L432 stractBuchiCegarLoop]: Abstraction has 350 states and 538 transitions. [2025-03-04 15:36:12,684 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 15:36:12,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 350 states and 538 transitions. [2025-03-04 15:36:12,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2025-03-04 15:36:12,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:36:12,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:36:12,686 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2025-03-04 15:36:12,687 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 10, 9] [2025-03-04 15:36:12,687 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-03-04 15:36:12,687 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-03-04 15:36:12,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1093601822, now seen corresponding path program 5 times [2025-03-04 15:36:12,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:12,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655000031] [2025-03-04 15:36:12,687 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:36:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:12,689 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-03-04 15:36:12,690 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:12,691 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:36:12,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,691 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:12,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:12,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:12,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:12,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2126383484, now seen corresponding path program 7 times [2025-03-04 15:36:12,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:12,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365953742] [2025-03-04 15:36:12,693 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:12,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 15:36:12,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:36:12,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,701 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:12,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 15:36:12,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:36:12,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:12,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:12,713 INFO L85 PathProgramCache]: Analyzing trace with hash 905282273, now seen corresponding path program 13 times [2025-03-04 15:36:12,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:36:12,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598014732] [2025-03-04 15:36:12,713 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:36:12,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:36:12,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:36:12,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:36:12,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:36:12,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:36:12,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:36:12,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:12,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:36:12,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:36:13,082 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:13,082 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:13,082 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:13,082 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:13,082 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:36:13,082 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:13,082 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:13,082 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:13,082 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2025-03-04 15:36:13,082 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:13,082 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:13,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:13,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:13,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:13,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:13,125 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:13,125 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:36:13,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:13,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:13,127 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:13,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-04 15:36:13,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:36:13,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:13,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-04 15:36:13,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:13,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:13,145 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:13,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-04 15:36:13,147 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:36:13,147 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:36:13,191 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:36:13,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-04 15:36:13,197 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:36:13,197 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:36:13,197 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:36:13,197 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:36:13,197 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:36:13,197 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:13,197 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:36:13,197 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:36:13,197 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2025-03-04 15:36:13,197 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:36:13,197 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:36:13,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:13,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:13,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:13,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:36:13,238 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:36:13,238 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:36:13,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:13,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:13,240 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:13,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-04 15:36:13,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:36:13,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:36:13,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:36:13,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:36:13,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:36:13,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:36:13,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:36:13,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:36:13,254 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:36:13,256 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:36:13,256 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-04 15:36:13,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:36:13,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:36:13,257 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:36:13,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-04 15:36:13,259 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:36:13,259 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:36:13,259 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:36:13,259 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-03-04 15:36:13,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:13,265 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:36:13,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:13,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:13,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:13,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:13,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:13,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:13,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:13,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 15:36:13,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:36:13,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:13,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:13,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:36:13,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 150 proven. 80 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 15:36:13,401 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-03-04 15:36:13,401 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 350 states and 538 transitions. cyclomatic complexity: 195 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-03-04 15:36:13,406 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 350 states and 538 transitions. cyclomatic complexity: 195. 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 374 states and 590 transitions. Complement of second has 5 states. [2025-03-04 15:36:13,406 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-03-04 15:36:13,406 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-03-04 15:36:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-04 15:36:13,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 38 letters. [2025-03-04 15:36:13,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:13,406 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:13,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:13,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:13,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:13,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:13,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:13,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:13,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:13,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 15:36:13,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:36:13,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:13,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:13,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:36:13,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 150 proven. 80 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 15:36:13,548 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-03-04 15:36:13,548 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 350 states and 538 transitions. cyclomatic complexity: 195 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-03-04 15:36:13,555 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 350 states and 538 transitions. cyclomatic complexity: 195. 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 374 states and 590 transitions. Complement of second has 5 states. [2025-03-04 15:36:13,556 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-03-04 15:36:13,556 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-03-04 15:36:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-03-04 15:36:13,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 38 letters. [2025-03-04 15:36:13,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:13,556 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:13,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:13,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:13,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:13,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:13,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:13,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:13,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:13,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 15:36:13,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:36:13,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:13,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:13,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:36:13,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 150 proven. 80 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 15:36:13,714 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-03-04 15:36:13,714 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 350 states and 538 transitions. cyclomatic complexity: 195 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-03-04 15:36:13,727 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 350 states and 538 transitions. cyclomatic complexity: 195. 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 551 states and 815 transitions. Complement of second has 7 states. [2025-03-04 15:36:13,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-04 15:36:13,728 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-03-04 15:36:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2025-03-04 15:36:13,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 38 letters. [2025-03-04 15:36:13,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:13,728 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:36:13,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:36:13,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:36:13,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:36:13,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:13,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:13,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:36:13,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:13,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 15:36:13,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:36:13,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:36:13,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:36:13,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:36:13,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:36:13,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 150 proven. 80 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 15:36:13,886 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-03-04 15:36:13,886 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 350 states and 538 transitions. cyclomatic complexity: 195 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-03-04 15:36:13,923 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 350 states and 538 transitions. cyclomatic complexity: 195. 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 731 states and 1018 transitions. Complement of second has 12 states. [2025-03-04 15:36:13,924 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-03-04 15:36:13,924 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-03-04 15:36:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2025-03-04 15:36:13,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 38 letters. [2025-03-04 15:36:13,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:13,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 44 letters. Loop has 38 letters. [2025-03-04 15:36:13,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:13,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 76 letters. [2025-03-04 15:36:13,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:36:13,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 731 states and 1018 transitions. [2025-03-04 15:36:13,933 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:36:13,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 731 states to 0 states and 0 transitions. [2025-03-04 15:36:13,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:36:13,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:36:13,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:36:13,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:36:13,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:36:13,933 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:36:13,933 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:36:13,933 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-04 15:36:13,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:36:13,934 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:36:13,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:36:13,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:36:13 BoogieIcfgContainer [2025-03-04 15:36:13,939 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:36:13,940 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:36:13,940 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:36:13,940 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:36:13,941 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:36:04" (3/4) ... [2025-03-04 15:36:13,942 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:36:13,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:36:13,943 INFO L158 Benchmark]: Toolchain (without parser) took 9772.11ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 159.0MB in the beginning and 188.2MB in the end (delta: -29.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2025-03-04 15:36:13,943 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:13,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 119.94ms. Allocated memory is still 201.3MB. Free memory was 159.0MB in the beginning and 149.2MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:36:13,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.11ms. Allocated memory is still 201.3MB. Free memory was 149.2MB in the beginning and 148.5MB in the end (delta: 749.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:13,944 INFO L158 Benchmark]: Boogie Preprocessor took 12.65ms. Allocated memory is still 201.3MB. Free memory was 148.5MB in the beginning and 147.6MB in the end (delta: 829.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:13,944 INFO L158 Benchmark]: IcfgBuilder took 142.70ms. Allocated memory is still 201.3MB. Free memory was 147.6MB in the beginning and 137.7MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:36:13,944 INFO L158 Benchmark]: BuchiAutomizer took 9468.42ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 137.7MB in the beginning and 190.2MB in the end (delta: -52.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:13,944 INFO L158 Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 243.3MB. Free memory was 190.2MB in the beginning and 188.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:36:13,945 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.84ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 119.94ms. Allocated memory is still 201.3MB. Free memory was 159.0MB in the beginning and 149.2MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.11ms. Allocated memory is still 201.3MB. Free memory was 149.2MB in the beginning and 148.5MB in the end (delta: 749.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.65ms. Allocated memory is still 201.3MB. Free memory was 148.5MB in the beginning and 147.6MB in the end (delta: 829.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 142.70ms. Allocated memory is still 201.3MB. Free memory was 147.6MB in the beginning and 137.7MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 9468.42ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 137.7MB in the beginning and 190.2MB in the end (delta: -52.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.52ms. Allocated memory is still 243.3MB. Free memory was 190.2MB in the beginning and 188.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 9.4s and 13 iterations. TraceHistogramMax:19. Analysis of lassos took 4.7s. Construction of modules took 0.3s. Büchi inclusion checks took 4.1s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1127 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 4, 1, 3]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 388/654 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 326 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 342 IncrementalHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 206 mSDtfsCounter, 342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT8 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax167 hnf100 lsp35 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq159 hnf93 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:36:13,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2025-03-04 15:36:14,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-03-04 15:36:14,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE