./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:42:11,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:42:11,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:42:11,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:42:11,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:42:11,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:42:11,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:42:11,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:42:11,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:42:11,924 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:42:11,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:42:11,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:42:11,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:42:11,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:42:11,925 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:42:11,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:42:11,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:42:11,925 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:42:11,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:42:11,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:42:11,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:42:11,925 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:42:11,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:42:11,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:42:11,925 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:42:11,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:42:11,926 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:42:11,926 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:42:11,926 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:42:11,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:42:11,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:42:11,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:42:11,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:42:11,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:42:11,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:42:11,926 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:42:11,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:42:11,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:42:11,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:42:11,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:42:11,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:42:11,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:42:11,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:42:11,927 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 [2025-02-06 04:42:12,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:42:12,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:42:12,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:42:12,148 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:42:12,148 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:42:12,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2025-02-06 04:42:13,260 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75c8899fc/2b7b50be747b4318991f5bb1b4108ad7/FLAG8baee575a [2025-02-06 04:42:13,468 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:42:13,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2025-02-06 04:42:13,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75c8899fc/2b7b50be747b4318991f5bb1b4108ad7/FLAG8baee575a [2025-02-06 04:42:13,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75c8899fc/2b7b50be747b4318991f5bb1b4108ad7 [2025-02-06 04:42:13,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:42:13,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:42:13,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:42:13,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:42:13,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:42:13,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:42:13" (1/1) ... [2025-02-06 04:42:13,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b495e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:42:13, skipping insertion in model container [2025-02-06 04:42:13,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:42:13" (1/1) ... [2025-02-06 04:42:13,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:42:13,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2025-02-06 04:42:13,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:42:13,614 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:42:13,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2025-02-06 04:42:13,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:42:13,634 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:42:13,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:42:13 WrapperNode [2025-02-06 04:42:13,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:42:13,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:42:13,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:42:13,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:42:13,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:42:13" (1/1) ... [2025-02-06 04:42:13,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:42:13" (1/1) ... [2025-02-06 04:42:13,650 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2025-02-06 04:42:13,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:42:13,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:42:13,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:42:13,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:42:13,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:42:13" (1/1) ... [2025-02-06 04:42:13,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:42:13" (1/1) ... [2025-02-06 04:42:13,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:42:13" (1/1) ... [2025-02-06 04:42:13,663 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 04:42:13,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:42:13" (1/1) ... [2025-02-06 04:42:13,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:42:13" (1/1) ... [2025-02-06 04:42:13,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:42:13" (1/1) ... [2025-02-06 04:42:13,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:42:13" (1/1) ... [2025-02-06 04:42:13,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:42:13" (1/1) ... [2025-02-06 04:42:13,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:42:13" (1/1) ... [2025-02-06 04:42:13,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:42:13,669 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:42:13,669 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:42:13,669 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:42:13,670 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:42:13" (1/1) ... [2025-02-06 04:42:13,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:42:13,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:42:13,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:42:13,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:42:13,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:42:13,708 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:42:13,708 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:42:13,708 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:42:13,708 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:42:13,708 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:42:13,708 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:42:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:42:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:42:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:42:13,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:42:13,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:42:13,709 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:42:13,771 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:42:13,773 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:42:13,925 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:42:13,925 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:42:14,010 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:42:14,011 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:42:14,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:42:14 BoogieIcfgContainer [2025-02-06 04:42:14,011 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:42:14,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:42:14,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:42:14,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:42:14,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:42:13" (1/3) ... [2025-02-06 04:42:14,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b226ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:42:14, skipping insertion in model container [2025-02-06 04:42:14,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:42:13" (2/3) ... [2025-02-06 04:42:14,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b226ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:42:14, skipping insertion in model container [2025-02-06 04:42:14,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:42:14" (3/3) ... [2025-02-06 04:42:14,018 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2025-02-06 04:42:14,027 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:42:14,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-mult-equiv.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-06 04:42:14,029 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:42:14,070 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:42:14,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 85 flow [2025-02-06 04:42:14,122 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2025-02-06 04:42:14,124 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:42:14,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-02-06 04:42:14,126 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 85 flow [2025-02-06 04:42:14,130 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 74 flow [2025-02-06 04:42:14,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:42:14,146 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@a3f5d55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:42:14,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:42:14,155 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:42:14,155 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2025-02-06 04:42:14,155 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:42:14,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:14,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:14,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:14,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:14,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1646862770, now seen corresponding path program 1 times [2025-02-06 04:42:14,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:14,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013262103] [2025-02-06 04:42:14,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:42:14,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:14,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:42:14,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:42:14,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:42:14,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:14,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:14,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013262103] [2025-02-06 04:42:14,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013262103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:14,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:14,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:42:14,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887927106] [2025-02-06 04:42:14,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:14,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:42:14,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:14,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:42:14,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:42:14,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2025-02-06 04:42:14,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:14,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:14,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2025-02-06 04:42:14,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:14,732 INFO L124 PetriNetUnfolderBase]: 510/800 cut-off events. [2025-02-06 04:42:14,732 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-02-06 04:42:14,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 800 events. 510/800 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3395 event pairs, 87 based on Foata normal form. 1/785 useless extension candidates. Maximal degree in co-relation 1433. Up to 573 conditions per place. [2025-02-06 04:42:14,744 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 32 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2025-02-06 04:42:14,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 195 flow [2025-02-06 04:42:14,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:42:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:42:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-02-06 04:42:14,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-02-06 04:42:14,757 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 74 flow. Second operand 3 states and 68 transitions. [2025-02-06 04:42:14,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 195 flow [2025-02-06 04:42:14,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 44 transitions, 173 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 04:42:14,766 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 88 flow [2025-02-06 04:42:14,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2025-02-06 04:42:14,771 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-02-06 04:42:14,771 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 88 flow [2025-02-06 04:42:14,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:14,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:14,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:14,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:42:14,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:14,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:14,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1611471900, now seen corresponding path program 1 times [2025-02-06 04:42:14,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:14,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258078453] [2025-02-06 04:42:14,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:42:14,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:14,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:42:14,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:42:14,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:42:14,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:15,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:15,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:15,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258078453] [2025-02-06 04:42:15,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258078453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:15,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:15,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:42:15,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230309373] [2025-02-06 04:42:15,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:15,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:42:15,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:15,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:42:15,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:42:15,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-06 04:42:15,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:15,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:15,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-06 04:42:15,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:15,359 INFO L124 PetriNetUnfolderBase]: 898/1380 cut-off events. [2025-02-06 04:42:15,360 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2025-02-06 04:42:15,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3109 conditions, 1380 events. 898/1380 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6396 event pairs, 27 based on Foata normal form. 0/1280 useless extension candidates. Maximal degree in co-relation 742. Up to 562 conditions per place. [2025-02-06 04:42:15,370 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 86 selfloop transitions, 19 changer transitions 0/111 dead transitions. [2025-02-06 04:42:15,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 111 transitions, 512 flow [2025-02-06 04:42:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:42:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:42:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2025-02-06 04:42:15,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68359375 [2025-02-06 04:42:15,374 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 88 flow. Second operand 8 states and 175 transitions. [2025-02-06 04:42:15,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 111 transitions, 512 flow [2025-02-06 04:42:15,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 111 transitions, 502 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:42:15,376 INFO L231 Difference]: Finished difference. Result has 44 places, 49 transitions, 228 flow [2025-02-06 04:42:15,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=228, PETRI_PLACES=44, PETRI_TRANSITIONS=49} [2025-02-06 04:42:15,377 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2025-02-06 04:42:15,377 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 49 transitions, 228 flow [2025-02-06 04:42:15,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:15,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:15,377 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:15,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:42:15,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:15,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:15,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1531703500, now seen corresponding path program 2 times [2025-02-06 04:42:15,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:15,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057025675] [2025-02-06 04:42:15,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:42:15,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:15,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:42:15,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:42:15,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:42:15,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:15,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:15,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057025675] [2025-02-06 04:42:15,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057025675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:15,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:15,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:42:15,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569450160] [2025-02-06 04:42:15,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:15,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:42:15,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:15,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:42:15,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:42:15,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-06 04:42:15,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 49 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:15,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:15,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-06 04:42:15,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:15,728 INFO L124 PetriNetUnfolderBase]: 1068/1616 cut-off events. [2025-02-06 04:42:15,729 INFO L125 PetriNetUnfolderBase]: For 1648/1651 co-relation queries the response was YES. [2025-02-06 04:42:15,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4790 conditions, 1616 events. 1068/1616 cut-off events. For 1648/1651 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7537 event pairs, 144 based on Foata normal form. 36/1646 useless extension candidates. Maximal degree in co-relation 4304. Up to 1134 conditions per place. [2025-02-06 04:42:15,739 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 64 selfloop transitions, 20 changer transitions 2/92 dead transitions. [2025-02-06 04:42:15,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 92 transitions, 580 flow [2025-02-06 04:42:15,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:42:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:42:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2025-02-06 04:42:15,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-02-06 04:42:15,743 INFO L175 Difference]: Start difference. First operand has 44 places, 49 transitions, 228 flow. Second operand 6 states and 120 transitions. [2025-02-06 04:42:15,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 92 transitions, 580 flow [2025-02-06 04:42:15,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 92 transitions, 580 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:42:15,748 INFO L231 Difference]: Finished difference. Result has 53 places, 60 transitions, 382 flow [2025-02-06 04:42:15,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=53, PETRI_TRANSITIONS=60} [2025-02-06 04:42:15,750 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2025-02-06 04:42:15,750 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 60 transitions, 382 flow [2025-02-06 04:42:15,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:15,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:15,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:15,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:42:15,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:15,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:15,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1102887362, now seen corresponding path program 3 times [2025-02-06 04:42:15,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:15,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421487005] [2025-02-06 04:42:15,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:42:15,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:15,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-02-06 04:42:15,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:42:15,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:42:15,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:15,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:15,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421487005] [2025-02-06 04:42:15,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421487005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:15,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:15,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:42:15,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623048734] [2025-02-06 04:42:15,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:15,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:42:15,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:15,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:42:15,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:42:15,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-02-06 04:42:15,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 60 transitions, 382 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:15,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:15,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-02-06 04:42:15,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:16,231 INFO L124 PetriNetUnfolderBase]: 1825/2684 cut-off events. [2025-02-06 04:42:16,232 INFO L125 PetriNetUnfolderBase]: For 3614/3614 co-relation queries the response was YES. [2025-02-06 04:42:16,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8483 conditions, 2684 events. 1825/2684 cut-off events. For 3614/3614 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 13231 event pairs, 167 based on Foata normal form. 42/2724 useless extension candidates. Maximal degree in co-relation 6614. Up to 1116 conditions per place. [2025-02-06 04:42:16,249 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 88 selfloop transitions, 38 changer transitions 2/133 dead transitions. [2025-02-06 04:42:16,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 133 transitions, 923 flow [2025-02-06 04:42:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:42:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:42:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2025-02-06 04:42:16,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66015625 [2025-02-06 04:42:16,252 INFO L175 Difference]: Start difference. First operand has 53 places, 60 transitions, 382 flow. Second operand 8 states and 169 transitions. [2025-02-06 04:42:16,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 133 transitions, 923 flow [2025-02-06 04:42:16,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 133 transitions, 879 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 04:42:16,267 INFO L231 Difference]: Finished difference. Result has 63 places, 74 transitions, 612 flow [2025-02-06 04:42:16,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=612, PETRI_PLACES=63, PETRI_TRANSITIONS=74} [2025-02-06 04:42:16,269 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-02-06 04:42:16,269 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 74 transitions, 612 flow [2025-02-06 04:42:16,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:16,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:16,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:16,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:42:16,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:16,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:16,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1002627942, now seen corresponding path program 4 times [2025-02-06 04:42:16,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:16,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19289827] [2025-02-06 04:42:16,271 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:42:16,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:16,277 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-02-06 04:42:16,287 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:42:16,287 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:42:16,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:16,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:16,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19289827] [2025-02-06 04:42:16,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19289827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:16,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:42:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998526258] [2025-02-06 04:42:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:16,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:42:16,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:16,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:42:16,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:42:16,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2025-02-06 04:42:16,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 74 transitions, 612 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:16,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:16,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2025-02-06 04:42:16,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:16,919 INFO L124 PetriNetUnfolderBase]: 1770/2867 cut-off events. [2025-02-06 04:42:16,919 INFO L125 PetriNetUnfolderBase]: For 7040/7159 co-relation queries the response was YES. [2025-02-06 04:42:16,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10010 conditions, 2867 events. 1770/2867 cut-off events. For 7040/7159 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 16544 event pairs, 144 based on Foata normal form. 43/2875 useless extension candidates. Maximal degree in co-relation 7411. Up to 1839 conditions per place. [2025-02-06 04:42:16,936 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 102 selfloop transitions, 46 changer transitions 2/161 dead transitions. [2025-02-06 04:42:16,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 161 transitions, 1279 flow [2025-02-06 04:42:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:42:16,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:42:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 230 transitions. [2025-02-06 04:42:16,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2025-02-06 04:42:16,941 INFO L175 Difference]: Start difference. First operand has 63 places, 74 transitions, 612 flow. Second operand 12 states and 230 transitions. [2025-02-06 04:42:16,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 161 transitions, 1279 flow [2025-02-06 04:42:16,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 161 transitions, 1258 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-02-06 04:42:16,956 INFO L231 Difference]: Finished difference. Result has 80 places, 105 transitions, 947 flow [2025-02-06 04:42:16,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=947, PETRI_PLACES=80, PETRI_TRANSITIONS=105} [2025-02-06 04:42:16,958 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 45 predicate places. [2025-02-06 04:42:16,958 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 105 transitions, 947 flow [2025-02-06 04:42:16,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:16,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:16,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:16,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:42:16,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:16,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:16,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1237664782, now seen corresponding path program 1 times [2025-02-06 04:42:16,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:16,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845191029] [2025-02-06 04:42:16,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:42:16,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:16,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:42:16,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:16,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:42:16,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:17,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:17,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845191029] [2025-02-06 04:42:17,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845191029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:17,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:17,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:42:17,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732200722] [2025-02-06 04:42:17,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:17,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:42:17,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:17,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:42:17,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:42:17,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-06 04:42:17,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 105 transitions, 947 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:17,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:17,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-06 04:42:17,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:17,652 INFO L124 PetriNetUnfolderBase]: 3451/5458 cut-off events. [2025-02-06 04:42:17,652 INFO L125 PetriNetUnfolderBase]: For 27891/28344 co-relation queries the response was YES. [2025-02-06 04:42:17,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23028 conditions, 5458 events. 3451/5458 cut-off events. For 27891/28344 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 34506 event pairs, 756 based on Foata normal form. 16/5052 useless extension candidates. Maximal degree in co-relation 20733. Up to 2639 conditions per place. [2025-02-06 04:42:17,736 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 131 selfloop transitions, 98 changer transitions 1/240 dead transitions. [2025-02-06 04:42:17,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 240 transitions, 2578 flow [2025-02-06 04:42:17,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:42:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:42:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2025-02-06 04:42:17,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-02-06 04:42:17,738 INFO L175 Difference]: Start difference. First operand has 80 places, 105 transitions, 947 flow. Second operand 6 states and 126 transitions. [2025-02-06 04:42:17,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 240 transitions, 2578 flow [2025-02-06 04:42:17,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 240 transitions, 2361 flow, removed 88 selfloop flow, removed 1 redundant places. [2025-02-06 04:42:17,802 INFO L231 Difference]: Finished difference. Result has 87 places, 164 transitions, 1694 flow [2025-02-06 04:42:17,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1694, PETRI_PLACES=87, PETRI_TRANSITIONS=164} [2025-02-06 04:42:17,804 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 52 predicate places. [2025-02-06 04:42:17,804 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 164 transitions, 1694 flow [2025-02-06 04:42:17,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:17,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:17,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:17,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:42:17,805 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:17,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:17,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1753791142, now seen corresponding path program 2 times [2025-02-06 04:42:17,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:17,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501315160] [2025-02-06 04:42:17,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:42:17,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:17,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:42:17,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:17,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:42:17,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:17,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501315160] [2025-02-06 04:42:17,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501315160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:17,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:17,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:42:17,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709642465] [2025-02-06 04:42:17,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:17,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:42:17,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:17,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:42:17,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:42:17,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-06 04:42:17,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 164 transitions, 1694 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:17,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:17,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-06 04:42:17,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:18,590 INFO L124 PetriNetUnfolderBase]: 4305/6838 cut-off events. [2025-02-06 04:42:18,590 INFO L125 PetriNetUnfolderBase]: For 43027/43463 co-relation queries the response was YES. [2025-02-06 04:42:18,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32971 conditions, 6838 events. 4305/6838 cut-off events. For 43027/43463 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 44937 event pairs, 642 based on Foata normal form. 36/6822 useless extension candidates. Maximal degree in co-relation 30044. Up to 3011 conditions per place. [2025-02-06 04:42:18,634 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 203 selfloop transitions, 144 changer transitions 1/358 dead transitions. [2025-02-06 04:42:18,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 358 transitions, 4434 flow [2025-02-06 04:42:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:42:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:42:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-02-06 04:42:18,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63125 [2025-02-06 04:42:18,635 INFO L175 Difference]: Start difference. First operand has 87 places, 164 transitions, 1694 flow. Second operand 5 states and 101 transitions. [2025-02-06 04:42:18,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 358 transitions, 4434 flow [2025-02-06 04:42:18,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 358 transitions, 4426 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-02-06 04:42:18,728 INFO L231 Difference]: Finished difference. Result has 94 places, 252 transitions, 3256 flow [2025-02-06 04:42:18,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1690, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3256, PETRI_PLACES=94, PETRI_TRANSITIONS=252} [2025-02-06 04:42:18,729 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 59 predicate places. [2025-02-06 04:42:18,729 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 252 transitions, 3256 flow [2025-02-06 04:42:18,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:18,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:18,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:18,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:42:18,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:18,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:18,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1332687080, now seen corresponding path program 1 times [2025-02-06 04:42:18,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:18,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905629778] [2025-02-06 04:42:18,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:42:18,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:18,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:42:18,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:18,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:42:18,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:18,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:18,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905629778] [2025-02-06 04:42:18,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905629778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:18,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:18,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:42:18,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600986961] [2025-02-06 04:42:18,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:18,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:42:18,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:18,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:42:18,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:42:18,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-02-06 04:42:18,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 252 transitions, 3256 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:18,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:18,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-02-06 04:42:18,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:19,511 INFO L124 PetriNetUnfolderBase]: 6065/9213 cut-off events. [2025-02-06 04:42:19,511 INFO L125 PetriNetUnfolderBase]: For 67302/67572 co-relation queries the response was YES. [2025-02-06 04:42:19,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49668 conditions, 9213 events. 6065/9213 cut-off events. For 67302/67572 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 56827 event pairs, 711 based on Foata normal form. 290/9494 useless extension candidates. Maximal degree in co-relation 44134. Up to 5228 conditions per place. [2025-02-06 04:42:19,569 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 288 selfloop transitions, 77 changer transitions 2/373 dead transitions. [2025-02-06 04:42:19,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 373 transitions, 5074 flow [2025-02-06 04:42:19,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:42:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:42:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2025-02-06 04:42:19,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6294642857142857 [2025-02-06 04:42:19,571 INFO L175 Difference]: Start difference. First operand has 94 places, 252 transitions, 3256 flow. Second operand 7 states and 141 transitions. [2025-02-06 04:42:19,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 373 transitions, 5074 flow [2025-02-06 04:42:19,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 373 transitions, 5074 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:42:19,714 INFO L231 Difference]: Finished difference. Result has 104 places, 255 transitions, 3545 flow [2025-02-06 04:42:19,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3256, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3545, PETRI_PLACES=104, PETRI_TRANSITIONS=255} [2025-02-06 04:42:19,715 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2025-02-06 04:42:19,715 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 255 transitions, 3545 flow [2025-02-06 04:42:19,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:19,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:19,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:19,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:42:19,716 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:19,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:19,716 INFO L85 PathProgramCache]: Analyzing trace with hash 557159982, now seen corresponding path program 3 times [2025-02-06 04:42:19,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:19,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971974585] [2025-02-06 04:42:19,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:42:19,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:19,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-02-06 04:42:19,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:19,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:42:19,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:19,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971974585] [2025-02-06 04:42:19,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971974585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:19,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:19,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:42:19,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314060338] [2025-02-06 04:42:19,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:19,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:42:19,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:19,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:42:19,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:42:19,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-06 04:42:19,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 255 transitions, 3545 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:19,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:19,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-06 04:42:19,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:20,664 INFO L124 PetriNetUnfolderBase]: 4825/7932 cut-off events. [2025-02-06 04:42:20,665 INFO L125 PetriNetUnfolderBase]: For 71024/71578 co-relation queries the response was YES. [2025-02-06 04:42:20,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45483 conditions, 7932 events. 4825/7932 cut-off events. For 71024/71578 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 55565 event pairs, 643 based on Foata normal form. 100/7945 useless extension candidates. Maximal degree in co-relation 40168. Up to 2888 conditions per place. [2025-02-06 04:42:20,725 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 203 selfloop transitions, 208 changer transitions 2/426 dead transitions. [2025-02-06 04:42:20,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 426 transitions, 6395 flow [2025-02-06 04:42:20,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:42:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:42:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-02-06 04:42:20,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6614583333333334 [2025-02-06 04:42:20,726 INFO L175 Difference]: Start difference. First operand has 104 places, 255 transitions, 3545 flow. Second operand 6 states and 127 transitions. [2025-02-06 04:42:20,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 426 transitions, 6395 flow [2025-02-06 04:42:20,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 426 transitions, 6311 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-02-06 04:42:20,879 INFO L231 Difference]: Finished difference. Result has 112 places, 322 transitions, 5299 flow [2025-02-06 04:42:20,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3483, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5299, PETRI_PLACES=112, PETRI_TRANSITIONS=322} [2025-02-06 04:42:20,880 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 77 predicate places. [2025-02-06 04:42:20,880 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 322 transitions, 5299 flow [2025-02-06 04:42:20,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:20,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:20,880 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:20,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:42:20,881 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:20,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1299908642, now seen corresponding path program 4 times [2025-02-06 04:42:20,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:20,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506201530] [2025-02-06 04:42:20,881 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:42:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:20,887 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-02-06 04:42:20,895 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:20,895 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:42:20,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:21,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:21,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506201530] [2025-02-06 04:42:21,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506201530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:21,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:21,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:42:21,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338445796] [2025-02-06 04:42:21,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:21,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:42:21,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:21,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:42:21,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:42:21,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-06 04:42:21,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 322 transitions, 5299 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:21,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:21,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-06 04:42:21,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:22,045 INFO L124 PetriNetUnfolderBase]: 4951/8300 cut-off events. [2025-02-06 04:42:22,045 INFO L125 PetriNetUnfolderBase]: For 93544/94069 co-relation queries the response was YES. [2025-02-06 04:42:22,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53050 conditions, 8300 events. 4951/8300 cut-off events. For 93544/94069 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 59347 event pairs, 1089 based on Foata normal form. 82/8315 useless extension candidates. Maximal degree in co-relation 46753. Up to 3680 conditions per place. [2025-02-06 04:42:22,098 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 119 selfloop transitions, 237 changer transitions 1/370 dead transitions. [2025-02-06 04:42:22,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 370 transitions, 6377 flow [2025-02-06 04:42:22,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:42:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:42:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-02-06 04:42:22,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-02-06 04:42:22,100 INFO L175 Difference]: Start difference. First operand has 112 places, 322 transitions, 5299 flow. Second operand 5 states and 108 transitions. [2025-02-06 04:42:22,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 370 transitions, 6377 flow [2025-02-06 04:42:22,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 370 transitions, 6282 flow, removed 37 selfloop flow, removed 1 redundant places. [2025-02-06 04:42:22,302 INFO L231 Difference]: Finished difference. Result has 118 places, 326 transitions, 5998 flow [2025-02-06 04:42:22,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5196, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5998, PETRI_PLACES=118, PETRI_TRANSITIONS=326} [2025-02-06 04:42:22,302 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 83 predicate places. [2025-02-06 04:42:22,302 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 326 transitions, 5998 flow [2025-02-06 04:42:22,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:22,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:22,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:22,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:42:22,303 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:22,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:22,303 INFO L85 PathProgramCache]: Analyzing trace with hash 751599996, now seen corresponding path program 2 times [2025-02-06 04:42:22,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:22,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350155086] [2025-02-06 04:42:22,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:42:22,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:22,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:42:22,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:22,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:42:22,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:22,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:22,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350155086] [2025-02-06 04:42:22,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350155086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:22,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:22,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:42:22,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493924440] [2025-02-06 04:42:22,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:22,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:42:22,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:22,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:42:22,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:42:22,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-06 04:42:22,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 326 transitions, 5998 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:22,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:22,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-06 04:42:22,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:23,364 INFO L124 PetriNetUnfolderBase]: 5481/9085 cut-off events. [2025-02-06 04:42:23,364 INFO L125 PetriNetUnfolderBase]: For 116375/116896 co-relation queries the response was YES. [2025-02-06 04:42:23,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60868 conditions, 9085 events. 5481/9085 cut-off events. For 116375/116896 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 64059 event pairs, 787 based on Foata normal form. 80/9103 useless extension candidates. Maximal degree in co-relation 53219. Up to 7964 conditions per place. [2025-02-06 04:42:23,415 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 274 selfloop transitions, 78 changer transitions 5/369 dead transitions. [2025-02-06 04:42:23,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 369 transitions, 7167 flow [2025-02-06 04:42:23,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:42:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:42:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-02-06 04:42:23,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-02-06 04:42:23,416 INFO L175 Difference]: Start difference. First operand has 118 places, 326 transitions, 5998 flow. Second operand 5 states and 105 transitions. [2025-02-06 04:42:23,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 369 transitions, 7167 flow [2025-02-06 04:42:23,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 369 transitions, 6923 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-02-06 04:42:23,643 INFO L231 Difference]: Finished difference. Result has 123 places, 331 transitions, 6143 flow [2025-02-06 04:42:23,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5767, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6143, PETRI_PLACES=123, PETRI_TRANSITIONS=331} [2025-02-06 04:42:23,644 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 88 predicate places. [2025-02-06 04:42:23,644 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 331 transitions, 6143 flow [2025-02-06 04:42:23,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:23,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:23,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:23,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:42:23,645 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:23,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:23,645 INFO L85 PathProgramCache]: Analyzing trace with hash 674502856, now seen corresponding path program 5 times [2025-02-06 04:42:23,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:23,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274172709] [2025-02-06 04:42:23,645 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:42:23,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:23,649 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:42:23,652 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:23,652 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:42:23,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:23,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274172709] [2025-02-06 04:42:23,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274172709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:23,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:23,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:42:23,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426730096] [2025-02-06 04:42:23,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:23,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:42:23,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:23,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:42:23,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:42:23,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-02-06 04:42:23,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 331 transitions, 6143 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:23,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:23,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-02-06 04:42:23,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:25,005 INFO L124 PetriNetUnfolderBase]: 6115/9771 cut-off events. [2025-02-06 04:42:25,006 INFO L125 PetriNetUnfolderBase]: For 121014/121515 co-relation queries the response was YES. [2025-02-06 04:42:25,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64315 conditions, 9771 events. 6115/9771 cut-off events. For 121014/121515 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 66365 event pairs, 1293 based on Foata normal form. 51/9775 useless extension candidates. Maximal degree in co-relation 57507. Up to 4897 conditions per place. [2025-02-06 04:42:25,089 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 156 selfloop transitions, 263 changer transitions 3/432 dead transitions. [2025-02-06 04:42:25,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 432 transitions, 8043 flow [2025-02-06 04:42:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:42:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:42:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2025-02-06 04:42:25,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-02-06 04:42:25,091 INFO L175 Difference]: Start difference. First operand has 123 places, 331 transitions, 6143 flow. Second operand 6 states and 126 transitions. [2025-02-06 04:42:25,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 432 transitions, 8043 flow [2025-02-06 04:42:25,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 432 transitions, 7941 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-02-06 04:42:25,411 INFO L231 Difference]: Finished difference. Result has 129 places, 352 transitions, 7094 flow [2025-02-06 04:42:25,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6011, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=240, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7094, PETRI_PLACES=129, PETRI_TRANSITIONS=352} [2025-02-06 04:42:25,412 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 94 predicate places. [2025-02-06 04:42:25,412 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 352 transitions, 7094 flow [2025-02-06 04:42:25,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:25,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:25,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:25,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:42:25,412 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:25,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:25,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1715653448, now seen corresponding path program 6 times [2025-02-06 04:42:25,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:25,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119411569] [2025-02-06 04:42:25,413 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:42:25,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:25,418 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:42:25,422 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:25,423 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:42:25,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:25,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:25,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:25,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119411569] [2025-02-06 04:42:25,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119411569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:25,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:25,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:42:25,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669114946] [2025-02-06 04:42:25,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:25,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:42:25,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:25,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:42:25,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:42:25,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-02-06 04:42:25,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 352 transitions, 7094 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:25,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:25,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-02-06 04:42:25,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:27,029 INFO L124 PetriNetUnfolderBase]: 7655/12052 cut-off events. [2025-02-06 04:42:27,030 INFO L125 PetriNetUnfolderBase]: For 177384/178049 co-relation queries the response was YES. [2025-02-06 04:42:27,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84479 conditions, 12052 events. 7655/12052 cut-off events. For 177384/178049 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 82371 event pairs, 1302 based on Foata normal form. 168/12182 useless extension candidates. Maximal degree in co-relation 74621. Up to 3449 conditions per place. [2025-02-06 04:42:27,120 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 185 selfloop transitions, 302 changer transitions 3/500 dead transitions. [2025-02-06 04:42:27,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 500 transitions, 10008 flow [2025-02-06 04:42:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:42:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:42:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2025-02-06 04:42:27,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6651785714285714 [2025-02-06 04:42:27,121 INFO L175 Difference]: Start difference. First operand has 129 places, 352 transitions, 7094 flow. Second operand 7 states and 149 transitions. [2025-02-06 04:42:27,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 500 transitions, 10008 flow [2025-02-06 04:42:27,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 500 transitions, 9712 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 04:42:27,506 INFO L231 Difference]: Finished difference. Result has 135 places, 391 transitions, 8489 flow [2025-02-06 04:42:27,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6838, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=262, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8489, PETRI_PLACES=135, PETRI_TRANSITIONS=391} [2025-02-06 04:42:27,506 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 100 predicate places. [2025-02-06 04:42:27,507 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 391 transitions, 8489 flow [2025-02-06 04:42:27,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:27,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:27,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:27,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:42:27,507 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:27,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1437801030, now seen corresponding path program 3 times [2025-02-06 04:42:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:27,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680823032] [2025-02-06 04:42:27,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:42:27,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:27,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-02-06 04:42:27,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:27,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 04:42:27,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:27,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:27,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:27,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680823032] [2025-02-06 04:42:27,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680823032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:27,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:27,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:42:27,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963820955] [2025-02-06 04:42:27,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:27,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:42:27,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:27,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:42:27,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:42:27,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-06 04:42:27,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 391 transitions, 8489 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:27,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:27,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-06 04:42:27,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:28,675 INFO L124 PetriNetUnfolderBase]: 6295/10061 cut-off events. [2025-02-06 04:42:28,675 INFO L125 PetriNetUnfolderBase]: For 170437/171137 co-relation queries the response was YES. [2025-02-06 04:42:28,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73589 conditions, 10061 events. 6295/10061 cut-off events. For 170437/171137 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 68834 event pairs, 809 based on Foata normal form. 127/10097 useless extension candidates. Maximal degree in co-relation 65257. Up to 8744 conditions per place. [2025-02-06 04:42:28,741 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 358 selfloop transitions, 58 changer transitions 13/442 dead transitions. [2025-02-06 04:42:28,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 442 transitions, 9753 flow [2025-02-06 04:42:28,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:42:28,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:42:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-02-06 04:42:28,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-02-06 04:42:28,743 INFO L175 Difference]: Start difference. First operand has 135 places, 391 transitions, 8489 flow. Second operand 5 states and 105 transitions. [2025-02-06 04:42:28,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 442 transitions, 9753 flow [2025-02-06 04:42:29,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 442 transitions, 9690 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:42:29,060 INFO L231 Difference]: Finished difference. Result has 139 places, 379 transitions, 8223 flow [2025-02-06 04:42:29,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=8090, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8223, PETRI_PLACES=139, PETRI_TRANSITIONS=379} [2025-02-06 04:42:29,060 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 104 predicate places. [2025-02-06 04:42:29,060 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 379 transitions, 8223 flow [2025-02-06 04:42:29,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:29,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:29,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:29,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:42:29,061 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:29,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:29,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2138864360, now seen corresponding path program 7 times [2025-02-06 04:42:29,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:29,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753313891] [2025-02-06 04:42:29,061 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 04:42:29,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:29,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:42:29,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:29,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:42:29,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:29,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:29,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753313891] [2025-02-06 04:42:29,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753313891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:29,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:29,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:42:29,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859609790] [2025-02-06 04:42:29,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:29,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:42:29,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:29,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:42:29,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:42:29,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-02-06 04:42:29,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 379 transitions, 8223 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:29,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:29,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-02-06 04:42:29,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:30,216 INFO L124 PetriNetUnfolderBase]: 6713/10341 cut-off events. [2025-02-06 04:42:30,216 INFO L125 PetriNetUnfolderBase]: For 171109/171858 co-relation queries the response was YES. [2025-02-06 04:42:30,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76377 conditions, 10341 events. 6713/10341 cut-off events. For 171109/171858 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 67706 event pairs, 1003 based on Foata normal form. 49/10328 useless extension candidates. Maximal degree in co-relation 68198. Up to 4622 conditions per place. [2025-02-06 04:42:30,300 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 223 selfloop transitions, 238 changer transitions 5/476 dead transitions. [2025-02-06 04:42:30,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 476 transitions, 10475 flow [2025-02-06 04:42:30,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:42:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:42:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-02-06 04:42:30,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-02-06 04:42:30,301 INFO L175 Difference]: Start difference. First operand has 139 places, 379 transitions, 8223 flow. Second operand 5 states and 105 transitions. [2025-02-06 04:42:30,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 476 transitions, 10475 flow [2025-02-06 04:42:30,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 476 transitions, 10218 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 04:42:30,836 INFO L231 Difference]: Finished difference. Result has 142 places, 397 transitions, 9282 flow [2025-02-06 04:42:30,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=7864, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9282, PETRI_PLACES=142, PETRI_TRANSITIONS=397} [2025-02-06 04:42:30,836 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 107 predicate places. [2025-02-06 04:42:30,836 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 397 transitions, 9282 flow [2025-02-06 04:42:30,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:30,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:30,836 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:30,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 04:42:30,836 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:30,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:30,837 INFO L85 PathProgramCache]: Analyzing trace with hash 582700240, now seen corresponding path program 8 times [2025-02-06 04:42:30,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:30,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501774955] [2025-02-06 04:42:30,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:42:30,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:30,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:42:30,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:30,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:42:30,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:30,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:30,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501774955] [2025-02-06 04:42:30,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501774955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:30,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:30,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:42:30,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210322939] [2025-02-06 04:42:30,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:30,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:42:30,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:30,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:42:30,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:42:30,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-02-06 04:42:30,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 397 transitions, 9282 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:30,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:30,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-02-06 04:42:30,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:32,518 INFO L124 PetriNetUnfolderBase]: 9181/13972 cut-off events. [2025-02-06 04:42:32,519 INFO L125 PetriNetUnfolderBase]: For 253995/255116 co-relation queries the response was YES. [2025-02-06 04:42:32,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108519 conditions, 13972 events. 9181/13972 cut-off events. For 253995/255116 co-relation queries the response was YES. Maximal size of possible extension queue 925. Compared 93810 event pairs, 1020 based on Foata normal form. 151/14067 useless extension candidates. Maximal degree in co-relation 95559. Up to 4657 conditions per place. [2025-02-06 04:42:32,646 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 252 selfloop transitions, 348 changer transitions 6/616 dead transitions. [2025-02-06 04:42:32,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 616 transitions, 14504 flow [2025-02-06 04:42:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:42:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:42:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2025-02-06 04:42:32,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6473214285714286 [2025-02-06 04:42:32,647 INFO L175 Difference]: Start difference. First operand has 142 places, 397 transitions, 9282 flow. Second operand 7 states and 145 transitions. [2025-02-06 04:42:32,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 616 transitions, 14504 flow [2025-02-06 04:42:33,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 616 transitions, 14228 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-02-06 04:42:33,354 INFO L231 Difference]: Finished difference. Result has 146 places, 505 transitions, 12775 flow [2025-02-06 04:42:33,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=9040, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12775, PETRI_PLACES=146, PETRI_TRANSITIONS=505} [2025-02-06 04:42:33,355 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 111 predicate places. [2025-02-06 04:42:33,355 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 505 transitions, 12775 flow [2025-02-06 04:42:33,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:33,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:33,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:33,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 04:42:33,355 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:33,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash 388377726, now seen corresponding path program 9 times [2025-02-06 04:42:33,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:33,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555813342] [2025-02-06 04:42:33,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:42:33,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:33,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:42:33,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:33,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:42:33,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:33,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:33,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555813342] [2025-02-06 04:42:33,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555813342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:33,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:33,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:42:33,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048237408] [2025-02-06 04:42:33,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:33,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:42:33,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:33,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:42:33,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:42:33,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-06 04:42:33,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 505 transitions, 12775 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:33,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:33,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-06 04:42:33,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:35,988 INFO L124 PetriNetUnfolderBase]: 9831/15267 cut-off events. [2025-02-06 04:42:35,988 INFO L125 PetriNetUnfolderBase]: For 335303/336473 co-relation queries the response was YES. [2025-02-06 04:42:36,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126340 conditions, 15267 events. 9831/15267 cut-off events. For 335303/336473 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 107497 event pairs, 1253 based on Foata normal form. 267/15369 useless extension candidates. Maximal degree in co-relation 112428. Up to 5690 conditions per place. [2025-02-06 04:42:36,107 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 367 selfloop transitions, 327 changer transitions 8/724 dead transitions. [2025-02-06 04:42:36,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 724 transitions, 18180 flow [2025-02-06 04:42:36,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:42:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:42:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2025-02-06 04:42:36,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-02-06 04:42:36,108 INFO L175 Difference]: Start difference. First operand has 146 places, 505 transitions, 12775 flow. Second operand 9 states and 176 transitions. [2025-02-06 04:42:36,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 724 transitions, 18180 flow [2025-02-06 04:42:36,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 724 transitions, 17483 flow, removed 50 selfloop flow, removed 5 redundant places. [2025-02-06 04:42:36,767 INFO L231 Difference]: Finished difference. Result has 152 places, 594 transitions, 15481 flow [2025-02-06 04:42:36,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12189, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15481, PETRI_PLACES=152, PETRI_TRANSITIONS=594} [2025-02-06 04:42:36,768 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 117 predicate places. [2025-02-06 04:42:36,768 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 594 transitions, 15481 flow [2025-02-06 04:42:36,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:36,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:36,768 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:36,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 04:42:36,768 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:36,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:36,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1502700566, now seen corresponding path program 10 times [2025-02-06 04:42:36,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:36,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671803381] [2025-02-06 04:42:36,769 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:42:36,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:36,772 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-02-06 04:42:36,775 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:36,775 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:42:36,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:36,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:36,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671803381] [2025-02-06 04:42:36,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671803381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:36,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:36,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:42:36,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104795390] [2025-02-06 04:42:36,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:36,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:42:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:36,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:42:36,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:42:36,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-06 04:42:36,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 594 transitions, 15481 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:36,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:36,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-06 04:42:36,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:38,959 INFO L124 PetriNetUnfolderBase]: 9974/15524 cut-off events. [2025-02-06 04:42:38,960 INFO L125 PetriNetUnfolderBase]: For 332675/333271 co-relation queries the response was YES. [2025-02-06 04:42:39,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133352 conditions, 15524 events. 9974/15524 cut-off events. For 332675/333271 co-relation queries the response was YES. Maximal size of possible extension queue 1058. Compared 108372 event pairs, 807 based on Foata normal form. 36/15418 useless extension candidates. Maximal degree in co-relation 121007. Up to 14484 conditions per place. [2025-02-06 04:42:39,106 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 553 selfloop transitions, 52 changer transitions 2/629 dead transitions. [2025-02-06 04:42:39,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 629 transitions, 17084 flow [2025-02-06 04:42:39,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:42:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:42:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-02-06 04:42:39,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6125 [2025-02-06 04:42:39,107 INFO L175 Difference]: Start difference. First operand has 152 places, 594 transitions, 15481 flow. Second operand 5 states and 98 transitions. [2025-02-06 04:42:39,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 629 transitions, 17084 flow [2025-02-06 04:42:40,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 629 transitions, 16434 flow, removed 68 selfloop flow, removed 8 redundant places. [2025-02-06 04:42:40,214 INFO L231 Difference]: Finished difference. Result has 149 places, 597 transitions, 15037 flow [2025-02-06 04:42:40,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=14848, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15037, PETRI_PLACES=149, PETRI_TRANSITIONS=597} [2025-02-06 04:42:40,214 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 114 predicate places. [2025-02-06 04:42:40,214 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 597 transitions, 15037 flow [2025-02-06 04:42:40,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:40,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:40,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:40,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 04:42:40,215 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:40,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1473158516, now seen corresponding path program 11 times [2025-02-06 04:42:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:40,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997620578] [2025-02-06 04:42:40,215 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:42:40,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:40,218 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-06 04:42:40,222 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:40,222 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:42:40,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:40,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:40,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997620578] [2025-02-06 04:42:40,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997620578] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:42:40,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848351461] [2025-02-06 04:42:40,399 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:42:40,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:42:40,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:42:40,401 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:42:40,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:42:40,439 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-06 04:42:40,451 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:40,451 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:42:40,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:40,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 04:42:40,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:42:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:40,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:42:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:40,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848351461] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:42:40,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:42:40,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 14 [2025-02-06 04:42:40,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312940464] [2025-02-06 04:42:40,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:42:40,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 04:42:40,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:40,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 04:42:40,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-06 04:42:40,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-02-06 04:42:40,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 597 transitions, 15037 flow. Second operand has 15 states, 15 states have (on average 11.8) internal successors, (177), 15 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:40,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:40,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-02-06 04:42:40,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:46,730 INFO L124 PetriNetUnfolderBase]: 23174/34711 cut-off events. [2025-02-06 04:42:46,731 INFO L125 PetriNetUnfolderBase]: For 694792/694870 co-relation queries the response was YES. [2025-02-06 04:42:46,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279367 conditions, 34711 events. 23174/34711 cut-off events. For 694792/694870 co-relation queries the response was YES. Maximal size of possible extension queue 2173. Compared 251582 event pairs, 1055 based on Foata normal form. 192/34669 useless extension candidates. Maximal degree in co-relation 258614. Up to 17022 conditions per place. [2025-02-06 04:42:47,120 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1175 selfloop transitions, 369 changer transitions 16/1576 dead transitions. [2025-02-06 04:42:47,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 1576 transitions, 38876 flow [2025-02-06 04:42:47,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 04:42:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 04:42:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 415 transitions. [2025-02-06 04:42:47,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6175595238095238 [2025-02-06 04:42:47,122 INFO L175 Difference]: Start difference. First operand has 149 places, 597 transitions, 15037 flow. Second operand 21 states and 415 transitions. [2025-02-06 04:42:47,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 1576 transitions, 38876 flow [2025-02-06 04:42:49,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 1576 transitions, 38714 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-02-06 04:42:49,590 INFO L231 Difference]: Finished difference. Result has 180 places, 943 transitions, 22904 flow [2025-02-06 04:42:49,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=14892, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=22904, PETRI_PLACES=180, PETRI_TRANSITIONS=943} [2025-02-06 04:42:49,591 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 145 predicate places. [2025-02-06 04:42:49,591 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 943 transitions, 22904 flow [2025-02-06 04:42:49,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.8) internal successors, (177), 15 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:49,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:42:49,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:42:49,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:42:49,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:42:49,792 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:42:49,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:42:49,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1504583618, now seen corresponding path program 12 times [2025-02-06 04:42:49,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:42:49,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038636953] [2025-02-06 04:42:49,792 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:42:49,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:42:49,796 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:42:49,799 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:42:49,800 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:42:49,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:42:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:42:49,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:42:49,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038636953] [2025-02-06 04:42:49,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038636953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:42:49,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:42:49,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:42:49,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017218934] [2025-02-06 04:42:49,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:42:49,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:42:49,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:42:49,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:42:49,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:42:49,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-06 04:42:49,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 943 transitions, 22904 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:42:49,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:42:49,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-06 04:42:49,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:42:50,942 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 18#L63true, Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 6#L44true, 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L99-1true, Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:50,942 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2025-02-06 04:42:50,942 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:50,942 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-02-06 04:42:50,942 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-02-06 04:42:51,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 18#L63true, Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 6#L44true, 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 29#L100true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:51,360 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-02-06 04:42:51,360 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-06 04:42:51,360 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-06 04:42:51,360 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-06 04:42:51,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 18#L63true, Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), 11#thread1EXITtrue, Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L99-1true, Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:51,432 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-02-06 04:42:51,432 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-06 04:42:51,432 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-06 04:42:51,432 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-06 04:42:51,436 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([205] L45-->L51: Formula: (let ((.cse0 (mod v_~N~0_66 4294967296))) (or (and (< 0 .cse0) (= (+ 1 v_~N~0_65) v_~N~0_66) (= v_~p~0_41 (+ v_~p~0_42 v_~M~0_40))) (and (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_41 v_~p~0_42) (<= .cse0 0) (= v_~N~0_66 v_~N~0_65)))) InVars {~p~0=v_~p~0_42, ~N~0=v_~N~0_66, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_41, ~N~0=v_~N~0_65, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][156], [139#(<= 1 (mod ~L~0 4294967296)), 30#L51true, Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 18#L63true, Black: 124#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 136#(= ~N~0 ~L~0), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, Black: 134#true, 46#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 146#true, 112#true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 48#(= ~N~0 ~L~0), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), 220#true, Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), 20#L80true, Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 212#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 232#true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 122#true, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L99-1true, Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:51,436 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-02-06 04:42:51,436 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-06 04:42:51,436 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-06 04:42:51,436 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-06 04:42:51,436 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 18#L63true, Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 4#L45true, 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 48#(= ~N~0 ~L~0), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L99-1true, Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:51,437 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-02-06 04:42:51,437 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-06 04:42:51,437 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-06 04:42:51,437 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-06 04:42:51,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 18#L63true, Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), 11#thread1EXITtrue, Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 48#(= ~N~0 ~L~0), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 88#true, Black: 64#(= ~N~0 ~L~0), 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L99-1true, Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:51,453 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-02-06 04:42:51,453 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-06 04:42:51,453 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-06 04:42:51,453 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-06 04:42:51,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 6#L44true, Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 19#thread2EXITtrue, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L99-1true, Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:51,454 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-02-06 04:42:51,454 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-06 04:42:51,454 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-06 04:42:51,454 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-06 04:42:51,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 124#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 239#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 15#L64true, 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 6#L44true, 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L99-1true, Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:51,454 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-02-06 04:42:51,454 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-06 04:42:51,454 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-06 04:42:51,454 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-06 04:42:52,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 18#L63true, Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), 11#thread1EXITtrue, Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 88#true, Black: 64#(= ~N~0 ~L~0), 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 29#L100true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,011 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-06 04:42:52,011 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,011 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,011 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([205] L45-->L51: Formula: (let ((.cse0 (mod v_~N~0_66 4294967296))) (or (and (< 0 .cse0) (= (+ 1 v_~N~0_65) v_~N~0_66) (= v_~p~0_41 (+ v_~p~0_42 v_~M~0_40))) (and (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_41 v_~p~0_42) (<= .cse0 0) (= v_~N~0_66 v_~N~0_65)))) InVars {~p~0=v_~p~0_42, ~N~0=v_~N~0_66, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_41, ~N~0=v_~N~0_65, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][156], [30#L51true, 139#(<= 1 (mod ~L~0 4294967296)), Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 18#L63true, Black: 124#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 136#(= ~N~0 ~L~0), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, Black: 134#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 146#true, 112#true, Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 48#(= ~N~0 ~L~0), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 220#true, Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), 20#L80true, Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 212#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 232#true, 29#L100true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 122#true, Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,016 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-06 04:42:52,016 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,016 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,016 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 18#L63true, Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 4#L45true, 31#L79true, Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 48#(= ~N~0 ~L~0), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 29#L100true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,019 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-06 04:42:52,019 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,019 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,019 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 18#L63true, Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 73#true, 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), 11#thread1EXITtrue, Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 88#true, Black: 64#(= ~N~0 ~L~0), 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 29#L100true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,034 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-06 04:42:52,034 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,034 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,034 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 6#L44true, Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 48#(= ~N~0 ~L~0), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 19#thread2EXITtrue, 29#L100true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,035 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-06 04:42:52,035 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,035 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,035 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 124#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 239#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 15#L64true, 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 6#L44true, 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 48#(= ~N~0 ~L~0), 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 64#(= ~N~0 ~L~0), 88#true, Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 29#L100true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,036 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-06 04:42:52,036 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,036 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,036 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 73#true, Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), 11#thread1EXITtrue, Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 64#(= ~N~0 ~L~0), 88#true, 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 19#thread2EXITtrue, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L99-1true, Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,149 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-06 04:42:52,149 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,149 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,149 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), 265#true, Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 455#true, 46#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), 11#thread1EXITtrue, Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 19#thread2EXITtrue, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L99-1true, Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,150 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-06 04:42:52,150 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,150 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,150 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,156 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([205] L45-->L51: Formula: (let ((.cse0 (mod v_~N~0_66 4294967296))) (or (and (< 0 .cse0) (= (+ 1 v_~N~0_65) v_~N~0_66) (= v_~p~0_41 (+ v_~p~0_42 v_~M~0_40))) (and (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_41 v_~p~0_42) (<= .cse0 0) (= v_~N~0_66 v_~N~0_65)))) InVars {~p~0=v_~p~0_42, ~N~0=v_~N~0_66, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_41, ~N~0=v_~N~0_65, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][214], [30#L51true, 139#(<= 1 (mod ~L~0 4294967296)), Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 124#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 136#(= ~N~0 ~L~0), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, Black: 134#true, 15#L64true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 146#true, 112#true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 220#true, Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), 20#L80true, Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 212#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 232#true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 122#true, Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L99-1true, Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,156 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-06 04:42:52,156 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,156 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,156 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,156 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 124#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 239#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 15#L64true, 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 4#L45true, 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L99-1true, Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,156 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-06 04:42:52,156 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,156 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,156 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 4#L45true, 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 19#thread2EXITtrue, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L99-1true, Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,157 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-06 04:42:52,157 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,157 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,157 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([205] L45-->L51: Formula: (let ((.cse0 (mod v_~N~0_66 4294967296))) (or (and (< 0 .cse0) (= (+ 1 v_~N~0_65) v_~N~0_66) (= v_~p~0_41 (+ v_~p~0_42 v_~M~0_40))) (and (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_41 v_~p~0_42) (<= .cse0 0) (= v_~N~0_66 v_~N~0_65)))) InVars {~p~0=v_~p~0_42, ~N~0=v_~N~0_66, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_41, ~N~0=v_~N~0_65, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][215], [139#(<= 1 (mod ~L~0 4294967296)), 30#L51true, Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 124#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 136#(= ~N~0 ~L~0), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, Black: 134#true, 46#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 116#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), 220#true, Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), 20#L80true, Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 212#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 19#thread2EXITtrue, 232#true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 122#true, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L99-1true, Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,157 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-06 04:42:52,157 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,157 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,157 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:52,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), 11#thread1EXITtrue, Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 48#(= ~N~0 ~L~0), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 88#true, Black: 64#(= ~N~0 ~L~0), 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 19#thread2EXITtrue, 29#L100true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,858 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,858 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:52,858 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-06 04:42:52,858 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:52,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), 11#thread1EXITtrue, Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 64#(= ~N~0 ~L~0), 88#true, 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 19#thread2EXITtrue, 29#L100true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,859 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,859 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:52,859 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-06 04:42:52,859 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:52,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 18#L63true, Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 24#L101true, Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 64#(= ~N~0 ~L~0), 88#true, 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,861 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,861 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:52,861 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-06 04:42:52,861 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:52,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([205] L45-->L51: Formula: (let ((.cse0 (mod v_~N~0_66 4294967296))) (or (and (< 0 .cse0) (= (+ 1 v_~N~0_65) v_~N~0_66) (= v_~p~0_41 (+ v_~p~0_42 v_~M~0_40))) (and (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_41 v_~p~0_42) (<= .cse0 0) (= v_~N~0_66 v_~N~0_65)))) InVars {~p~0=v_~p~0_42, ~N~0=v_~N~0_66, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_41, ~N~0=v_~N~0_65, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][214], [30#L51true, 139#(<= 1 (mod ~L~0 4294967296)), Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 124#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 136#(= ~N~0 ~L~0), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, Black: 134#true, 15#L64true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 146#true, 112#true, Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 48#(= ~N~0 ~L~0), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 220#true, Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), 20#L80true, Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 212#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 232#true, 29#L100true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 122#true, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,871 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,871 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:52,871 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:52,871 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-06 04:42:52,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 124#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 239#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 15#L64true, 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 4#L45true, 31#L79true, Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 48#(= ~N~0 ~L~0), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 29#L100true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,871 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,871 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:52,871 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:52,871 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-06 04:42:52,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 4#L45true, 31#L79true, Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 48#(= ~N~0 ~L~0), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 19#thread2EXITtrue, 29#L100true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,872 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,872 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:52,872 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:52,872 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-06 04:42:52,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([205] L45-->L51: Formula: (let ((.cse0 (mod v_~N~0_66 4294967296))) (or (and (< 0 .cse0) (= (+ 1 v_~N~0_65) v_~N~0_66) (= v_~p~0_41 (+ v_~p~0_42 v_~M~0_40))) (and (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_41 v_~p~0_42) (<= .cse0 0) (= v_~N~0_66 v_~N~0_65)))) InVars {~p~0=v_~p~0_42, ~N~0=v_~N~0_66, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_41, ~N~0=v_~N~0_65, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][215], [139#(<= 1 (mod ~L~0 4294967296)), 30#L51true, Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 124#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 136#(= ~N~0 ~L~0), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, Black: 134#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 116#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 48#(= ~N~0 ~L~0), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 220#true, Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), 20#L80true, Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 88#true, Black: 64#(= ~N~0 ~L~0), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 19#thread2EXITtrue, Black: 212#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 232#true, 29#L100true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 122#true, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,872 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,872 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-06 04:42:52,872 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:52,872 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:52,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 18#L63true, Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 73#true, 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 24#L101true, Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 88#true, Black: 64#(= ~N~0 ~L~0), 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:52,907 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-06 04:42:52,907 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:52,907 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-06 04:42:52,907 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:53,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([205] L45-->L51: Formula: (let ((.cse0 (mod v_~N~0_66 4294967296))) (or (and (< 0 .cse0) (= (+ 1 v_~N~0_65) v_~N~0_66) (= v_~p~0_41 (+ v_~p~0_42 v_~M~0_40))) (and (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_41 v_~p~0_42) (<= .cse0 0) (= v_~N~0_66 v_~N~0_65)))) InVars {~p~0=v_~p~0_42, ~N~0=v_~N~0_66, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_41, ~N~0=v_~N~0_65, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][289], [30#L51true, 139#(<= 1 (mod ~L~0 4294967296)), Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 124#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 136#(= ~N~0 ~L~0), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, Black: 134#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 46#true, Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 146#true, Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 112#true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 48#(= ~N~0 ~L~0), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 220#true, Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), 20#L80true, Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 64#(= ~N~0 ~L~0), 88#true, Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 212#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 232#true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 122#true, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 34#L70true, Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L99-1true, Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:53,598 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-06 04:42:53,598 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:53,598 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:53,598 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-06 04:42:54,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 48#(= ~N~0 ~L~0), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), 24#L101true, Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 88#true, Black: 64#(= ~N~0 ~L~0), 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 19#thread2EXITtrue, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:54,041 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-06 04:42:54,041 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-06 04:42:54,041 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-06 04:42:54,041 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-06 04:42:54,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 48#(= ~N~0 ~L~0), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), 24#L101true, Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 88#true, Black: 64#(= ~N~0 ~L~0), 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), 19#thread2EXITtrue, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:54,042 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-06 04:42:54,042 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-06 04:42:54,042 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-06 04:42:54,042 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-06 04:42:54,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([205] L45-->L51: Formula: (let ((.cse0 (mod v_~N~0_66 4294967296))) (or (and (< 0 .cse0) (= (+ 1 v_~N~0_65) v_~N~0_66) (= v_~p~0_41 (+ v_~p~0_42 v_~M~0_40))) (and (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_41 v_~p~0_42) (<= .cse0 0) (= v_~N~0_66 v_~N~0_65)))) InVars {~p~0=v_~p~0_42, ~N~0=v_~N~0_66, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_41, ~N~0=v_~N~0_65, ~M~0=v_~M~0_40, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][289], [139#(<= 1 (mod ~L~0 4294967296)), 30#L51true, Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 124#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 136#(= ~N~0 ~L~0), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, Black: 134#true, 46#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 146#true, 112#true, Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 48#(= ~N~0 ~L~0), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 220#true, Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), 20#L80true, Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 64#(= ~N~0 ~L~0), 88#true, Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 212#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), 232#true, Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 29#L100true, Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 122#true, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 34#L70true, Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:54,536 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-06 04:42:54,536 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:54,536 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:54,536 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-06 04:42:54,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 73#true, Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 10#L102true, 150#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 48#(= ~N~0 ~L~0), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 88#true, Black: 64#(= ~N~0 ~L~0), 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:54,848 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-06 04:42:54,848 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:54,848 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-06 04:42:54,848 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:54,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([216] L80-->L79: Formula: (and (= (+ v_~q~0_10 v_~M~0_16) v_~q~0_9) (= (+ v_~L~0_20 1) v_~L~0_21)) InVars {~M~0=v_~M~0_16, ~q~0=v_~q~0_10, ~L~0=v_~L~0_21} OutVars{~q~0=v_~q~0_9, ~M~0=v_~M~0_16, ~L~0=v_~L~0_20, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][153], [Black: 130#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 128#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 260#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 262#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork0_~cond~1 0)), 134#true, 118#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 136#(= ~N~0 ~L~0), Black: 139#(<= 1 (mod ~L~0 4294967296)), Black: 137#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 265#true, 455#true, 46#true, Black: 148#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 149#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(and (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), 222#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 159#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 73#true, Black: 163#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 10#L102true, 150#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 172#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 31#L79true, Black: 50#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 437#(and (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 180#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 433#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 184#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 48#(= ~N~0 ~L~0), Black: 419#(and (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (or (< (div ~L~0 4294967296) (+ (div ~N~0 4294967296) 1)) (< ~L~0 (+ 3 ~N~0))) (= ~q~0 0) (or (< (div ~N~0 4294967296) (div ~L~0 4294967296)) (< (+ ~N~0 1) ~L~0))), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 273#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 435#(and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))), Black: 277#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 431#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 413#(and (= ~N~0 ~L~0) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (< 1 (mod ~N~0 4294967296))) (= ~p~0 0) (= ~q~0 0)), Black: 415#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (<= 2 (mod ~N~0 4294967296))), Black: 272#(or (< 1 (mod ~L~0 4294967296)) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))), Black: 194#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 441#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (and (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 0 thread2Thread1of1ForFork0_~cond~1)) (and (= ~N~0 ~L~0) (<= 2 (mod ~N~0 4294967296)))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 66#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 88#true, Black: 64#(= ~N~0 ~L~0), 192#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 207#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 213#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 216#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296))))), Black: 225#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 229#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), 234#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 115#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 248#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 236#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 245#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= 2 (mod ~N~0 4294967296)))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 237#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2025-02-06 04:42:54,850 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-06 04:42:54,850 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:54,850 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-06 04:42:54,850 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-06 04:42:56,072 INFO L124 PetriNetUnfolderBase]: 21248/32952 cut-off events. [2025-02-06 04:42:56,072 INFO L125 PetriNetUnfolderBase]: For 799422/801178 co-relation queries the response was YES. [2025-02-06 04:42:56,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300596 conditions, 32952 events. 21248/32952 cut-off events. For 799422/801178 co-relation queries the response was YES. Maximal size of possible extension queue 2203. Compared 252833 event pairs, 1533 based on Foata normal form. 583/33022 useless extension candidates. Maximal degree in co-relation 298230. Up to 29532 conditions per place. [2025-02-06 04:42:56,381 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 921 selfloop transitions, 66 changer transitions 4/1022 dead transitions. [2025-02-06 04:42:56,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1022 transitions, 26190 flow [2025-02-06 04:42:56,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:42:56,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:42:56,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2025-02-06 04:42:56,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2025-02-06 04:42:56,382 INFO L175 Difference]: Start difference. First operand has 180 places, 943 transitions, 22904 flow. Second operand 6 states and 118 transitions. [2025-02-06 04:42:56,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 1022 transitions, 26190 flow [2025-02-06 04:43:00,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 1022 transitions, 25590 flow, removed 300 selfloop flow, removed 2 redundant places. [2025-02-06 04:43:00,029 INFO L231 Difference]: Finished difference. Result has 182 places, 942 transitions, 22406 flow [2025-02-06 04:43:00,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=22114, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=874, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=22406, PETRI_PLACES=182, PETRI_TRANSITIONS=942} [2025-02-06 04:43:00,030 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 147 predicate places. [2025-02-06 04:43:00,030 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 942 transitions, 22406 flow [2025-02-06 04:43:00,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:00,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:43:00,030 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:43:00,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 04:43:00,030 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:43:00,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:43:00,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1349745912, now seen corresponding path program 5 times [2025-02-06 04:43:00,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:43:00,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046212134] [2025-02-06 04:43:00,031 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:43:00,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:43:00,035 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-06 04:43:00,038 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:43:00,038 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:43:00,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:00,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:43:00,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046212134] [2025-02-06 04:43:00,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046212134] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:43:00,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383495517] [2025-02-06 04:43:00,099 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:43:00,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:43:00,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:43:00,102 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:43:00,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:43:00,130 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-06 04:43:00,141 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:43:00,141 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:43:00,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:43:00,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 04:43:00,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:43:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:00,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:43:00,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:43:00,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383495517] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:43:00,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:43:00,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-02-06 04:43:00,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909036232] [2025-02-06 04:43:00,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:43:00,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 04:43:00,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:43:00,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 04:43:00,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-06 04:43:00,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-02-06 04:43:00,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 942 transitions, 22406 flow. Second operand has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:43:00,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:43:00,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-02-06 04:43:00,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand