./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(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-?-e2fb8be-m [2025-03-08 17:37:17,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:37:17,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:37:17,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:37:17,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:37:17,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:37:17,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:37:17,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:37:17,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:37:17,867 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:37:17,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:37:17,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:37:17,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:37:17,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:37:17,868 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:37:17,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:37:17,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:37:17,868 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:37:17,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:37:17,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:37:17,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:37:17,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:37:17,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:37:17,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:37:17,869 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:37:17,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:37:17,869 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:37:17,869 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:37:17,869 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:37:17,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:37:17,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:37:17,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:37:17,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:37:17,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:37:17,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:37:17,869 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:37:17,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:37:17,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:37:17,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:37:17,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:37:17,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:37:17,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:37:17,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:37:17,870 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/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-03-08 17:37:18,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:37:18,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:37:18,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:37:18,104 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:37:18,104 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:37:18,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2025-03-08 17:37:19,178 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1576fa264/e757ade4f859445bb035e93ecd320c08/FLAGdd5255bbb [2025-03-08 17:37:19,370 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:37:19,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2025-03-08 17:37:19,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1576fa264/e757ade4f859445bb035e93ecd320c08/FLAGdd5255bbb [2025-03-08 17:37:19,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1576fa264/e757ade4f859445bb035e93ecd320c08 [2025-03-08 17:37:19,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:37:19,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:37:19,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:37:19,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:37:19,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:37:19,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:37:19" (1/1) ... [2025-03-08 17:37:19,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf8b581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:19, skipping insertion in model container [2025-03-08 17:37:19,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:37:19" (1/1) ... [2025-03-08 17:37:19,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:37:19,566 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2025-03-08 17:37:19,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:37:19,576 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:37:19,591 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2025-03-08 17:37:19,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:37:19,604 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:37:19,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:19 WrapperNode [2025-03-08 17:37:19,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:37:19,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:37:19,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:37:19,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:37:19,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:19" (1/1) ... [2025-03-08 17:37:19,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:19" (1/1) ... [2025-03-08 17:37:19,631 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2025-03-08 17:37:19,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:37:19,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:37:19,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:37:19,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:37:19,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:19" (1/1) ... [2025-03-08 17:37:19,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:19" (1/1) ... [2025-03-08 17:37:19,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:19" (1/1) ... [2025-03-08 17:37:19,644 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-03-08 17:37:19,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:19" (1/1) ... [2025-03-08 17:37:19,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:19" (1/1) ... [2025-03-08 17:37:19,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:19" (1/1) ... [2025-03-08 17:37:19,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:19" (1/1) ... [2025-03-08 17:37:19,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:19" (1/1) ... [2025-03-08 17:37:19,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:19" (1/1) ... [2025-03-08 17:37:19,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:37:19,650 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:37:19,650 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:37:19,650 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:37:19,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:19" (1/1) ... [2025-03-08 17:37:19,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:37:19,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:37:19,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:37:19,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:37:19,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:37:19,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:37:19,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:37:19,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:37:19,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:37:19,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:37:19,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:37:19,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:37:19,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 17:37:19,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 17:37:19,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:37:19,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:37:19,690 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:37:19,754 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:37:19,756 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:37:19,876 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:37:19,876 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:37:19,952 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:37:19,952 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:37:19,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:37:19 BoogieIcfgContainer [2025-03-08 17:37:19,956 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:37:19,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:37:19,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:37:19,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:37:19,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:37:19" (1/3) ... [2025-03-08 17:37:19,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3246339b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:37:19, skipping insertion in model container [2025-03-08 17:37:19,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:19" (2/3) ... [2025-03-08 17:37:19,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3246339b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:37:19, skipping insertion in model container [2025-03-08 17:37:19,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:37:19" (3/3) ... [2025-03-08 17:37:19,963 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2025-03-08 17:37:19,974 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:37:19,975 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-03-08 17:37:19,975 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:37:20,021 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:37:20,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 85 flow [2025-03-08 17:37:20,073 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2025-03-08 17:37:20,077 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:37:20,079 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-03-08 17:37:20,079 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 85 flow [2025-03-08 17:37:20,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 74 flow [2025-03-08 17:37:20,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:37:20,100 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;@29c63281, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:37:20,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:37:20,113 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:37:20,113 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2025-03-08 17:37:20,113 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:37:20,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:20,114 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-03-08 17:37:20,114 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-03-08 17:37:20,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:20,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1646862770, now seen corresponding path program 1 times [2025-03-08 17:37:20,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:20,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705080694] [2025-03-08 17:37:20,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:37:20,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:20,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 17:37:20,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 17:37:20,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:37:20,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:20,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:20,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705080694] [2025-03-08 17:37:20,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705080694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:20,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:20,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:37:20,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366588821] [2025-03-08 17:37:20,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:20,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:37:20,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:20,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:37:20,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:37:20,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2025-03-08 17:37:20,566 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-03-08 17:37:20,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:20,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2025-03-08 17:37:20,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:20,733 INFO L124 PetriNetUnfolderBase]: 510/800 cut-off events. [2025-03-08 17:37:20,733 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-08 17:37:20,736 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-03-08 17:37:20,742 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 32 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2025-03-08 17:37:20,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 195 flow [2025-03-08 17:37:20,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:37:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:37:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-03-08 17:37:20,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-03-08 17:37:20,754 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 74 flow. Second operand 3 states and 68 transitions. [2025-03-08 17:37:20,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 195 flow [2025-03-08 17:37:20,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 44 transitions, 173 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 17:37:20,762 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 88 flow [2025-03-08 17:37:20,764 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-03-08 17:37:20,768 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-03-08 17:37:20,768 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 88 flow [2025-03-08 17:37:20,768 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-03-08 17:37:20,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:20,769 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-03-08 17:37:20,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:37:20,769 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-03-08 17:37:20,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:20,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1611471900, now seen corresponding path program 1 times [2025-03-08 17:37:20,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:20,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764118513] [2025-03-08 17:37:20,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:37:20,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:20,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 17:37:20,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 17:37:20,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:37:20,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:21,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:21,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764118513] [2025-03-08 17:37:21,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764118513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:21,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:21,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:37:21,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89660896] [2025-03-08 17:37:21,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:21,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:37:21,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:21,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:37:21,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:37:21,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-08 17:37:21,037 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-03-08 17:37:21,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:21,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-08 17:37:21,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:21,322 INFO L124 PetriNetUnfolderBase]: 898/1380 cut-off events. [2025-03-08 17:37:21,323 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2025-03-08 17:37:21,326 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-03-08 17:37:21,332 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 86 selfloop transitions, 19 changer transitions 0/111 dead transitions. [2025-03-08 17:37:21,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 111 transitions, 512 flow [2025-03-08 17:37:21,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:37:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:37:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2025-03-08 17:37:21,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68359375 [2025-03-08 17:37:21,333 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 88 flow. Second operand 8 states and 175 transitions. [2025-03-08 17:37:21,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 111 transitions, 512 flow [2025-03-08 17:37:21,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 111 transitions, 502 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:37:21,336 INFO L231 Difference]: Finished difference. Result has 44 places, 49 transitions, 228 flow [2025-03-08 17:37:21,336 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-03-08 17:37:21,337 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2025-03-08 17:37:21,337 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 49 transitions, 228 flow [2025-03-08 17:37:21,337 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-03-08 17:37:21,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:21,337 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-03-08 17:37:21,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:37:21,338 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-03-08 17:37:21,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:21,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1531703500, now seen corresponding path program 2 times [2025-03-08 17:37:21,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:21,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058388043] [2025-03-08 17:37:21,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:37:21,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:21,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-03-08 17:37:21,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 17:37:21,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:37:21,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:21,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:21,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:21,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058388043] [2025-03-08 17:37:21,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058388043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:21,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:21,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:37:21,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367039032] [2025-03-08 17:37:21,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:21,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:37:21,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:21,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:37:21,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:37:21,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-08 17:37:21,480 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-03-08 17:37:21,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:21,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-08 17:37:21,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:21,695 INFO L124 PetriNetUnfolderBase]: 1068/1616 cut-off events. [2025-03-08 17:37:21,695 INFO L125 PetriNetUnfolderBase]: For 1648/1651 co-relation queries the response was YES. [2025-03-08 17:37:21,698 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-03-08 17:37:21,703 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 64 selfloop transitions, 20 changer transitions 2/92 dead transitions. [2025-03-08 17:37:21,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 92 transitions, 580 flow [2025-03-08 17:37:21,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:37:21,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:37:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2025-03-08 17:37:21,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-08 17:37:21,705 INFO L175 Difference]: Start difference. First operand has 44 places, 49 transitions, 228 flow. Second operand 6 states and 120 transitions. [2025-03-08 17:37:21,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 92 transitions, 580 flow [2025-03-08 17:37:21,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 92 transitions, 580 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:37:21,709 INFO L231 Difference]: Finished difference. Result has 53 places, 60 transitions, 382 flow [2025-03-08 17:37:21,709 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-03-08 17:37:21,710 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2025-03-08 17:37:21,710 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 60 transitions, 382 flow [2025-03-08 17:37:21,710 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-03-08 17:37:21,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:21,710 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-03-08 17:37:21,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:37:21,710 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-03-08 17:37:21,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:21,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1102887362, now seen corresponding path program 3 times [2025-03-08 17:37:21,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:21,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466295372] [2025-03-08 17:37:21,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:37:21,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:21,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-08 17:37:21,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 17:37:21,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:37:21,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466295372] [2025-03-08 17:37:21,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466295372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:21,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:21,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:37:21,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097345353] [2025-03-08 17:37:21,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:21,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:37:21,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:21,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:37:21,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:37:21,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-08 17:37:21,871 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-03-08 17:37:21,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:21,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-08 17:37:21,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:22,200 INFO L124 PetriNetUnfolderBase]: 1825/2684 cut-off events. [2025-03-08 17:37:22,201 INFO L125 PetriNetUnfolderBase]: For 3614/3614 co-relation queries the response was YES. [2025-03-08 17:37:22,208 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-03-08 17:37:22,220 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 88 selfloop transitions, 38 changer transitions 2/133 dead transitions. [2025-03-08 17:37:22,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 133 transitions, 923 flow [2025-03-08 17:37:22,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:37:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:37:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2025-03-08 17:37:22,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66015625 [2025-03-08 17:37:22,225 INFO L175 Difference]: Start difference. First operand has 53 places, 60 transitions, 382 flow. Second operand 8 states and 169 transitions. [2025-03-08 17:37:22,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 133 transitions, 923 flow [2025-03-08 17:37:22,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 133 transitions, 879 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-08 17:37:22,243 INFO L231 Difference]: Finished difference. Result has 63 places, 74 transitions, 612 flow [2025-03-08 17:37:22,243 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-03-08 17:37:22,244 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-03-08 17:37:22,244 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 74 transitions, 612 flow [2025-03-08 17:37:22,244 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-03-08 17:37:22,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:22,245 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-03-08 17:37:22,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:37:22,245 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-03-08 17:37:22,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:22,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1002627942, now seen corresponding path program 4 times [2025-03-08 17:37:22,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:22,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182450931] [2025-03-08 17:37:22,247 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:37:22,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:22,253 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-08 17:37:22,259 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 17:37:22,259 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:37:22,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:22,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:22,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182450931] [2025-03-08 17:37:22,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182450931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:22,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:22,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:37:22,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455397304] [2025-03-08 17:37:22,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:22,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:37:22,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:22,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:37:22,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:37:22,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2025-03-08 17:37:22,440 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-03-08 17:37:22,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:22,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2025-03-08 17:37:22,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:22,922 INFO L124 PetriNetUnfolderBase]: 1770/2867 cut-off events. [2025-03-08 17:37:22,923 INFO L125 PetriNetUnfolderBase]: For 7040/7159 co-relation queries the response was YES. [2025-03-08 17:37:22,929 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-03-08 17:37:22,940 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 102 selfloop transitions, 46 changer transitions 2/161 dead transitions. [2025-03-08 17:37:22,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 161 transitions, 1279 flow [2025-03-08 17:37:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:37:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 17:37:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 230 transitions. [2025-03-08 17:37:22,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2025-03-08 17:37:22,942 INFO L175 Difference]: Start difference. First operand has 63 places, 74 transitions, 612 flow. Second operand 12 states and 230 transitions. [2025-03-08 17:37:22,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 161 transitions, 1279 flow [2025-03-08 17:37:22,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 161 transitions, 1258 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-03-08 17:37:22,956 INFO L231 Difference]: Finished difference. Result has 80 places, 105 transitions, 947 flow [2025-03-08 17:37:22,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-03-08 17:37:22,957 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 45 predicate places. [2025-03-08 17:37:22,958 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 105 transitions, 947 flow [2025-03-08 17:37:22,958 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-03-08 17:37:22,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:22,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-03-08 17:37:22,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:37:22,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-03-08 17:37:22,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:22,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1237664782, now seen corresponding path program 1 times [2025-03-08 17:37:22,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:22,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341800767] [2025-03-08 17:37:22,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:37:22,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:22,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:37:22,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:22,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:37:22,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:23,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:23,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341800767] [2025-03-08 17:37:23,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341800767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:23,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:23,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:37:23,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572667752] [2025-03-08 17:37:23,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:23,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:37:23,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:23,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:37:23,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:37:23,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-08 17:37:23,178 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-03-08 17:37:23,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:23,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-08 17:37:23,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:23,665 INFO L124 PetriNetUnfolderBase]: 3451/5458 cut-off events. [2025-03-08 17:37:23,666 INFO L125 PetriNetUnfolderBase]: For 27891/28344 co-relation queries the response was YES. [2025-03-08 17:37:23,678 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-03-08 17:37:23,702 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 131 selfloop transitions, 98 changer transitions 1/240 dead transitions. [2025-03-08 17:37:23,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 240 transitions, 2578 flow [2025-03-08 17:37:23,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:37:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:37:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2025-03-08 17:37:23,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-08 17:37:23,705 INFO L175 Difference]: Start difference. First operand has 80 places, 105 transitions, 947 flow. Second operand 6 states and 126 transitions. [2025-03-08 17:37:23,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 240 transitions, 2578 flow [2025-03-08 17:37:23,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 240 transitions, 2361 flow, removed 88 selfloop flow, removed 1 redundant places. [2025-03-08 17:37:23,773 INFO L231 Difference]: Finished difference. Result has 87 places, 164 transitions, 1694 flow [2025-03-08 17:37:23,774 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-03-08 17:37:23,775 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 52 predicate places. [2025-03-08 17:37:23,775 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 164 transitions, 1694 flow [2025-03-08 17:37:23,776 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-03-08 17:37:23,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:23,776 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-03-08 17:37:23,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:37:23,776 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-03-08 17:37:23,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:23,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1753791142, now seen corresponding path program 2 times [2025-03-08 17:37:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:23,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095623570] [2025-03-08 17:37:23,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:37:23,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:23,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:37:23,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:23,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:37:23,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:23,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:23,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095623570] [2025-03-08 17:37:23,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095623570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:23,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:23,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:37:23,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948985199] [2025-03-08 17:37:23,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:23,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:37:23,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:23,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:37:23,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:37:23,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-08 17:37:23,936 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-03-08 17:37:23,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:23,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-08 17:37:23,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:24,553 INFO L124 PetriNetUnfolderBase]: 4305/6838 cut-off events. [2025-03-08 17:37:24,554 INFO L125 PetriNetUnfolderBase]: For 43027/43463 co-relation queries the response was YES. [2025-03-08 17:37:24,615 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-03-08 17:37:24,637 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 203 selfloop transitions, 144 changer transitions 1/358 dead transitions. [2025-03-08 17:37:24,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 358 transitions, 4434 flow [2025-03-08 17:37:24,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:37:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:37:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-03-08 17:37:24,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63125 [2025-03-08 17:37:24,639 INFO L175 Difference]: Start difference. First operand has 87 places, 164 transitions, 1694 flow. Second operand 5 states and 101 transitions. [2025-03-08 17:37:24,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 358 transitions, 4434 flow [2025-03-08 17:37:24,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 358 transitions, 4426 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-08 17:37:24,735 INFO L231 Difference]: Finished difference. Result has 94 places, 252 transitions, 3256 flow [2025-03-08 17:37:24,735 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-03-08 17:37:24,735 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 59 predicate places. [2025-03-08 17:37:24,736 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 252 transitions, 3256 flow [2025-03-08 17:37:24,736 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-03-08 17:37:24,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:24,736 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-03-08 17:37:24,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:37:24,736 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-03-08 17:37:24,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:24,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1332687080, now seen corresponding path program 1 times [2025-03-08 17:37:24,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:24,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322322124] [2025-03-08 17:37:24,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:37:24,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:24,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:37:24,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:24,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:37:24,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:24,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:24,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322322124] [2025-03-08 17:37:24,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322322124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:24,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:24,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:37:24,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642785089] [2025-03-08 17:37:24,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:24,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:37:24,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:24,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:37:24,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:37:24,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-08 17:37:24,884 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-03-08 17:37:24,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:24,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-08 17:37:24,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:25,725 INFO L124 PetriNetUnfolderBase]: 6065/9213 cut-off events. [2025-03-08 17:37:25,726 INFO L125 PetriNetUnfolderBase]: For 67302/67572 co-relation queries the response was YES. [2025-03-08 17:37:25,751 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-03-08 17:37:25,781 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 288 selfloop transitions, 77 changer transitions 2/373 dead transitions. [2025-03-08 17:37:25,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 373 transitions, 5074 flow [2025-03-08 17:37:25,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:37:25,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:37:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2025-03-08 17:37:25,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6294642857142857 [2025-03-08 17:37:25,786 INFO L175 Difference]: Start difference. First operand has 94 places, 252 transitions, 3256 flow. Second operand 7 states and 141 transitions. [2025-03-08 17:37:25,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 373 transitions, 5074 flow [2025-03-08 17:37:25,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 373 transitions, 5074 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:37:25,977 INFO L231 Difference]: Finished difference. Result has 104 places, 255 transitions, 3545 flow [2025-03-08 17:37:25,977 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-03-08 17:37:25,980 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2025-03-08 17:37:25,982 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 255 transitions, 3545 flow [2025-03-08 17:37:25,982 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-03-08 17:37:25,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:25,982 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-03-08 17:37:25,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:37:25,982 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-03-08 17:37:25,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:25,982 INFO L85 PathProgramCache]: Analyzing trace with hash 557159982, now seen corresponding path program 3 times [2025-03-08 17:37:25,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:25,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034053718] [2025-03-08 17:37:25,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:37:25,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:25,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-08 17:37:25,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:25,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:37:25,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:26,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:26,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034053718] [2025-03-08 17:37:26,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034053718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:26,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:26,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:37:26,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328442107] [2025-03-08 17:37:26,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:26,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:37:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:26,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:37:26,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:37:26,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-08 17:37:26,136 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-03-08 17:37:26,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:26,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-08 17:37:26,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:26,903 INFO L124 PetriNetUnfolderBase]: 4825/7932 cut-off events. [2025-03-08 17:37:26,903 INFO L125 PetriNetUnfolderBase]: For 71024/71578 co-relation queries the response was YES. [2025-03-08 17:37:26,926 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-03-08 17:37:26,960 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 203 selfloop transitions, 208 changer transitions 2/426 dead transitions. [2025-03-08 17:37:26,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 426 transitions, 6395 flow [2025-03-08 17:37:26,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:37:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:37:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-03-08 17:37:26,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6614583333333334 [2025-03-08 17:37:26,962 INFO L175 Difference]: Start difference. First operand has 104 places, 255 transitions, 3545 flow. Second operand 6 states and 127 transitions. [2025-03-08 17:37:26,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 426 transitions, 6395 flow [2025-03-08 17:37:27,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 426 transitions, 6311 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-08 17:37:27,111 INFO L231 Difference]: Finished difference. Result has 112 places, 322 transitions, 5299 flow [2025-03-08 17:37:27,111 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-03-08 17:37:27,112 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 77 predicate places. [2025-03-08 17:37:27,112 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 322 transitions, 5299 flow [2025-03-08 17:37:27,112 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-03-08 17:37:27,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:27,112 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-03-08 17:37:27,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:37:27,113 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-03-08 17:37:27,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1299908642, now seen corresponding path program 4 times [2025-03-08 17:37:27,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:27,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713452349] [2025-03-08 17:37:27,113 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:37:27,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:27,118 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-08 17:37:27,123 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:27,123 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:37:27,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:27,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:27,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713452349] [2025-03-08 17:37:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713452349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:27,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:27,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:37:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737663410] [2025-03-08 17:37:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:27,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:37:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:27,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:37:27,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:37:27,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-08 17:37:27,257 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-03-08 17:37:27,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:27,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-08 17:37:27,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:28,382 INFO L124 PetriNetUnfolderBase]: 4951/8300 cut-off events. [2025-03-08 17:37:28,382 INFO L125 PetriNetUnfolderBase]: For 93544/94069 co-relation queries the response was YES. [2025-03-08 17:37:28,404 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-03-08 17:37:28,433 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 119 selfloop transitions, 237 changer transitions 1/370 dead transitions. [2025-03-08 17:37:28,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 370 transitions, 6377 flow [2025-03-08 17:37:28,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:37:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:37:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-08 17:37:28,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-03-08 17:37:28,434 INFO L175 Difference]: Start difference. First operand has 112 places, 322 transitions, 5299 flow. Second operand 5 states and 108 transitions. [2025-03-08 17:37:28,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 370 transitions, 6377 flow [2025-03-08 17:37:28,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 370 transitions, 6282 flow, removed 37 selfloop flow, removed 1 redundant places. [2025-03-08 17:37:28,600 INFO L231 Difference]: Finished difference. Result has 118 places, 326 transitions, 5998 flow [2025-03-08 17:37:28,600 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-03-08 17:37:28,601 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 83 predicate places. [2025-03-08 17:37:28,601 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 326 transitions, 5998 flow [2025-03-08 17:37:28,601 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-03-08 17:37:28,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:28,601 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-03-08 17:37:28,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:37:28,601 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-03-08 17:37:28,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:28,601 INFO L85 PathProgramCache]: Analyzing trace with hash 751599996, now seen corresponding path program 2 times [2025-03-08 17:37:28,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:28,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52911317] [2025-03-08 17:37:28,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:37:28,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:28,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:37:28,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:28,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:37:28,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:28,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:28,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52911317] [2025-03-08 17:37:28,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52911317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:28,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:28,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:37:28,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193169110] [2025-03-08 17:37:28,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:28,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:37:28,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:28,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:37:28,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:37:28,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-08 17:37:28,700 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-03-08 17:37:28,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:28,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-08 17:37:28,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:29,625 INFO L124 PetriNetUnfolderBase]: 5481/9085 cut-off events. [2025-03-08 17:37:29,625 INFO L125 PetriNetUnfolderBase]: For 116375/116896 co-relation queries the response was YES. [2025-03-08 17:37:29,654 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-03-08 17:37:29,683 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 274 selfloop transitions, 78 changer transitions 5/369 dead transitions. [2025-03-08 17:37:29,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 369 transitions, 7167 flow [2025-03-08 17:37:29,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:37:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:37:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-03-08 17:37:29,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-08 17:37:29,684 INFO L175 Difference]: Start difference. First operand has 118 places, 326 transitions, 5998 flow. Second operand 5 states and 105 transitions. [2025-03-08 17:37:29,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 369 transitions, 7167 flow [2025-03-08 17:37:29,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 369 transitions, 6923 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-08 17:37:29,946 INFO L231 Difference]: Finished difference. Result has 123 places, 331 transitions, 6143 flow [2025-03-08 17:37:29,946 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-03-08 17:37:29,946 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 88 predicate places. [2025-03-08 17:37:29,947 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 331 transitions, 6143 flow [2025-03-08 17:37:29,947 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-03-08 17:37:29,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:29,947 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-03-08 17:37:29,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:37:29,947 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-03-08 17:37:29,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash 674502856, now seen corresponding path program 5 times [2025-03-08 17:37:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:29,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120495139] [2025-03-08 17:37:29,947 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:37:29,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:29,951 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:37:29,955 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:29,955 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:37:29,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:30,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:30,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120495139] [2025-03-08 17:37:30,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120495139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:30,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:30,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:37:30,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052465258] [2025-03-08 17:37:30,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:30,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:37:30,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:30,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:37:30,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:37:30,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-08 17:37:30,075 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-03-08 17:37:30,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:30,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-08 17:37:30,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:31,033 INFO L124 PetriNetUnfolderBase]: 6115/9771 cut-off events. [2025-03-08 17:37:31,033 INFO L125 PetriNetUnfolderBase]: For 121014/121515 co-relation queries the response was YES. [2025-03-08 17:37:31,164 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-03-08 17:37:31,206 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 156 selfloop transitions, 263 changer transitions 3/432 dead transitions. [2025-03-08 17:37:31,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 432 transitions, 8043 flow [2025-03-08 17:37:31,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:37:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:37:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2025-03-08 17:37:31,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-08 17:37:31,207 INFO L175 Difference]: Start difference. First operand has 123 places, 331 transitions, 6143 flow. Second operand 6 states and 126 transitions. [2025-03-08 17:37:31,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 432 transitions, 8043 flow [2025-03-08 17:37:31,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 432 transitions, 7941 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-08 17:37:31,483 INFO L231 Difference]: Finished difference. Result has 129 places, 352 transitions, 7094 flow [2025-03-08 17:37:31,484 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-03-08 17:37:31,484 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 94 predicate places. [2025-03-08 17:37:31,484 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 352 transitions, 7094 flow [2025-03-08 17:37:31,484 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-03-08 17:37:31,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:31,484 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-03-08 17:37:31,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 17:37:31,484 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-03-08 17:37:31,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:31,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1715653448, now seen corresponding path program 6 times [2025-03-08 17:37:31,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:31,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302703817] [2025-03-08 17:37:31,485 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:37:31,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:31,490 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:37:31,494 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:31,494 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 17:37:31,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:31,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:31,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302703817] [2025-03-08 17:37:31,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302703817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:31,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:31,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:37:31,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885388720] [2025-03-08 17:37:31,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:31,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:37:31,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:31,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:37:31,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:37:31,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-08 17:37:31,657 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-03-08 17:37:31,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:31,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-08 17:37:31,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:33,381 INFO L124 PetriNetUnfolderBase]: 7655/12052 cut-off events. [2025-03-08 17:37:33,381 INFO L125 PetriNetUnfolderBase]: For 177384/178049 co-relation queries the response was YES. [2025-03-08 17:37:33,414 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-03-08 17:37:33,454 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 185 selfloop transitions, 302 changer transitions 3/500 dead transitions. [2025-03-08 17:37:33,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 500 transitions, 10008 flow [2025-03-08 17:37:33,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:37:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:37:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2025-03-08 17:37:33,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6651785714285714 [2025-03-08 17:37:33,456 INFO L175 Difference]: Start difference. First operand has 129 places, 352 transitions, 7094 flow. Second operand 7 states and 149 transitions. [2025-03-08 17:37:33,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 500 transitions, 10008 flow [2025-03-08 17:37:33,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 500 transitions, 9712 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-08 17:37:33,816 INFO L231 Difference]: Finished difference. Result has 135 places, 391 transitions, 8489 flow [2025-03-08 17:37:33,816 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-03-08 17:37:33,817 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 100 predicate places. [2025-03-08 17:37:33,817 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 391 transitions, 8489 flow [2025-03-08 17:37:33,817 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-03-08 17:37:33,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:33,817 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-03-08 17:37:33,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 17:37:33,817 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-03-08 17:37:33,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:33,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1437801030, now seen corresponding path program 3 times [2025-03-08 17:37:33,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:33,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121463183] [2025-03-08 17:37:33,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:37:33,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:33,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-08 17:37:33,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:33,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:37:33,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:33,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:33,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121463183] [2025-03-08 17:37:33,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121463183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:33,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:33,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:37:33,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226669371] [2025-03-08 17:37:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:33,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:37:33,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:33,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:37:33,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:37:33,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-08 17:37:33,894 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-03-08 17:37:33,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:33,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-08 17:37:33,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:35,000 INFO L124 PetriNetUnfolderBase]: 6295/10061 cut-off events. [2025-03-08 17:37:35,000 INFO L125 PetriNetUnfolderBase]: For 170437/171137 co-relation queries the response was YES. [2025-03-08 17:37:35,052 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-03-08 17:37:35,104 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 358 selfloop transitions, 58 changer transitions 13/442 dead transitions. [2025-03-08 17:37:35,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 442 transitions, 9753 flow [2025-03-08 17:37:35,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:37:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:37:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-03-08 17:37:35,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-08 17:37:35,105 INFO L175 Difference]: Start difference. First operand has 135 places, 391 transitions, 8489 flow. Second operand 5 states and 105 transitions. [2025-03-08 17:37:35,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 442 transitions, 9753 flow [2025-03-08 17:37:35,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 442 transitions, 9690 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:37:35,587 INFO L231 Difference]: Finished difference. Result has 139 places, 379 transitions, 8223 flow [2025-03-08 17:37:35,587 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-03-08 17:37:35,588 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 104 predicate places. [2025-03-08 17:37:35,588 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 379 transitions, 8223 flow [2025-03-08 17:37:35,588 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-03-08 17:37:35,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:35,588 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-03-08 17:37:35,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 17:37:35,588 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-03-08 17:37:35,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:35,589 INFO L85 PathProgramCache]: Analyzing trace with hash 2138864360, now seen corresponding path program 7 times [2025-03-08 17:37:35,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:35,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943276822] [2025-03-08 17:37:35,589 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:37:35,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:35,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:37:35,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:35,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:37:35,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:35,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:35,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943276822] [2025-03-08 17:37:35,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943276822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:35,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:35,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:37:35,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492684742] [2025-03-08 17:37:35,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:35,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:37:35,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:35,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:37:35,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:37:35,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-08 17:37:35,735 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-03-08 17:37:35,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:35,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-08 17:37:35,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:36,866 INFO L124 PetriNetUnfolderBase]: 6713/10341 cut-off events. [2025-03-08 17:37:36,866 INFO L125 PetriNetUnfolderBase]: For 171109/171858 co-relation queries the response was YES. [2025-03-08 17:37:36,907 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-03-08 17:37:36,948 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 223 selfloop transitions, 238 changer transitions 5/476 dead transitions. [2025-03-08 17:37:36,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 476 transitions, 10475 flow [2025-03-08 17:37:36,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:37:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:37:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-03-08 17:37:36,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-08 17:37:36,949 INFO L175 Difference]: Start difference. First operand has 139 places, 379 transitions, 8223 flow. Second operand 5 states and 105 transitions. [2025-03-08 17:37:36,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 476 transitions, 10475 flow [2025-03-08 17:37:37,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 476 transitions, 10218 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-08 17:37:37,389 INFO L231 Difference]: Finished difference. Result has 142 places, 397 transitions, 9282 flow [2025-03-08 17:37:37,389 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-03-08 17:37:37,390 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 107 predicate places. [2025-03-08 17:37:37,390 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 397 transitions, 9282 flow [2025-03-08 17:37:37,390 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-03-08 17:37:37,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:37,390 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-03-08 17:37:37,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 17:37:37,390 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-03-08 17:37:37,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:37,390 INFO L85 PathProgramCache]: Analyzing trace with hash 582700240, now seen corresponding path program 8 times [2025-03-08 17:37:37,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:37,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186085285] [2025-03-08 17:37:37,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:37:37,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:37,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:37:37,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:37,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:37:37,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:37,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:37,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186085285] [2025-03-08 17:37:37,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186085285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:37,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:37,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:37:37,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050576505] [2025-03-08 17:37:37,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:37,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:37:37,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:37,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:37:37,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:37:37,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-08 17:37:37,544 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-03-08 17:37:37,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:37,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-08 17:37:37,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:39,180 INFO L124 PetriNetUnfolderBase]: 9181/13972 cut-off events. [2025-03-08 17:37:39,181 INFO L125 PetriNetUnfolderBase]: For 253995/255116 co-relation queries the response was YES. [2025-03-08 17:37:39,234 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-03-08 17:37:39,298 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 252 selfloop transitions, 348 changer transitions 6/616 dead transitions. [2025-03-08 17:37:39,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 616 transitions, 14504 flow [2025-03-08 17:37:39,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:37:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:37:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2025-03-08 17:37:39,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6473214285714286 [2025-03-08 17:37:39,299 INFO L175 Difference]: Start difference. First operand has 142 places, 397 transitions, 9282 flow. Second operand 7 states and 145 transitions. [2025-03-08 17:37:39,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 616 transitions, 14504 flow [2025-03-08 17:37:39,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 616 transitions, 14228 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-03-08 17:37:39,860 INFO L231 Difference]: Finished difference. Result has 146 places, 505 transitions, 12775 flow [2025-03-08 17:37:39,861 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-03-08 17:37:39,861 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 111 predicate places. [2025-03-08 17:37:39,861 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 505 transitions, 12775 flow [2025-03-08 17:37:39,861 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-03-08 17:37:39,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:39,861 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-03-08 17:37:39,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 17:37:39,861 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-03-08 17:37:39,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:39,862 INFO L85 PathProgramCache]: Analyzing trace with hash 388377726, now seen corresponding path program 9 times [2025-03-08 17:37:39,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:39,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977818941] [2025-03-08 17:37:39,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:37:39,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:39,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:37:39,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:39,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:37:39,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:39,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977818941] [2025-03-08 17:37:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977818941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:39,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:39,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:37:39,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026448618] [2025-03-08 17:37:39,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:39,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:37:39,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:39,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:37:39,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:37:39,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-08 17:37:39,957 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-03-08 17:37:39,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:39,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-08 17:37:39,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:42,286 INFO L124 PetriNetUnfolderBase]: 9831/15267 cut-off events. [2025-03-08 17:37:42,287 INFO L125 PetriNetUnfolderBase]: For 335303/336473 co-relation queries the response was YES. [2025-03-08 17:37:42,375 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-03-08 17:37:42,467 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 367 selfloop transitions, 327 changer transitions 8/724 dead transitions. [2025-03-08 17:37:42,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 724 transitions, 18180 flow [2025-03-08 17:37:42,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:37:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:37:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2025-03-08 17:37:42,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-03-08 17:37:42,468 INFO L175 Difference]: Start difference. First operand has 146 places, 505 transitions, 12775 flow. Second operand 9 states and 176 transitions. [2025-03-08 17:37:42,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 724 transitions, 18180 flow [2025-03-08 17:37:43,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 724 transitions, 17483 flow, removed 50 selfloop flow, removed 5 redundant places. [2025-03-08 17:37:43,345 INFO L231 Difference]: Finished difference. Result has 152 places, 594 transitions, 15481 flow [2025-03-08 17:37:43,345 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-03-08 17:37:43,346 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 117 predicate places. [2025-03-08 17:37:43,346 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 594 transitions, 15481 flow [2025-03-08 17:37:43,346 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-03-08 17:37:43,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:43,346 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-03-08 17:37:43,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 17:37:43,346 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-03-08 17:37:43,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1502700566, now seen corresponding path program 10 times [2025-03-08 17:37:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:43,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930390953] [2025-03-08 17:37:43,346 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:37:43,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:43,350 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-08 17:37:43,354 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:43,354 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:37:43,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:43,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:43,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930390953] [2025-03-08 17:37:43,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930390953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:43,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:43,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:37:43,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654712134] [2025-03-08 17:37:43,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:43,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:37:43,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:43,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:37:43,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:37:43,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-08 17:37:43,418 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-03-08 17:37:43,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:43,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-08 17:37:43,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:45,833 INFO L124 PetriNetUnfolderBase]: 9974/15524 cut-off events. [2025-03-08 17:37:45,833 INFO L125 PetriNetUnfolderBase]: For 332675/333271 co-relation queries the response was YES. [2025-03-08 17:37:46,016 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-03-08 17:37:46,088 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 553 selfloop transitions, 52 changer transitions 2/629 dead transitions. [2025-03-08 17:37:46,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 629 transitions, 17084 flow [2025-03-08 17:37:46,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:37:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:37:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-03-08 17:37:46,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6125 [2025-03-08 17:37:46,089 INFO L175 Difference]: Start difference. First operand has 152 places, 594 transitions, 15481 flow. Second operand 5 states and 98 transitions. [2025-03-08 17:37:46,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 629 transitions, 17084 flow [2025-03-08 17:37:47,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 629 transitions, 16434 flow, removed 68 selfloop flow, removed 8 redundant places. [2025-03-08 17:37:47,394 INFO L231 Difference]: Finished difference. Result has 149 places, 597 transitions, 15037 flow [2025-03-08 17:37:47,394 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-03-08 17:37:47,395 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 114 predicate places. [2025-03-08 17:37:47,395 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 597 transitions, 15037 flow [2025-03-08 17:37:47,395 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-03-08 17:37:47,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:47,395 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-03-08 17:37:47,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 17:37:47,395 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-03-08 17:37:47,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:47,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1473158516, now seen corresponding path program 11 times [2025-03-08 17:37:47,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:47,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100659305] [2025-03-08 17:37:47,396 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:37:47,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:47,398 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-08 17:37:47,402 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:47,402 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:37:47,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:47,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:47,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100659305] [2025-03-08 17:37:47,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100659305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:37:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530984530] [2025-03-08 17:37:47,588 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:37:47,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:37:47,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:37:47,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:37:47,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:37:47,629 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-08 17:37:47,642 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:47,642 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:37:47,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:47,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 17:37:47,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:37:47,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:47,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:37:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:48,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530984530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:37:48,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:37:48,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 14 [2025-03-08 17:37:48,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269716099] [2025-03-08 17:37:48,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:37:48,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 17:37:48,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:48,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 17:37:48,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-08 17:37:48,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-08 17:37:48,174 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-03-08 17:37:48,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:48,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-08 17:37:48,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:54,175 INFO L124 PetriNetUnfolderBase]: 23174/34711 cut-off events. [2025-03-08 17:37:54,176 INFO L125 PetriNetUnfolderBase]: For 694792/694870 co-relation queries the response was YES. [2025-03-08 17:37:54,371 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-03-08 17:37:54,528 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1175 selfloop transitions, 369 changer transitions 16/1576 dead transitions. [2025-03-08 17:37:54,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 1576 transitions, 38876 flow [2025-03-08 17:37:54,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 17:37:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-08 17:37:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 415 transitions. [2025-03-08 17:37:54,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6175595238095238 [2025-03-08 17:37:54,530 INFO L175 Difference]: Start difference. First operand has 149 places, 597 transitions, 15037 flow. Second operand 21 states and 415 transitions. [2025-03-08 17:37:54,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 1576 transitions, 38876 flow [2025-03-08 17:37:56,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 1576 transitions, 38714 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-03-08 17:37:56,762 INFO L231 Difference]: Finished difference. Result has 180 places, 943 transitions, 22904 flow [2025-03-08 17:37:56,762 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-03-08 17:37:56,763 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 145 predicate places. [2025-03-08 17:37:56,763 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 943 transitions, 22904 flow [2025-03-08 17:37:56,763 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-03-08 17:37:56,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:37:56,763 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-03-08 17:37:56,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 17:37:56,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:37:56,968 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-03-08 17:37:56,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:37:56,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1504583618, now seen corresponding path program 12 times [2025-03-08 17:37:56,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:37:56,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466950015] [2025-03-08 17:37:56,968 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:37:56,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:37:56,971 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:37:56,974 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:37:56,974 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 17:37:56,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:37:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:37:57,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:37:57,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466950015] [2025-03-08 17:37:57,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466950015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:37:57,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:37:57,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:37:57,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707353140] [2025-03-08 17:37:57,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:37:57,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:37:57,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:37:57,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:37:57,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:37:57,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-08 17:37:57,050 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-03-08 17:37:57,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:37:57,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-08 17:37:57,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:37:58,242 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-03-08 17:37:58,243 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2025-03-08 17:37:58,243 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:37:58,243 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-03-08 17:37:58,243 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-03-08 17:37:58,798 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-03-08 17:37:58,799 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-03-08 17:37:58,799 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-08 17:37:58,799 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-08 17:37:58,799 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-08 17:37:58,891 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-03-08 17:37:58,892 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-03-08 17:37:58,892 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-08 17:37:58,892 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-08 17:37:58,892 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-08 17:37:58,897 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-03-08 17:37:58,897 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-03-08 17:37:58,897 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-08 17:37:58,897 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-08 17:37:58,897 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-08 17:37:58,897 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-03-08 17:37:58,897 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-03-08 17:37:58,897 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-08 17:37:58,897 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-08 17:37:58,897 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-08 17:37:58,917 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-03-08 17:37:58,917 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-03-08 17:37:58,917 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-08 17:37:58,917 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-08 17:37:58,917 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-08 17:37:58,918 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-03-08 17:37:58,918 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-03-08 17:37:58,918 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-08 17:37:58,918 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-08 17:37:58,918 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-08 17:37:58,919 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-03-08 17:37:58,919 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-03-08 17:37:58,919 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-08 17:37:58,919 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-08 17:37:58,919 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-08 17:37:59,687 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-03-08 17:37:59,687 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-08 17:37:59,687 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,687 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:37:59,687 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,692 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-03-08 17:37:59,692 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-08 17:37:59,692 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,692 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,692 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:37:59,692 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-03-08 17:37:59,692 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-08 17:37:59,692 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,692 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,692 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:37:59,706 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-03-08 17:37:59,706 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-08 17:37:59,706 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:37:59,706 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,706 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,706 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-03-08 17:37:59,707 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-08 17:37:59,708 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:37:59,708 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,708 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,709 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-03-08 17:37:59,709 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-08 17:37:59,709 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:37:59,709 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,709 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,816 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-03-08 17:37:59,816 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-08 17:37:59,816 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,816 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,816 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:37:59,817 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-03-08 17:37:59,817 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-08 17:37:59,817 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,817 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,817 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:37:59,822 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-03-08 17:37:59,822 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-08 17:37:59,822 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,822 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,822 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:37:59,823 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-03-08 17:37:59,823 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-08 17:37:59,823 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,823 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,823 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:37:59,823 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-03-08 17:37:59,824 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-08 17:37:59,825 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:37:59,825 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,825 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,825 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-03-08 17:37:59,825 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-08 17:37:59,825 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:37:59,825 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:37:59,825 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:38:00,549 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-03-08 17:38:00,550 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-08 17:38:00,550 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:00,550 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-08 17:38:00,550 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:00,550 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-03-08 17:38:00,550 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-08 17:38:00,550 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:00,550 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-08 17:38:00,550 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:00,551 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-03-08 17:38:00,551 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-08 17:38:00,551 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:00,551 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-08 17:38:00,551 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:00,558 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-03-08 17:38:00,559 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-08 17:38:00,559 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:00,559 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:00,559 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-08 17:38:00,559 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-03-08 17:38:00,559 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-08 17:38:00,559 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:00,559 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:00,559 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-08 17:38:00,559 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-03-08 17:38:00,559 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-08 17:38:00,559 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:00,559 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:00,559 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-08 17:38:00,560 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-03-08 17:38:00,560 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-08 17:38:00,560 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-08 17:38:00,560 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:00,560 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:00,586 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-03-08 17:38:00,586 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-08 17:38:00,586 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:00,586 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-08 17:38:00,586 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:01,000 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-03-08 17:38:01,000 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-03-08 17:38:01,000 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:38:01,000 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:38:01,000 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-08 17:38:01,252 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-03-08 17:38:01,252 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-08 17:38:01,252 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-08 17:38:01,252 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-08 17:38:01,252 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-08 17:38:01,253 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-03-08 17:38:01,253 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-08 17:38:01,253 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-08 17:38:01,253 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-08 17:38:01,255 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-08 17:38:01,820 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-03-08 17:38:01,820 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-03-08 17:38:01,820 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:01,820 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:01,820 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-08 17:38:02,072 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-03-08 17:38:02,072 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-08 17:38:02,072 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:38:02,072 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-08 17:38:02,072 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:38:02,073 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-03-08 17:38:02,073 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-08 17:38:02,073 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:38:02,073 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-08 17:38:02,073 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-08 17:38:03,075 INFO L124 PetriNetUnfolderBase]: 21248/32952 cut-off events. [2025-03-08 17:38:03,075 INFO L125 PetriNetUnfolderBase]: For 799422/801178 co-relation queries the response was YES. [2025-03-08 17:38:03,288 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-03-08 17:38:03,434 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 921 selfloop transitions, 66 changer transitions 4/1022 dead transitions. [2025-03-08 17:38:03,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1022 transitions, 26190 flow [2025-03-08 17:38:03,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:38:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:38:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2025-03-08 17:38:03,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2025-03-08 17:38:03,436 INFO L175 Difference]: Start difference. First operand has 180 places, 943 transitions, 22904 flow. Second operand 6 states and 118 transitions. [2025-03-08 17:38:03,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 1022 transitions, 26190 flow [2025-03-08 17:38:07,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 1022 transitions, 25590 flow, removed 300 selfloop flow, removed 2 redundant places. [2025-03-08 17:38:07,543 INFO L231 Difference]: Finished difference. Result has 182 places, 942 transitions, 22406 flow [2025-03-08 17:38:07,544 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-03-08 17:38:07,544 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 147 predicate places. [2025-03-08 17:38:07,544 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 942 transitions, 22406 flow [2025-03-08 17:38:07,544 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-03-08 17:38:07,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:07,545 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-03-08 17:38:07,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 17:38:07,545 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-03-08 17:38:07,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:07,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1349745912, now seen corresponding path program 5 times [2025-03-08 17:38:07,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:07,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514376333] [2025-03-08 17:38:07,545 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:38:07,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:07,549 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-08 17:38:07,553 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:38:07,553 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:38:07,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:07,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:07,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514376333] [2025-03-08 17:38:07,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514376333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:38:07,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391144629] [2025-03-08 17:38:07,642 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:38:07,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:38:07,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:38:07,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:38:07,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 17:38:07,679 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-08 17:38:07,694 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:38:07,695 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:38:07,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:07,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 17:38:07,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:38:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:07,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:38:07,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:07,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391144629] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:38:07,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:38:07,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-03-08 17:38:07,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758210321] [2025-03-08 17:38:07,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:38:07,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 17:38:07,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:07,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 17:38:07,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-08 17:38:07,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-08 17:38:07,979 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-03-08 17:38:07,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:07,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-08 17:38:07,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:29,005 INFO L124 PetriNetUnfolderBase]: 68676/102556 cut-off events. [2025-03-08 17:38:29,005 INFO L125 PetriNetUnfolderBase]: For 2491156/2494840 co-relation queries the response was YES. [2025-03-08 17:38:29,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913938 conditions, 102556 events. 68676/102556 cut-off events. For 2491156/2494840 co-relation queries the response was YES. Maximal size of possible extension queue 5287. Compared 826736 event pairs, 1205 based on Foata normal form. 2079/104468 useless extension candidates. Maximal degree in co-relation 910567. Up to 34738 conditions per place. [2025-03-08 17:38:30,466 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 2441 selfloop transitions, 4568 changer transitions 0/7025 dead transitions. [2025-03-08 17:38:30,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 7025 transitions, 177780 flow [2025-03-08 17:38:30,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-08 17:38:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2025-03-08 17:38:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 1432 transitions. [2025-03-08 17:38:30,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888157894736842 [2025-03-08 17:38:30,469 INFO L175 Difference]: Start difference. First operand has 182 places, 942 transitions, 22406 flow. Second operand 76 states and 1432 transitions. [2025-03-08 17:38:30,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 7025 transitions, 177780 flow