/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/motivating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:00,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:01,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:01,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:01,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:01,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:54:01,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:01,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:01,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:01,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:01,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:01,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:01,063 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:01,064 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:01,064 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:01,064 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:01,064 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:01,064 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:01,064 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:01,064 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:01,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:01,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:01,064 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:01,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:01,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:01,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:01,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:01,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:01,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:01,065 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:01,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:01,065 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:01,065 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:01,065 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:01,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:01,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:01,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:01,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:01,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:01,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:01,065 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:01,066 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:01,067 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:01,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:01,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:01,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:01,304 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:01,305 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:01,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/motivating.bpl [2025-04-26 16:54:01,308 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/motivating.bpl' [2025-04-26 16:54:01,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:01,330 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:01,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:01,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:01,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:01,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,367 INFO L138 Inliner]: procedures = 4, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:01,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:01,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:01,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:01,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:01,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,379 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:01,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:01,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:01,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:01,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:01,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:54:01,452 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:54:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:54:01,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:54:01,452 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:54:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:54:01,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:54:01,452 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:54:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:54:01,453 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:54:01,453 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:01,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:01,453 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:54:01,490 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:01,491 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:01,623 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:01,624 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:01,633 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:01,633 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 16:54:01,634 INFO L201 PluginConnector]: Adding new model motivating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:01 BoogieIcfgContainer [2025-04-26 16:54:01,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:01,636 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:01,636 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:01,641 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:01,641 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:01,641 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/2) ... [2025-04-26 16:54:01,643 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7252bd0f and model type motivating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:01, skipping insertion in model container [2025-04-26 16:54:01,643 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:01,643 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "motivating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:01" (2/2) ... [2025-04-26 16:54:01,644 INFO L376 chiAutomizerObserver]: Analyzing ICFG motivating.bpl [2025-04-26 16:54:01,723 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 16:54:01,766 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:01,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:01,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,769 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:54:01,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 63 transitions, 168 flow [2025-04-26 16:54:01,880 INFO L116 PetriNetUnfolderBase]: 12/51 cut-off events. [2025-04-26 16:54:01,882 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:54:01,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 51 events. 12/51 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 49. Up to 3 conditions per place. [2025-04-26 16:54:01,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 63 transitions, 168 flow [2025-04-26 16:54:01,890 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 51 transitions, 138 flow [2025-04-26 16:54:01,890 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 58 places, 51 transitions, 138 flow [2025-04-26 16:54:01,895 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:02,391 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1785#[thread2EXIT, L43-2, L25, thread1EXIT, L43-2, thread1EXIT]true [2025-04-26 16:54:02,415 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2411#[L58, L28, L78, L43, L44]true [2025-04-26 16:54:02,451 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2429#[L58, L28, L78, L43, L43-2]true [2025-04-26 16:54:02,486 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2025#[L43-2, L25, thread1EXIT, L43-2, thread1EXIT, L58]true [2025-04-26 16:54:02,490 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1145#[L24, thread1EXIT, L43-2, L44, thread1EXIT]true [2025-04-26 16:54:02,555 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3651#[thread2EXIT, L25, thread1EXIT, L44, thread1EXIT, L43-2]true [2025-04-26 16:54:02,587 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 4111#[L78, thread1EXIT, L43, L27, L44, L58]true [2025-04-26 16:54:02,603 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3819#[L25, thread1EXIT, L44, thread1EXIT, L43-2, L58]true [2025-04-26 16:54:02,607 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3185#[thread1EXIT, L24, L43-2, L43-2, thread1EXIT]true [2025-04-26 16:54:02,614 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3167#[L24, L44, L43-2, L43-2, thread1EXIT]true [2025-04-26 16:54:02,616 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 4679#[L24, L44, thread1EXIT, thread1EXIT, L43]true [2025-04-26 16:54:02,635 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 4739#[thread2EXIT, L43-2, L25, L44, thread1EXIT, thread1EXIT]true [2025-04-26 16:54:02,654 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5211#[L43-2, L78, L44, L27, thread1EXIT, L58]true [2025-04-26 16:54:02,685 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 4899#[L43-2, L25, L44, thread1EXIT, thread1EXIT, L58]true [2025-04-26 16:54:02,688 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 4667#[L24, L43-2, thread1EXIT, thread1EXIT, L43]true [2025-04-26 16:54:02,737 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5815#[thread2EXIT, L25, L43-2, L43-2, L44, thread1EXIT]true [2025-04-26 16:54:02,737 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5877#[thread2EXIT, L43-2, L25, L44, L43, thread1EXIT]true [2025-04-26 16:54:02,737 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5809#[thread2EXIT, L25, L44, L43-2, L44, thread1EXIT]true [2025-04-26 16:54:02,737 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5839#[thread2EXIT, L25, L44, L43-2, thread1EXIT, L43]true [2025-04-26 16:54:02,738 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5819#[thread2EXIT, L43-2, L25, L43-2, L44, thread1EXIT]true [2025-04-26 16:54:02,941 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6307#[L25, L43-2, L43-2, L44, thread1EXIT, L58]true [2025-04-26 16:54:02,941 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6425#[L43-2, L25, L44, L43, thread1EXIT, L58]true [2025-04-26 16:54:02,941 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6297#[L25, L44, L43-2, L44, thread1EXIT, L58]true [2025-04-26 16:54:02,941 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6347#[L25, L44, L43-2, thread1EXIT, L43, L58]true [2025-04-26 16:54:02,947 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6315#[L43-2, L25, L43-2, L44, thread1EXIT, L58]true [2025-04-26 16:54:02,949 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5737#[L24, L44, L43-2, L44, thread1EXIT]true [2025-04-26 16:54:02,951 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 4669#[L24, L43-2, L43, thread1EXIT, L43]true [2025-04-26 16:54:02,951 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 4627#[L24, L44, L43-2, L44, thread1EXIT]true [2025-04-26 16:54:02,997 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9123#[thread2EXIT, L43-2, L25, thread1EXIT, thread1EXIT, L43-2]true [2025-04-26 16:54:03,004 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9401#[thread1EXIT, L43, L26, thread1EXIT, L44, L78, L58]true [2025-04-26 16:54:03,010 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9383#[thread1EXIT, L43, L26, L77, thread1EXIT, L44, L58]true [2025-04-26 16:54:03,011 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9407#[thread1EXIT, L43, L26, thread1EXIT, L78, L58, L43-2]true [2025-04-26 16:54:03,013 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9219#[L43-2, L25, thread1EXIT, thread1EXIT, L43-2, L58]true [2025-04-26 16:54:03,015 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8815#[thread1EXIT, L24, thread1EXIT, L43-2, L44]true [2025-04-26 16:54:03,027 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9763#[thread2EXIT, L43-2, L43-2, L25, thread1EXIT, thread1EXIT]true [2025-04-26 16:54:03,041 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10073#[thread1EXIT, L26, L43-2, L78, L58, L43-2, thread1EXIT]true [2025-04-26 16:54:03,044 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9755#[L43-2, L43-2, L25, thread1EXIT, thread1EXIT, L58]true [2025-04-26 16:54:03,045 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9711#[L43, L24, thread1EXIT, thread1EXIT, L44]true [2025-04-26 16:54:03,062 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10419#[thread2EXIT, L44, L25, thread1EXIT, L43-2, L44]true [2025-04-26 16:54:03,062 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10489#[thread2EXIT, L43-2, L43-2, L25, thread1EXIT, L43]true [2025-04-26 16:54:03,062 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10451#[thread2EXIT, L43-2, L25, thread1EXIT, L43-2, L43]true [2025-04-26 16:54:03,062 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10425#[thread2EXIT, L44, L43-2, L25, thread1EXIT, L43-2]true [2025-04-26 16:54:03,063 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10423#[thread2EXIT, L44, L43-2, L25, thread1EXIT, L44]true [2025-04-26 16:54:03,115 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 11189#[thread1EXIT, L43, L26, L77, L44, L58, L43]true [2025-04-26 16:54:03,125 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10695#[L44, L25, thread1EXIT, L43-2, L44, L58]true [2025-04-26 16:54:03,126 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10829#[L43-2, L43-2, L25, thread1EXIT, L43, L58]true [2025-04-26 16:54:03,126 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10751#[L43-2, L25, thread1EXIT, L43-2, L43, L58]true [2025-04-26 16:54:03,127 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10705#[L44, L43-2, L25, thread1EXIT, L43-2, L58]true [2025-04-26 16:54:03,131 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10703#[L44, L43-2, L25, thread1EXIT, L44, L58]true [2025-04-26 16:54:03,134 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10347#[L43-2, thread1EXIT, L24, L44, L43-2]true [2025-04-26 16:54:03,135 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9713#[L43, L24, thread1EXIT, L43, L44]true [2025-04-26 16:54:03,136 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8813#[L24, thread1EXIT, L43-2, L43-2, L44]true [2025-04-26 16:54:03,136 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9665#[L43-2, thread1EXIT, L24, L43-2, L44]true [2025-04-26 16:54:03,136 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9663#[L24, thread1EXIT, L43-2, L44, L44]true [2025-04-26 16:54:03,148 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12201#[thread1EXIT, L24, L43-2, thread1EXIT, L44]true [2025-04-26 16:54:03,153 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12313#[thread2EXIT, L44, L25, thread1EXIT, thread1EXIT, L43]true [2025-04-26 16:54:03,166 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12579#[L43-2, L26, L77, thread1EXIT, L44, L58, thread1EXIT]true [2025-04-26 16:54:03,168 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12597#[L43-2, L26, thread1EXIT, L44, L78, L58, thread1EXIT]true [2025-04-26 16:54:03,169 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12401#[L44, L25, thread1EXIT, thread1EXIT, L43, L58]true [2025-04-26 16:54:03,172 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12203#[thread1EXIT, L24, L43-2, L43, L44]true [2025-04-26 16:54:03,173 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12879#[thread1EXIT, L43, L24, L44, L44]true [2025-04-26 16:54:03,187 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12957#[thread2EXIT, L43-2, L25, thread1EXIT, L43-2, L43-2]true [2025-04-26 16:54:03,187 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 13019#[thread2EXIT, L44, L25, thread1EXIT, L43, L43]true [2025-04-26 16:54:03,187 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12951#[thread2EXIT, L44, L25, thread1EXIT, L43-2, L43-2]true [2025-04-26 16:54:03,188 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12981#[thread2EXIT, L44, L25, thread1EXIT, L44, L43-2]true [2025-04-26 16:54:03,188 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12941#[thread2EXIT, L44, L25, thread1EXIT, L43-2, L44]true [2025-04-26 16:54:03,260 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 13721#[L43-2, L43, L26, L77, thread1EXIT, L44, L58]true [2025-04-26 16:54:03,269 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 13233#[L43-2, L25, thread1EXIT, L43-2, L43-2, L58]true [2025-04-26 16:54:03,269 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 13351#[L44, L25, thread1EXIT, L43, L43, L58]true [2025-04-26 16:54:03,270 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 13223#[L44, L25, thread1EXIT, L43-2, L43-2, L58]true [2025-04-26 16:54:03,270 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 13273#[L44, L25, thread1EXIT, L44, L43-2, L58]true [2025-04-26 16:54:03,275 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 13209#[L44, L25, thread1EXIT, L43-2, L44, L58]true [2025-04-26 16:54:03,276 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12871#[thread1EXIT, L43, L43-2, L24, L44]true [2025-04-26 16:54:03,278 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12181#[thread1EXIT, L43, L24, L43-2, L44]true [2025-04-26 16:54:03,280 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12191#[thread1EXIT, L43-2, L24, L44, L43-2]true [2025-04-26 16:54:03,285 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14677#[L24, L43-2, L43-2, L44, L44]true [2025-04-26 16:54:03,286 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12179#[L43, L24, L43-2, L43-2, L44]true [2025-04-26 16:54:03,288 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12131#[L24, L44, L43-2, L43-2, L44]true [2025-04-26 16:54:03,288 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14805#[L43, L24, L43-2, thread1EXIT, L44]true [2025-04-26 16:54:03,289 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14745#[L43, L24, thread1EXIT, L44, L44]true [2025-04-26 16:54:03,290 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14853#[L43, L24, L44, thread1EXIT, L44]true [2025-04-26 16:54:03,306 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 15031#[thread2EXIT, L44, L25, L43-2, thread1EXIT, L44]true [2025-04-26 16:54:03,307 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14971#[thread2EXIT, L43-2, L43-2, L25, L43-2, thread1EXIT]true [2025-04-26 16:54:03,307 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14995#[thread2EXIT, L44, L25, thread1EXIT, L43, L43]true [2025-04-26 16:54:03,307 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14965#[thread2EXIT, L43-2, L44, L25, L43-2, thread1EXIT]true [2025-04-26 16:54:03,307 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14953#[thread2EXIT, L43-2, L44, L25, L44, thread1EXIT]true [2025-04-26 16:54:03,359 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 15731#[L26, L77, L44, L44, L44, L58, thread1EXIT]true [2025-04-26 16:54:03,368 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 15363#[L44, L25, L43-2, thread1EXIT, L44, L58]true [2025-04-26 16:54:03,370 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 15247#[L43-2, L43-2, L25, L43-2, thread1EXIT, L58]true [2025-04-26 16:54:03,370 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 15291#[L44, L25, thread1EXIT, L43, L43, L58]true [2025-04-26 16:54:03,370 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 15237#[L43-2, L44, L25, L43-2, thread1EXIT, L58]true [2025-04-26 16:54:03,370 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 15221#[L43-2, L44, L25, L44, thread1EXIT, L58]true [2025-04-26 16:54:03,375 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14841#[L43-2, L24, L44, thread1EXIT, L43]true [2025-04-26 16:54:03,376 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14799#[L24, L43-2, L43-2, thread1EXIT, L44]true [2025-04-26 16:54:03,376 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14829#[L43, L43, L24, thread1EXIT, L44]true [2025-04-26 16:54:03,377 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14733#[L43, L43-2, L24, thread1EXIT, L44]true [2025-04-26 16:54:03,383 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14807#[L43, L24, L43-2, L43, L44]true [2025-04-26 16:54:03,384 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14747#[L43, L24, L43, L44, L44]true [2025-04-26 16:54:03,386 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16731#[L24, L43-2, L44, L43-2, L44]true [2025-04-26 16:54:03,435 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16887#[thread2EXIT, L43-2, L25, L44, L43-2, L44]true [2025-04-26 16:54:03,435 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17089#[thread2EXIT, L44, L25, L43-2, L44, L43]true [2025-04-26 16:54:03,435 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16879#[thread2EXIT, L44, L25, L44, L43-2, L44]true [2025-04-26 16:54:03,435 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16919#[thread2EXIT, L44, L25, L43-2, L44, L43]true [2025-04-26 16:54:03,436 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17109#[thread2EXIT, L43-2, L43-2, L25, L43-2, L43]true [2025-04-26 16:54:03,436 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16999#[thread2EXIT, L43-2, L25, L43-2, L43-2, L43]true [2025-04-26 16:54:03,436 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17053#[thread2EXIT, L44, L25, L43, L43, L43]true [2025-04-26 16:54:03,436 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17105#[thread2EXIT, L44, L43-2, L25, L43-2, L43]true [2025-04-26 16:54:03,436 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16995#[thread2EXIT, L44, L25, L43-2, L43-2, L43]true [2025-04-26 16:54:03,436 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17125#[thread2EXIT, L44, L43-2, L25, L44, L43]true [2025-04-26 16:54:03,436 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17015#[thread2EXIT, L44, L25, L44, L43-2, L43]true [2025-04-26 16:54:03,437 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16949#[thread2EXIT, L43-2, L43-2, L25, L43-2, L43]true [2025-04-26 16:54:03,437 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16973#[thread2EXIT, L44, L43-2, L25, L43-2, L43-2]true [2025-04-26 16:54:03,438 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16893#[thread2EXIT, L43-2, L43-2, L25, L44, L44]true [2025-04-26 16:54:03,438 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16977#[thread2EXIT, L44, L25, L43-2, L44, L43]true [2025-04-26 16:54:03,439 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16885#[thread2EXIT, L44, L43-2, L25, L44, L44]true [2025-04-26 16:54:03,439 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16923#[thread2EXIT, L44, L43-2, L25, L44, L43]true [2025-04-26 16:54:03,440 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16891#[thread2EXIT, L43-2, L25, L43-2, L44, L44]true [2025-04-26 16:54:03,645 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 19163#[L43, L26, L77, L44, L44, L44, L58]true [2025-04-26 16:54:03,677 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17703#[L43-2, L25, L44, L43-2, L44, L58]true [2025-04-26 16:54:03,677 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 18069#[L44, L25, L43-2, L44, L43, L58]true [2025-04-26 16:54:03,677 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17691#[L44, L25, L44, L43-2, L44, L58]true [2025-04-26 16:54:03,677 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17751#[L44, L25, L43-2, L44, L43, L58]true [2025-04-26 16:54:03,680 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 18109#[L43-2, L43-2, L25, L43-2, L43, L58]true [2025-04-26 16:54:03,680 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17887#[L43-2, L25, L43-2, L43-2, L43, L58]true [2025-04-26 16:54:03,680 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17997#[L44, L25, L43, L43, L43, L58]true [2025-04-26 16:54:03,680 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 18101#[L44, L43-2, L25, L43-2, L43, L58]true [2025-04-26 16:54:03,680 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17879#[L44, L25, L43-2, L43-2, L43, L58]true [2025-04-26 16:54:03,681 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 18141#[L44, L43-2, L25, L44, L43, L58]true [2025-04-26 16:54:03,681 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17919#[L44, L25, L44, L43-2, L43, L58]true [2025-04-26 16:54:03,684 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17801#[L43-2, L43-2, L25, L43-2, L43, L58]true [2025-04-26 16:54:03,722 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17841#[L44, L43-2, L25, L43-2, L43-2, L58]true [2025-04-26 16:54:03,736 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17713#[L43-2, L43-2, L25, L44, L44, L58]true [2025-04-26 16:54:03,736 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17849#[L44, L25, L43-2, L44, L43, L58]true [2025-04-26 16:54:03,736 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17701#[L44, L43-2, L25, L44, L44, L58]true [2025-04-26 16:54:03,737 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17759#[L44, L43-2, L25, L44, L43, L58]true [2025-04-26 16:54:03,745 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17707#[L43-2, L25, L43-2, L44, L44, L58]true [2025-04-26 16:54:03,749 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16727#[L24, L43-2, L44, L44, L44]true [2025-04-26 16:54:03,751 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16683#[L43, L43-2, L24, L44, L43]true [2025-04-26 16:54:03,752 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16763#[L24, L44, L43-2, L44, L44]true [2025-04-26 16:54:03,758 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14843#[L43-2, L24, L44, L43, L43]true [2025-04-26 16:54:03,759 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14801#[L24, L43-2, L43, L43-2, L44]true [2025-04-26 16:54:03,759 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14831#[L43, L43, L24, L43, L44]true [2025-04-26 16:54:03,760 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 12161#[L43-2, L24, L43-2, L43-2, L43-2]true [2025-04-26 16:54:03,761 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14735#[L43, L43-2, L24, L43, L44]true [2025-04-26 16:54:03,762 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14693#[L24, L44, L43-2, L44, L44]true [2025-04-26 16:54:03,778 WARN L140 AmpleReduction]: Number of pruned transitions: 36741 [2025-04-26 16:54:03,778 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 145 [2025-04-26 16:54:03,778 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 2168 [2025-04-26 16:54:03,778 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:363 [2025-04-26 16:54:03,779 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:6814 [2025-04-26 16:54:03,779 WARN L145 AmpleReduction]: Times succ was already a loop node:8903 [2025-04-26 16:54:03,779 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:9473 [2025-04-26 16:54:03,779 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:03,813 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 9201 states, 9199 states have (on average 3.0584846178932494) internal successors, (in total 28135), 9200 states have internal predecessors, (28135), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:03,821 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:03,821 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:03,821 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:03,821 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:03,821 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:03,821 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:03,821 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:03,821 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:03,849 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9201 states, 9199 states have (on average 3.0584846178932494) internal successors, (in total 28135), 9200 states have internal predecessors, (28135), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:04,084 INFO L131 ngComponentsAnalysis]: Automaton has 241 accepting balls. 8040 [2025-04-26 16:54:04,084 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:04,084 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:04,090 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:54:04,090 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:04,090 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:04,112 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9201 states, 9199 states have (on average 3.0584846178932494) internal successors, (in total 28135), 9200 states have internal predecessors, (28135), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:04,272 INFO L131 ngComponentsAnalysis]: Automaton has 241 accepting balls. 8040 [2025-04-26 16:54:04,272 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:04,272 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:04,272 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:54:04,272 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:04,276 INFO L752 eck$LassoCheckResult]: Stem: "[89] $Ultimate##0-->L19: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[92] L19-->L21: Formula: (= v_i_5 0) InVars {} OutVars{i=v_i_5} AuxVars[] AssignedVars[i]" "[133] L21-->L43-2: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" [2025-04-26 16:54:04,277 INFO L754 eck$LassoCheckResult]: Loop: "[95] L43-2-->L43: Formula: true InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[97] L43-->L43-2: Formula: (or (<= v_N_2 v_i_4) (< v_i_4 0)) InVars {i=v_i_4, N=v_N_2} OutVars{i=v_i_4, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 16:54:04,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:04,282 INFO L85 PathProgramCache]: Analyzing trace with hash 118305, now seen corresponding path program 1 times [2025-04-26 16:54:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:04,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372354517] [2025-04-26 16:54:04,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:04,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:04,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:04,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:04,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:04,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:04,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:04,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash 4003, now seen corresponding path program 1 times [2025-04-26 16:54:04,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:04,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322973726] [2025-04-26 16:54:04,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:04,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:04,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:04,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:04,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,375 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:04,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:04,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:04,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:04,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:04,383 INFO L85 PathProgramCache]: Analyzing trace with hash 113694147, now seen corresponding path program 1 times [2025-04-26 16:54:04,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:04,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680596317] [2025-04-26 16:54:04,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:04,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:04,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:04,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:04,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:04,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:04,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:04,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:04,571 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:04,572 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:04,572 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:04,572 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:04,572 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:54:04,572 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:04,572 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:04,573 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:04,573 INFO L132 ssoRankerPreferences]: Filename of dumped script: motivating.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:04,573 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:04,573 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:04,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:04,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:04,659 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:04,659 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:54:04,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:04,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:04,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:04,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:54:04,666 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:04,666 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:04,681 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:04,682 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_thidvar0=0} Honda state: {thread1Thread1of1ForFork1_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:04,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:04,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:04,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:04,695 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:04,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:54:04,698 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:04,698 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:04,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:04,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:04,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:04,726 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:04,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:54:04,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:04,731 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:04,770 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:04,770 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {N=5, ULTIMATE.start_m=4, i=0} Honda state: {N=5, ULTIMATE.start_m=4, i=0} Generalized eigenvectors: [{N=7, ULTIMATE.start_m=6, i=0}, {N=0, ULTIMATE.start_m=0, i=7}, {N=-7, ULTIMATE.start_m=-6, i=-1}] Lambdas: [1, 0, 1] Nus: [1, 0] [2025-04-26 16:54:04,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:04,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:04,804 INFO L201 PluginConnector]: Adding new model motivating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:04 BoogieIcfgContainer [2025-04-26 16:54:04,805 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:04,806 INFO L158 Benchmark]: Toolchain (without parser) took 3475.10ms. Allocated memory was 159.4MB in the beginning and 281.0MB in the end (delta: 121.6MB). Free memory was 85.5MB in the beginning and 178.4MB in the end (delta: -93.0MB). Peak memory consumption was 151.7MB. Max. memory is 8.0GB. [2025-04-26 16:54:04,807 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:04,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.26ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 83.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:04,810 INFO L158 Benchmark]: Boogie Preprocessor took 24.74ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 82.5MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:54:04,810 INFO L158 Benchmark]: RCFGBuilder took 239.75ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 72.8MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:54:04,810 INFO L158 Benchmark]: BuchiAutomizer took 3168.92ms. Allocated memory was 159.4MB in the beginning and 281.0MB in the end (delta: 121.6MB). Free memory was 72.7MB in the beginning and 178.4MB in the end (delta: -105.7MB). Peak memory consumption was 139.1MB. Max. memory is 8.0GB. [2025-04-26 16:54:04,812 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.26ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 83.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.74ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 82.5MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 239.75ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 72.8MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3168.92ms. Allocated memory was 159.4MB in the beginning and 281.0MB in the end (delta: 121.6MB). Free memory was 72.7MB in the beginning and 178.4MB in the end (delta: -105.7MB). Peak memory consumption was 139.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 1 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf100 lsp87 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq119 hnf95 smp100 dnf100 smp100 tf100 neg100 sie116 LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 2.0s InitialAbstraction: Time to compute Ample Reduction [ms]: 2019, Number of transitions in reduction automaton: 28135, Number of states in reduction automaton: 9201, Underlying: - StatisticsResult: Constructed decomposition of program Trivial decomposition into one nonterminating module. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 41]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {N=5, i=0, m=4, freshIdentifier7=0} State at position 1 is {N=5, i=0, m=4, freshIdentifier8=1} For i>1, the state at position i is {N=5 + sum_{k=0}^i 7 + -7, i=0 + sum_{k=0}^i 7*0^k + 7*k + -1, m=4 + sum_{k=0}^i 6 + -6, freshIdentifier9=1 + sum_{k=0}^i 0} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 3GEVs Lambdas: [1, 0, 1] Mus: [1, 0] - NonterminatingLassoResult [Line: 41]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L17] 0 assume 0 <= m && m < N; [L19] 0 i := 0; [L21] FORK 0 fork 1 thread1(); Loop: [L42] havoc i; [L43] COND FALSE !(0 <= i && i < N) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:54:04,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...