/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/weaver-benchmarks/generated/bench/exp3x3-opt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:30,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:31,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:31,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:31,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:31,050 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:31,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:31,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:31,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:31,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:31,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:31,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:31,075 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:31,075 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:31,075 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:31,075 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:31,075 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:31,075 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:31,075 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:31,075 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:31,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:31,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:31,075 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:31,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:31,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:31,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:31,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:31,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:31,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:31,076 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:31,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:31,076 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:31,076 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:31,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:31,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:31,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:31,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:31,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:31,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:31,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:31,076 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:31,076 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:31,076 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:31,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:31,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:31,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:31,325 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:31,325 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:31,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp3x3-opt.wvr.bpl [2025-04-26 16:54:31,328 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp3x3-opt.wvr.bpl' [2025-04-26 16:54:31,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:31,350 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:31,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:31,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:31,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:31,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:31" (1/1) ... [2025-04-26 16:54:31,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:31" (1/1) ... [2025-04-26 16:54:31,387 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:31,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:31,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:31,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:31,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:31,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:31" (1/1) ... [2025-04-26 16:54:31,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:31" (1/1) ... [2025-04-26 16:54:31,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:31" (1/1) ... [2025-04-26 16:54:31,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:31" (1/1) ... [2025-04-26 16:54:31,402 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:31" (1/1) ... [2025-04-26 16:54:31,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:31" (1/1) ... [2025-04-26 16:54:31,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:31" (1/1) ... [2025-04-26 16:54:31,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:31" (1/1) ... [2025-04-26 16:54:31,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:31" (1/1) ... [2025-04-26 16:54:31,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:31,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:31,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:31,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:31,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:31" (1/1) ... [2025-04-26 16:54:31,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:31,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:31,451 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:31,453 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:31,472 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:54:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:54:31,472 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:54:31,472 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:54:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:54:31,472 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:54:31,472 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:31,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:31,472 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:54:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:54:31,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:54:31,473 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:54:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:54:31,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:54:31,473 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:54:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:54:31,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:54:31,473 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:54:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:54:31,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:54:31,474 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:31,509 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:31,510 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:31,588 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:31,588 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:31,617 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:31,617 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2025-04-26 16:54:31,619 INFO L201 PluginConnector]: Adding new model exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:31 BoogieIcfgContainer [2025-04-26 16:54:31,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:31,622 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:31,622 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:31,628 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:31,628 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:31,629 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:31" (1/2) ... [2025-04-26 16:54:31,630 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e1de297 and model type exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:31, skipping insertion in model container [2025-04-26 16:54:31,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:31,630 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:31" (2/2) ... [2025-04-26 16:54:31,632 INFO L376 chiAutomizerObserver]: Analyzing ICFG exp3x3-opt.wvr.bpl [2025-04-26 16:54:31,685 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 16:54:31,720 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:31,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:31,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:31,722 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:31,724 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:31,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 41 transitions, 124 flow [2025-04-26 16:54:31,793 INFO L116 PetriNetUnfolderBase]: 6/29 cut-off events. [2025-04-26 16:54:31,795 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:54:31,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 29 events. 6/29 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-26 16:54:31,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 41 transitions, 124 flow [2025-04-26 16:54:31,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 29 transitions, 94 flow [2025-04-26 16:54:31,803 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 42 places, 29 transitions, 94 flow [2025-04-26 16:54:31,808 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:31,882 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 85#[thread2EXIT, thread5EXIT, thread1EXIT, thread4EXIT, thread3EXIT, L92, L76]true [2025-04-26 16:54:31,888 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 89#[thread4EXIT, L76, L93, thread5EXIT, thread3EXIT, thread2EXIT]true [2025-04-26 16:54:31,894 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 111#[thread3EXIT, L94, thread5EXIT, L76, thread4EXIT]true [2025-04-26 16:54:31,916 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 113#[L95, L76, thread4EXIT, thread5EXIT]true [2025-04-26 16:54:31,919 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 115#[L76, thread5EXIT, L96]true [2025-04-26 16:54:31,920 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 79#[thread4EXIT, thread1EXIT, L65, thread3EXIT, L91, thread2EXIT]true [2025-04-26 16:54:31,921 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 83#[L65, thread2EXIT, thread1EXIT, thread4EXIT, thread3EXIT, L92, L76]true [2025-04-26 16:54:31,921 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 119#[L65, thread2EXIT, thread1EXIT, thread4EXIT, thread3EXIT, L92, thread6EXIT]true [2025-04-26 16:54:31,922 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 123#[thread4EXIT, L65, thread6EXIT, L93, thread3EXIT, thread2EXIT]true [2025-04-26 16:54:31,923 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 125#[thread3EXIT, L94, L65, thread6EXIT, thread4EXIT]true [2025-04-26 16:54:31,923 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 127#[L95, thread4EXIT, L65, thread6EXIT]true [2025-04-26 16:54:31,924 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 121#[thread4EXIT, L76, L65, L93, thread3EXIT, thread2EXIT]true [2025-04-26 16:54:31,925 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 131#[thread3EXIT, L94, L65, L76, thread4EXIT]true [2025-04-26 16:54:31,925 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 133#[L95, L76, thread4EXIT, L65]true [2025-04-26 16:54:31,926 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 135#[L65, L76, L96]true [2025-04-26 16:54:31,926 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 73#[thread3EXIT, L90, L54, thread2EXIT, thread1EXIT]true [2025-04-26 16:54:31,927 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 75#[L54, thread1EXIT, L65, thread3EXIT, L91, thread2EXIT]true [2025-04-26 16:54:31,927 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 137#[L54, thread1EXIT, thread5EXIT, thread3EXIT, L91, thread2EXIT]true [2025-04-26 16:54:31,928 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141#[L54, thread2EXIT, thread5EXIT, thread1EXIT, thread3EXIT, L92, L76]true [2025-04-26 16:54:31,929 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 143#[L54, thread2EXIT, thread5EXIT, thread1EXIT, thread3EXIT, L92, thread6EXIT]true [2025-04-26 16:54:31,930 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 147#[L54, L93, thread5EXIT, thread6EXIT, thread3EXIT, thread2EXIT]true [2025-04-26 16:54:31,931 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 149#[thread3EXIT, L54, L94, thread6EXIT, thread5EXIT]true [2025-04-26 16:54:31,932 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 145#[L76, L54, L93, thread5EXIT, thread3EXIT, thread2EXIT]true [2025-04-26 16:54:31,932 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 153#[thread3EXIT, L54, L94, thread5EXIT, L76]true [2025-04-26 16:54:31,933 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 155#[L54, L95, L76, thread5EXIT]true [2025-04-26 16:54:31,936 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 139#[L54, L65, thread2EXIT, thread1EXIT, thread3EXIT, L92, L76]true [2025-04-26 16:54:31,937 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 157#[L54, L65, thread2EXIT, thread1EXIT, thread3EXIT, L92, thread6EXIT]true [2025-04-26 16:54:31,937 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 161#[L54, L65, thread6EXIT, L93, thread3EXIT, thread2EXIT]true [2025-04-26 16:54:31,938 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 163#[thread3EXIT, L54, L94, L65, thread6EXIT]true [2025-04-26 16:54:31,939 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 165#[L54, L95, L65, thread6EXIT]true [2025-04-26 16:54:31,939 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 159#[L76, L54, L65, L93, thread3EXIT, thread2EXIT]true [2025-04-26 16:54:31,940 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 167#[thread3EXIT, L54, L94, L65, L76]true [2025-04-26 16:54:31,941 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 169#[L54, L95, L76, L65]true [2025-04-26 16:54:31,941 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 67#[thread2EXIT, thread1EXIT, L89, L43]true [2025-04-26 16:54:31,942 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 69#[L90, L54, thread2EXIT, thread1EXIT, L43]true [2025-04-26 16:54:31,942 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 173#[L90, thread2EXIT, thread1EXIT, L43, thread4EXIT]true [2025-04-26 16:54:31,944 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 175#[thread4EXIT, thread1EXIT, L65, L91, L43, thread2EXIT]true [2025-04-26 16:54:31,944 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 177#[thread4EXIT, thread1EXIT, thread5EXIT, L91, L43, thread2EXIT]true [2025-04-26 16:54:31,945 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 181#[L43, thread2EXIT, thread5EXIT, thread1EXIT, thread4EXIT, L92, L76]true [2025-04-26 16:54:31,946 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 183#[L43, thread2EXIT, thread5EXIT, thread1EXIT, thread4EXIT, L92, thread6EXIT]true [2025-04-26 16:54:31,946 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 187#[thread4EXIT, L93, thread5EXIT, thread6EXIT, L43, thread2EXIT]true [2025-04-26 16:54:31,947 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 185#[thread4EXIT, L76, L93, thread5EXIT, L43, thread2EXIT]true [2025-04-26 16:54:31,947 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 191#[L94, L43, thread5EXIT, L76, thread4EXIT]true [2025-04-26 16:54:31,949 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179#[L43, L65, thread2EXIT, thread1EXIT, thread4EXIT, L92, L76]true [2025-04-26 16:54:31,950 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 193#[L43, L65, thread2EXIT, thread1EXIT, thread4EXIT, L92, thread6EXIT]true [2025-04-26 16:54:31,951 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 197#[thread4EXIT, L65, thread6EXIT, L93, L43, thread2EXIT]true [2025-04-26 16:54:31,951 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199#[L94, L65, thread6EXIT, L43, thread4EXIT]true [2025-04-26 16:54:31,952 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 195#[thread4EXIT, L76, L65, L93, L43, thread2EXIT]true [2025-04-26 16:54:31,952 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 201#[L94, L65, L43, L76, thread4EXIT]true [2025-04-26 16:54:31,953 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 171#[L54, thread1EXIT, L65, L91, L43, thread2EXIT]true [2025-04-26 16:54:31,954 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 203#[L54, thread1EXIT, thread5EXIT, L91, L43, thread2EXIT]true [2025-04-26 16:54:31,956 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 207#[L43, L54, thread2EXIT, thread5EXIT, thread1EXIT, L92, L76]true [2025-04-26 16:54:31,957 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 209#[L43, L54, thread2EXIT, thread5EXIT, thread1EXIT, L92, thread6EXIT]true [2025-04-26 16:54:31,958 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 213#[L54, L93, thread5EXIT, thread6EXIT, L43, thread2EXIT]true [2025-04-26 16:54:31,958 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 215#[L54, L94, thread6EXIT, L43, thread5EXIT]true [2025-04-26 16:54:31,959 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 211#[L76, L54, L93, thread5EXIT, L43, thread2EXIT]true [2025-04-26 16:54:31,959 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 217#[L54, L94, L43, thread5EXIT, L76]true [2025-04-26 16:54:31,960 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 205#[L43, L54, L65, thread2EXIT, thread1EXIT, L92, L76]true [2025-04-26 16:54:31,963 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 219#[L43, L54, L65, thread2EXIT, thread1EXIT, L92, thread6EXIT]true [2025-04-26 16:54:31,965 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 223#[L54, L65, thread6EXIT, L93, L43, thread2EXIT]true [2025-04-26 16:54:31,966 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 225#[L54, L94, L65, thread6EXIT, L43]true [2025-04-26 16:54:31,966 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 221#[L76, L54, L65, L93, L43, thread2EXIT]true [2025-04-26 16:54:31,967 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 227#[L54, L94, L65, L43, L76]true [2025-04-26 16:54:31,967 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 61#[L88, thread1EXIT, L32]true [2025-04-26 16:54:31,968 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 63#[thread1EXIT, L89, L43, L32]true [2025-04-26 16:54:31,968 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 231#[thread3EXIT, thread1EXIT, L89, L32]true [2025-04-26 16:54:31,970 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 233#[thread3EXIT, L90, L54, thread1EXIT, L32]true [2025-04-26 16:54:31,971 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 237#[thread3EXIT, L90, thread1EXIT, thread4EXIT, L32]true [2025-04-26 16:54:31,971 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 239#[thread4EXIT, thread1EXIT, L65, thread3EXIT, L91, L32]true [2025-04-26 16:54:31,973 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 241#[thread4EXIT, thread1EXIT, thread5EXIT, thread3EXIT, L91, L32]true [2025-04-26 16:54:31,974 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 245#[thread5EXIT, thread1EXIT, thread4EXIT, thread3EXIT, L32, L92, L76]true [2025-04-26 16:54:31,974 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 247#[thread5EXIT, thread1EXIT, thread4EXIT, thread3EXIT, L32, L92, thread6EXIT]true [2025-04-26 16:54:31,975 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 249#[thread4EXIT, L76, L93, thread5EXIT, thread3EXIT, L32]true [2025-04-26 16:54:31,976 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 243#[L65, thread1EXIT, thread4EXIT, thread3EXIT, L32, L92, L76]true [2025-04-26 16:54:31,976 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 253#[L65, thread1EXIT, thread4EXIT, thread3EXIT, L32, L92, thread6EXIT]true [2025-04-26 16:54:31,979 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 257#[thread4EXIT, L65, thread6EXIT, L93, thread3EXIT, L32]true [2025-04-26 16:54:31,979 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 255#[thread4EXIT, L76, L65, L93, thread3EXIT, L32]true [2025-04-26 16:54:31,980 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 235#[L54, thread1EXIT, L65, thread3EXIT, L91, L32]true [2025-04-26 16:54:31,980 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 259#[L54, thread1EXIT, thread5EXIT, thread3EXIT, L91, L32]true [2025-04-26 16:54:31,981 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 263#[L54, thread5EXIT, thread1EXIT, thread3EXIT, L32, L92, L76]true [2025-04-26 16:54:31,981 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 265#[L54, thread5EXIT, thread1EXIT, thread3EXIT, L32, L92, thread6EXIT]true [2025-04-26 16:54:31,982 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 269#[L54, L93, thread5EXIT, thread6EXIT, thread3EXIT, L32]true [2025-04-26 16:54:31,982 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 267#[L76, L54, L93, thread5EXIT, thread3EXIT, L32]true [2025-04-26 16:54:31,983 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 261#[L54, L65, thread1EXIT, thread3EXIT, L32, L92, L76]true [2025-04-26 16:54:31,989 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 271#[L54, L65, thread1EXIT, thread3EXIT, L32, L92, thread6EXIT]true [2025-04-26 16:54:31,989 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 275#[L54, L65, thread6EXIT, L93, thread3EXIT, L32]true [2025-04-26 16:54:31,990 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 273#[L76, L54, L65, L93, thread3EXIT, L32]true [2025-04-26 16:54:31,990 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 229#[L90, L54, thread1EXIT, L43, L32]true [2025-04-26 16:54:31,991 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 279#[L90, thread1EXIT, L43, thread4EXIT, L32]true [2025-04-26 16:54:31,991 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 281#[thread4EXIT, thread1EXIT, L65, L91, L43, L32]true [2025-04-26 16:54:31,992 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 283#[thread4EXIT, thread1EXIT, thread5EXIT, L91, L43, L32]true [2025-04-26 16:54:31,994 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 287#[L43, thread5EXIT, thread1EXIT, thread4EXIT, L32, L92, L76]true [2025-04-26 16:54:31,995 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 289#[L43, thread5EXIT, thread1EXIT, thread4EXIT, L32, L92, thread6EXIT]true [2025-04-26 16:54:31,995 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 293#[thread4EXIT, L93, thread5EXIT, thread6EXIT, L43, L32]true [2025-04-26 16:54:31,996 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 291#[thread4EXIT, L76, L93, thread5EXIT, L43, L32]true [2025-04-26 16:54:31,997 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 285#[L43, L65, thread1EXIT, thread4EXIT, L32, L92, L76]true [2025-04-26 16:54:31,997 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 295#[L43, L65, thread1EXIT, thread4EXIT, L32, L92, thread6EXIT]true [2025-04-26 16:54:32,000 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 299#[thread4EXIT, L65, thread6EXIT, L93, L43, L32]true [2025-04-26 16:54:32,001 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 297#[thread4EXIT, L76, L65, L93, L43, L32]true [2025-04-26 16:54:32,001 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 277#[L54, thread1EXIT, L65, L91, L43, L32]true [2025-04-26 16:54:32,002 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 301#[L54, thread1EXIT, thread5EXIT, L91, L43, L32]true [2025-04-26 16:54:32,002 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 305#[L43, L54, thread5EXIT, thread1EXIT, L32, L92, L76]true [2025-04-26 16:54:32,003 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 307#[L43, L54, thread5EXIT, thread1EXIT, L32, L92, thread6EXIT]true [2025-04-26 16:54:32,003 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 311#[L54, L93, thread5EXIT, thread6EXIT, L43, L32]true [2025-04-26 16:54:32,006 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 309#[L76, L54, L93, thread5EXIT, L43, L32]true [2025-04-26 16:54:32,007 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 303#[L43, L54, L65, thread1EXIT, L32, L92, L76]true [2025-04-26 16:54:32,007 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 313#[L43, L54, L65, thread1EXIT, L32, L92, thread6EXIT]true [2025-04-26 16:54:32,008 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 317#[L54, L65, thread6EXIT, L93, L43, L32]true [2025-04-26 16:54:32,009 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 315#[L76, L54, L65, L93, L43, L32]true [2025-04-26 16:54:32,009 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 55#[L21, L87-1]true [2025-04-26 16:54:32,009 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 57#[L88, L21, L32]true [2025-04-26 16:54:32,012 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 321#[L88, thread2EXIT, L21]true [2025-04-26 16:54:32,013 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 323#[thread2EXIT, L89, L43, L21]true [2025-04-26 16:54:32,013 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 327#[thread2EXIT, thread3EXIT, L89, L21]true [2025-04-26 16:54:32,013 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 329#[thread3EXIT, L90, L54, thread2EXIT, L21]true [2025-04-26 16:54:32,014 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 333#[thread3EXIT, L90, thread2EXIT, L21, thread4EXIT]true [2025-04-26 16:54:32,014 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 335#[thread4EXIT, L21, L65, thread3EXIT, L91, thread2EXIT]true [2025-04-26 16:54:32,015 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 337#[thread4EXIT, L21, thread5EXIT, thread3EXIT, L91, thread2EXIT]true [2025-04-26 16:54:32,015 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 341#[thread2EXIT, thread5EXIT, thread4EXIT, thread3EXIT, L21, L92, L76]true [2025-04-26 16:54:32,019 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 339#[L65, thread2EXIT, thread4EXIT, thread3EXIT, L21, L92, L76]true [2025-04-26 16:54:32,019 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 345#[L65, thread2EXIT, thread4EXIT, thread3EXIT, L21, L92, thread6EXIT]true [2025-04-26 16:54:32,019 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 331#[L54, L21, L65, thread3EXIT, L91, thread2EXIT]true [2025-04-26 16:54:32,020 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 347#[L54, L21, thread5EXIT, thread3EXIT, L91, thread2EXIT]true [2025-04-26 16:54:32,020 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 351#[L54, thread2EXIT, thread5EXIT, thread3EXIT, L21, L92, L76]true [2025-04-26 16:54:32,021 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 353#[L54, thread2EXIT, thread5EXIT, thread3EXIT, L21, L92, thread6EXIT]true [2025-04-26 16:54:32,021 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 349#[L54, L65, thread2EXIT, thread3EXIT, L21, L92, L76]true [2025-04-26 16:54:32,021 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 355#[L54, L65, thread2EXIT, thread3EXIT, L21, L92, thread6EXIT]true [2025-04-26 16:54:32,022 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 325#[L90, L54, thread2EXIT, L43, L21]true [2025-04-26 16:54:32,022 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 359#[L90, thread2EXIT, L43, L21, thread4EXIT]true [2025-04-26 16:54:32,023 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 361#[thread4EXIT, L21, L65, L91, L43, thread2EXIT]true [2025-04-26 16:54:32,023 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 363#[thread4EXIT, L21, thread5EXIT, L91, L43, thread2EXIT]true [2025-04-26 16:54:32,024 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 367#[L43, thread2EXIT, thread5EXIT, thread4EXIT, L21, L92, L76]true [2025-04-26 16:54:32,024 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 369#[L43, thread2EXIT, thread5EXIT, thread4EXIT, L21, L92, thread6EXIT]true [2025-04-26 16:54:32,025 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 365#[L43, L65, thread2EXIT, thread4EXIT, L21, L92, L76]true [2025-04-26 16:54:32,025 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 371#[L43, L65, thread2EXIT, thread4EXIT, L21, L92, thread6EXIT]true [2025-04-26 16:54:32,026 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 357#[L54, L21, L65, L91, L43, thread2EXIT]true [2025-04-26 16:54:32,027 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 373#[L54, L21, thread5EXIT, L91, L43, thread2EXIT]true [2025-04-26 16:54:32,027 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 377#[L43, L54, thread2EXIT, thread5EXIT, L21, L92, L76]true [2025-04-26 16:54:32,028 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 379#[L43, L54, thread2EXIT, thread5EXIT, L21, L92, thread6EXIT]true [2025-04-26 16:54:32,028 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 375#[L43, L54, L65, thread2EXIT, L21, L92, L76]true [2025-04-26 16:54:32,029 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 381#[L43, L54, L65, thread2EXIT, L21, L92, thread6EXIT]true [2025-04-26 16:54:32,029 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 319#[L89, L43, L21, L32]true [2025-04-26 16:54:32,029 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 385#[thread3EXIT, L89, L21, L32]true [2025-04-26 16:54:32,032 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 387#[thread3EXIT, L90, L54, L21, L32]true [2025-04-26 16:54:32,033 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 391#[thread3EXIT, L90, L21, thread4EXIT, L32]true [2025-04-26 16:54:32,033 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 393#[thread4EXIT, L21, L65, thread3EXIT, L91, L32]true [2025-04-26 16:54:32,034 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 395#[thread4EXIT, L21, thread5EXIT, thread3EXIT, L91, L32]true [2025-04-26 16:54:32,034 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 399#[thread5EXIT, thread4EXIT, thread3EXIT, L32, L21, L92, L76]true [2025-04-26 16:54:32,035 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 401#[thread5EXIT, thread4EXIT, thread3EXIT, L32, L21, L92, thread6EXIT]true [2025-04-26 16:54:32,036 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 397#[L65, thread4EXIT, thread3EXIT, L32, L21, L92, L76]true [2025-04-26 16:54:32,036 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 403#[L65, thread4EXIT, thread3EXIT, L32, L21, L92, thread6EXIT]true [2025-04-26 16:54:32,037 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 389#[L54, L21, L65, thread3EXIT, L91, L32]true [2025-04-26 16:54:32,037 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 405#[L54, L21, thread5EXIT, thread3EXIT, L91, L32]true [2025-04-26 16:54:32,038 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 409#[L54, thread5EXIT, thread3EXIT, L32, L21, L92, L76]true [2025-04-26 16:54:32,038 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 411#[L54, thread5EXIT, thread3EXIT, L32, L21, L92, thread6EXIT]true [2025-04-26 16:54:32,038 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 407#[L54, L65, thread3EXIT, L32, L21, L92, L76]true [2025-04-26 16:54:32,039 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 413#[L54, L65, thread3EXIT, L32, L21, L92, thread6EXIT]true [2025-04-26 16:54:32,039 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 383#[L90, L54, L43, L21, L32]true [2025-04-26 16:54:32,039 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 417#[L90, L43, L21, thread4EXIT, L32]true [2025-04-26 16:54:32,040 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 419#[thread4EXIT, L21, L65, L91, L43, L32]true [2025-04-26 16:54:32,040 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 421#[thread4EXIT, L21, thread5EXIT, L91, L43, L32]true [2025-04-26 16:54:32,041 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 425#[L43, thread5EXIT, thread4EXIT, L32, L21, L92, L76]true [2025-04-26 16:54:32,041 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 427#[L43, thread5EXIT, thread4EXIT, L32, L21, L92, thread6EXIT]true [2025-04-26 16:54:32,041 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 423#[L43, L65, thread4EXIT, L32, L21, L92, L76]true [2025-04-26 16:54:32,042 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 429#[L43, L65, thread4EXIT, L32, L21, L92, thread6EXIT]true [2025-04-26 16:54:32,042 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 415#[L54, L21, L65, L91, L43, L32]true [2025-04-26 16:54:32,043 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 431#[L54, L21, thread5EXIT, L91, L43, L32]true [2025-04-26 16:54:32,043 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 435#[L43, L54, thread5EXIT, L32, L21, L92, L76]true [2025-04-26 16:54:32,044 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 437#[L43, L54, thread5EXIT, L32, L21, L92, thread6EXIT]true [2025-04-26 16:54:32,045 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 433#[L43, L54, L65, L32, L21, L92, L76]true [2025-04-26 16:54:32,045 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 439#[L43, L54, L65, L32, L21, L92, thread6EXIT]true [2025-04-26 16:54:32,045 WARN L140 AmpleReduction]: Number of pruned transitions: 0 [2025-04-26 16:54:32,045 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 171 [2025-04-26 16:54:32,046 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 171 [2025-04-26 16:54:32,046 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:23 [2025-04-26 16:54:32,046 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:171 [2025-04-26 16:54:32,046 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:54:32,046 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:54:32,046 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:32,051 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 195 states, 193 states have (on average 5.341968911917099) internal successors, (in total 1031), 194 states have internal predecessors, (1031), 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:32,056 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:32,056 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:32,056 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:32,056 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:32,056 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:32,056 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:32,056 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:32,057 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:32,060 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 195 states, 193 states have (on average 5.341968911917099) internal successors, (in total 1031), 194 states have internal predecessors, (1031), 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:32,090 INFO L131 ngComponentsAnalysis]: Automaton has 177 accepting balls. 177 [2025-04-26 16:54:32,090 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:32,090 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:32,095 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:32,095 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:32,095 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:32,096 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 195 states, 193 states have (on average 5.341968911917099) internal successors, (in total 1031), 194 states have internal predecessors, (1031), 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:32,109 INFO L131 ngComponentsAnalysis]: Automaton has 177 accepting balls. 177 [2025-04-26 16:54:32,109 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:32,109 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:32,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:32,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:32,114 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L87: Formula: (and (= v_x4_1 v_x3_1) (= v_x6_1 v_x5_1) (= v_x2_4 v_x1_4)) InVars {x1=v_x1_4, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_4, x3=v_x3_1} OutVars{x1=v_x1_4, x6=v_x6_1, x4=v_x4_1, x5=v_x5_1, x2=v_x2_4, x3=v_x3_1} AuxVars[] AssignedVars[]" "[111] L87-->L21: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" [2025-04-26 16:54:32,114 INFO L754 eck$LassoCheckResult]: Loop: "[89] L21-->L21: Formula: (and (< v_x1_7 v_n_8) (= v_x1_6 (* v_x1_7 2))) InVars {x1=v_x1_7, n=v_n_8} OutVars{x1=v_x1_6, n=v_n_8} AuxVars[] AssignedVars[x1]" [2025-04-26 16:54:32,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:32,119 INFO L85 PathProgramCache]: Analyzing trace with hash 3738, now seen corresponding path program 1 times [2025-04-26 16:54:32,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:32,125 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476781661] [2025-04-26 16:54:32,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:32,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:32,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:32,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:32,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:32,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:32,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:32,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:32,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:32,204 INFO L85 PathProgramCache]: Analyzing trace with hash 120, now seen corresponding path program 1 times [2025-04-26 16:54:32,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:32,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409911652] [2025-04-26 16:54:32,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:32,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:32,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:32,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:32,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:32,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:32,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:32,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:32,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:32,222 INFO L85 PathProgramCache]: Analyzing trace with hash 115967, now seen corresponding path program 1 times [2025-04-26 16:54:32,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:32,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376630793] [2025-04-26 16:54:32,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:32,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:32,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:32,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:32,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:32,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:32,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:32,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:32,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:32,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:32,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,354 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:32,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:32,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:32,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:32,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:54:32,401 INFO L201 PluginConnector]: Adding new model exp3x3-opt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:32 BoogieIcfgContainer [2025-04-26 16:54:32,401 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:32,403 INFO L158 Benchmark]: Toolchain (without parser) took 1051.53ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 85.0MB in the beginning and 341.1MB in the end (delta: -256.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:32,403 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.72ms. Allocated memory is still 155.2MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:32,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.86ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 83.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:32,403 INFO L158 Benchmark]: Boogie Preprocessor took 31.51ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 81.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:32,404 INFO L158 Benchmark]: RCFGBuilder took 195.11ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 71.2MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:54:32,404 INFO L158 Benchmark]: BuchiAutomizer took 779.30ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 71.0MB in the beginning and 341.1MB in the end (delta: -270.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:32,405 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.72ms. Allocated memory is still 155.2MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.86ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 83.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 31.51ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 81.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 195.11ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 71.2MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 779.30ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 71.0MB in the beginning and 341.1MB in the end (delta: -270.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.6s and 1 iterations. TraceHistogramMax:1. Analysis of lassos took 0.2s. 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: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 330, Number of transitions in reduction automaton: 1031, Number of states in reduction automaton: 195, 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 - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L86] 0 assume x1 == x2 && x3 == x4 && x5 == x6; VAL [x1=0, x2=0, x3=2, x4=2, x5=3, x6=3] [L87] FORK 0 fork 1 thread1(); VAL [x1=0, x2=0, x3=2, x4=2, x5=3, x6=3] Loop: [L22] assume x1 < n; [L23] x1 := x1 + x1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L86] 0 assume x1 == x2 && x3 == x4 && x5 == x6; VAL [x1=0, x2=0, x3=2, x4=2, x5=3, x6=3] [L87] FORK 0 fork 1 thread1(); VAL [x1=0, x2=0, x3=2, x4=2, x5=3, x6=3] Loop: [L22] assume x1 < n; [L23] x1 := x1 + x1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:54:32,427 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...