/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:36:49,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:36:49,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:36:49,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:36:49,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:36:49,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:36:49,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:36:49,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:36:49,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:36:49,302 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:36:49,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:36:49,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:36:49,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:36:49,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:36:49,302 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:36:49,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:36:49,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:36:49,302 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:36:49,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:36:49,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:36:49,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:36:49,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:36:49,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:36:49,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:36:49,303 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:36:49,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:36:49,303 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:36:49,303 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:36:49,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:36:49,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:36:49,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:36:49,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:36:49,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:36:49,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:36:49,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:36:49,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:36:49,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:36:49,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:36:49,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:36:49,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:36:49,304 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:36:49,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:36:49,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:36:49,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:36:49,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:36:49,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:36:49,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:36:49,304 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:36:49,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:36:49,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:36:49,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:36:49,533 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:36:49,535 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:36:49,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2025-04-14 01:36:50,837 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b717a5c50/cc5e8f2b99fa4bc69767cd0dc522efa1/FLAG33583d45d [2025-04-14 01:36:51,064 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:36:51,064 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2025-04-14 01:36:51,075 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b717a5c50/cc5e8f2b99fa4bc69767cd0dc522efa1/FLAG33583d45d [2025-04-14 01:36:51,837 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b717a5c50/cc5e8f2b99fa4bc69767cd0dc522efa1 [2025-04-14 01:36:51,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:36:51,840 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:36:51,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:36:51,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:36:51,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:36:51,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:36:51" (1/1) ... [2025-04-14 01:36:51,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5156ca4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:51, skipping insertion in model container [2025-04-14 01:36:51,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:36:51" (1/1) ... [2025-04-14 01:36:51,858 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:36:52,031 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c[3425,3438] [2025-04-14 01:36:52,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:36:52,045 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:36:52,074 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c[3425,3438] [2025-04-14 01:36:52,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:36:52,093 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:36:52,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:52 WrapperNode [2025-04-14 01:36:52,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:36:52,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:36:52,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:36:52,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:36:52,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:52" (1/1) ... [2025-04-14 01:36:52,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:52" (1/1) ... [2025-04-14 01:36:52,116 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-04-14 01:36:52,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:36:52,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:36:52,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:36:52,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:36:52,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:52" (1/1) ... [2025-04-14 01:36:52,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:52" (1/1) ... [2025-04-14 01:36:52,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:52" (1/1) ... [2025-04-14 01:36:52,139 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-04-14 01:36:52,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:52" (1/1) ... [2025-04-14 01:36:52,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:52" (1/1) ... [2025-04-14 01:36:52,144 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:52" (1/1) ... [2025-04-14 01:36:52,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:52" (1/1) ... [2025-04-14 01:36:52,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:52" (1/1) ... [2025-04-14 01:36:52,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:52" (1/1) ... [2025-04-14 01:36:52,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:36:52,148 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:36:52,148 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:36:52,148 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:36:52,149 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:52" (1/1) ... [2025-04-14 01:36:52,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:36:52,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:36:52,171 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-04-14 01:36:52,173 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-04-14 01:36:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:36:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:36:52,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:36:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:36:52,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:36:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:36:52,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:36:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 01:36:52,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 01:36:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:36:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:36:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:36:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:36:52,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:36:52,189 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:36:52,253 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:36:52,255 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:36:52,402 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:36:52,403 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:36:52,403 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:36:52,567 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:36:52,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:36:52 BoogieIcfgContainer [2025-04-14 01:36:52,568 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:36:52,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:36:52,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:36:52,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:36:52,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:36:51" (1/3) ... [2025-04-14 01:36:52,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135ede5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:36:52, skipping insertion in model container [2025-04-14 01:36:52,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:52" (2/3) ... [2025-04-14 01:36:52,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135ede5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:36:52, skipping insertion in model container [2025-04-14 01:36:52,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:36:52" (3/3) ... [2025-04-14 01:36:52,574 INFO L128 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2025-04-14 01:36:52,584 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:36:52,585 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-hard1.wvr.c that has 5 procedures, 40 locations, 39 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 01:36:52,585 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:36:52,632 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 01:36:52,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 114 flow [2025-04-14 01:36:52,681 INFO L116 PetriNetUnfolderBase]: 4/39 cut-off events. [2025-04-14 01:36:52,683 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 01:36:52,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 4/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-04-14 01:36:52,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 43 transitions, 114 flow [2025-04-14 01:36:52,690 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 100 flow [2025-04-14 01:36:52,699 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:36:52,706 INFO L340 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;@57df7770, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:36:52,707 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 01:36:52,717 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:36:52,718 INFO L116 PetriNetUnfolderBase]: 4/37 cut-off events. [2025-04-14 01:36:52,718 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 01:36:52,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:36:52,718 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, 1, 1, 1] [2025-04-14 01:36:52,719 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:36:52,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:36:52,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1870237690, now seen corresponding path program 1 times [2025-04-14 01:36:52,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:36:52,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151199082] [2025-04-14 01:36:52,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:36:52,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:36:52,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:36:52,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:36:52,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:36:52,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:36:53,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:36:53,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151199082] [2025-04-14 01:36:53,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151199082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:36:53,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:36:53,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:36:53,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360763059] [2025-04-14 01:36:53,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:36:53,125 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:36:53,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:36:53,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:36:53,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:36:53,145 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2025-04-14 01:36:53,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-04-14 01:36:53,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:36:53,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2025-04-14 01:36:53,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:53,572 INFO L116 PetriNetUnfolderBase]: 3331/4540 cut-off events. [2025-04-14 01:36:53,572 INFO L117 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2025-04-14 01:36:53,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9283 conditions, 4540 events. 3331/4540 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 20643 event pairs, 587 based on Foata normal form. 1/4474 useless extension candidates. Maximal degree in co-relation 8234. Up to 3534 conditions per place. [2025-04-14 01:36:53,624 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 47 selfloop transitions, 5 changer transitions 1/61 dead transitions. [2025-04-14 01:36:53,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 273 flow [2025-04-14 01:36:53,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:36:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:36:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-04-14 01:36:53,635 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2025-04-14 01:36:53,636 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 100 flow. Second operand 3 states and 90 transitions. [2025-04-14 01:36:53,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 273 flow [2025-04-14 01:36:53,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 243 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-14 01:36:53,648 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 117 flow [2025-04-14 01:36:53,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2025-04-14 01:36:53,654 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2025-04-14 01:36:53,654 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 117 flow [2025-04-14 01:36:53,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-04-14 01:36:53,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:36:53,654 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:36:53,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:36:53,654 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:36:53,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:36:53,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1011169544, now seen corresponding path program 1 times [2025-04-14 01:36:53,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:36:53,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134594729] [2025-04-14 01:36:53,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:36:53,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:36:53,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:36:53,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:36:53,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:36:53,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:36:54,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:36:54,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134594729] [2025-04-14 01:36:54,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134594729] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:36:54,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:36:54,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:36:54,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140208751] [2025-04-14 01:36:54,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:36:54,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:36:54,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:36:54,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:36:54,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:36:54,032 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-04-14 01:36:54,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-04-14 01:36:54,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:36:54,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-04-14 01:36:54,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:54,821 INFO L116 PetriNetUnfolderBase]: 7323/10061 cut-off events. [2025-04-14 01:36:54,821 INFO L117 PetriNetUnfolderBase]: For 2052/2052 co-relation queries the response was YES. [2025-04-14 01:36:54,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22905 conditions, 10061 events. 7323/10061 cut-off events. For 2052/2052 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 55149 event pairs, 1628 based on Foata normal form. 0/9514 useless extension candidates. Maximal degree in co-relation 6145. Up to 3843 conditions per place. [2025-04-14 01:36:54,870 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 120 selfloop transitions, 17 changer transitions 0/144 dead transitions. [2025-04-14 01:36:54,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 144 transitions, 689 flow [2025-04-14 01:36:54,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:36:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:36:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2025-04-14 01:36:54,872 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7209302325581395 [2025-04-14 01:36:54,872 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 117 flow. Second operand 6 states and 186 transitions. [2025-04-14 01:36:54,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 144 transitions, 689 flow [2025-04-14 01:36:54,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 144 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:36:54,874 INFO L231 Difference]: Finished difference. Result has 51 places, 58 transitions, 258 flow [2025-04-14 01:36:54,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=51, PETRI_TRANSITIONS=58} [2025-04-14 01:36:54,875 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2025-04-14 01:36:54,875 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 58 transitions, 258 flow [2025-04-14 01:36:54,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-04-14 01:36:54,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:36:54,876 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:36:54,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:36:54,876 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:36:54,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:36:54,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1252799416, now seen corresponding path program 2 times [2025-04-14 01:36:54,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:36:54,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951592203] [2025-04-14 01:36:54,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:36:54,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:36:54,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:36:54,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:36:54,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:36:54,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:36:55,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:36:55,156 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951592203] [2025-04-14 01:36:55,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951592203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:36:55,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:36:55,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:36:55,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072180074] [2025-04-14 01:36:55,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:36:55,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:36:55,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:36:55,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:36:55,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:36:55,162 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-04-14 01:36:55,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 58 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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-04-14 01:36:55,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:36:55,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-04-14 01:36:55,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:56,495 INFO L116 PetriNetUnfolderBase]: 15994/22227 cut-off events. [2025-04-14 01:36:56,495 INFO L117 PetriNetUnfolderBase]: For 23201/23201 co-relation queries the response was YES. [2025-04-14 01:36:56,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64431 conditions, 22227 events. 15994/22227 cut-off events. For 23201/23201 co-relation queries the response was YES. Maximal size of possible extension queue 1064. Compared 132247 event pairs, 1434 based on Foata normal form. 616/22785 useless extension candidates. Maximal degree in co-relation 33994. Up to 8335 conditions per place. [2025-04-14 01:36:56,639 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 198 selfloop transitions, 59 changer transitions 0/264 dead transitions. [2025-04-14 01:36:56,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 264 transitions, 1705 flow [2025-04-14 01:36:56,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:36:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:36:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 283 transitions. [2025-04-14 01:36:56,642 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7312661498708011 [2025-04-14 01:36:56,642 INFO L175 Difference]: Start difference. First operand has 51 places, 58 transitions, 258 flow. Second operand 9 states and 283 transitions. [2025-04-14 01:36:56,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 264 transitions, 1705 flow [2025-04-14 01:36:56,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 264 transitions, 1705 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:36:56,717 INFO L231 Difference]: Finished difference. Result has 66 places, 114 transitions, 864 flow [2025-04-14 01:36:56,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=864, PETRI_PLACES=66, PETRI_TRANSITIONS=114} [2025-04-14 01:36:56,718 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2025-04-14 01:36:56,718 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 114 transitions, 864 flow [2025-04-14 01:36:56,718 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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-04-14 01:36:56,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:36:56,718 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:36:56,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:36:56,718 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:36:56,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:36:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1527124936, now seen corresponding path program 3 times [2025-04-14 01:36:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:36:56,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990362068] [2025-04-14 01:36:56,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:36:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:36:56,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:36:56,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:36:56,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:36:56,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:36:57,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:36:57,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990362068] [2025-04-14 01:36:57,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990362068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:36:57,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:36:57,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:36:57,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942536202] [2025-04-14 01:36:57,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:36:57,102 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:36:57,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:36:57,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:36:57,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:36:57,123 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-04-14 01:36:57,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 114 transitions, 864 flow. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 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-04-14 01:36:57,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:36:57,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-04-14 01:36:57,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:59,550 INFO L116 PetriNetUnfolderBase]: 23417/33832 cut-off events. [2025-04-14 01:36:59,551 INFO L117 PetriNetUnfolderBase]: For 94939/94953 co-relation queries the response was YES. [2025-04-14 01:36:59,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124260 conditions, 33832 events. 23417/33832 cut-off events. For 94939/94953 co-relation queries the response was YES. Maximal size of possible extension queue 1676. Compared 228028 event pairs, 812 based on Foata normal form. 289/34047 useless extension candidates. Maximal degree in co-relation 69829. Up to 8178 conditions per place. [2025-04-14 01:36:59,791 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 354 selfloop transitions, 189 changer transitions 0/550 dead transitions. [2025-04-14 01:36:59,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 550 transitions, 4964 flow [2025-04-14 01:36:59,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:36:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:36:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 425 transitions. [2025-04-14 01:36:59,793 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6589147286821705 [2025-04-14 01:36:59,793 INFO L175 Difference]: Start difference. First operand has 66 places, 114 transitions, 864 flow. Second operand 15 states and 425 transitions. [2025-04-14 01:36:59,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 550 transitions, 4964 flow [2025-04-14 01:37:00,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 550 transitions, 4964 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:37:00,190 INFO L231 Difference]: Finished difference. Result has 93 places, 278 transitions, 3109 flow [2025-04-14 01:37:00,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3109, PETRI_PLACES=93, PETRI_TRANSITIONS=278} [2025-04-14 01:37:00,190 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 46 predicate places. [2025-04-14 01:37:00,190 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 278 transitions, 3109 flow [2025-04-14 01:37:00,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 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-04-14 01:37:00,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:00,191 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:00,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:37:00,191 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:37:00,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:00,191 INFO L85 PathProgramCache]: Analyzing trace with hash -433521460, now seen corresponding path program 1 times [2025-04-14 01:37:00,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:00,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157068794] [2025-04-14 01:37:00,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:37:00,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:00,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:37:00,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:37:00,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:37:00,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:37:00,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:00,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157068794] [2025-04-14 01:37:00,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157068794] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:37:00,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:37:00,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:37:00,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046245503] [2025-04-14 01:37:00,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:37:00,396 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:37:00,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:00,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:37:00,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:37:00,399 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-04-14 01:37:00,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 278 transitions, 3109 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-04-14 01:37:00,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:00,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-04-14 01:37:00,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:04,793 INFO L116 PetriNetUnfolderBase]: 38424/54846 cut-off events. [2025-04-14 01:37:04,793 INFO L117 PetriNetUnfolderBase]: For 322969/323566 co-relation queries the response was YES. [2025-04-14 01:37:05,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249901 conditions, 54846 events. 38424/54846 cut-off events. For 322969/323566 co-relation queries the response was YES. Maximal size of possible extension queue 2726. Compared 381725 event pairs, 3758 based on Foata normal form. 1391/55833 useless extension candidates. Maximal degree in co-relation 237261. Up to 24918 conditions per place. [2025-04-14 01:37:05,288 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 264 selfloop transitions, 420 changer transitions 0/692 dead transitions. [2025-04-14 01:37:05,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 692 transitions, 9055 flow [2025-04-14 01:37:05,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:37:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:37:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 244 transitions. [2025-04-14 01:37:05,290 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7093023255813954 [2025-04-14 01:37:05,290 INFO L175 Difference]: Start difference. First operand has 93 places, 278 transitions, 3109 flow. Second operand 8 states and 244 transitions. [2025-04-14 01:37:05,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 692 transitions, 9055 flow [2025-04-14 01:37:09,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 692 transitions, 9021 flow, removed 17 selfloop flow, removed 0 redundant places. [2025-04-14 01:37:09,179 INFO L231 Difference]: Finished difference. Result has 105 places, 532 transitions, 7780 flow [2025-04-14 01:37:09,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3089, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7780, PETRI_PLACES=105, PETRI_TRANSITIONS=532} [2025-04-14 01:37:09,179 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2025-04-14 01:37:09,180 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 532 transitions, 7780 flow [2025-04-14 01:37:09,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-04-14 01:37:09,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:09,180 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:09,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:37:09,180 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:37:09,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1890821550, now seen corresponding path program 4 times [2025-04-14 01:37:09,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:09,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455015644] [2025-04-14 01:37:09,184 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:37:09,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:09,189 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:37:09,196 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:37:09,197 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:37:09,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:37:09,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:09,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455015644] [2025-04-14 01:37:09,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455015644] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:09,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504135518] [2025-04-14 01:37:09,473 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:37:09,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:37:09,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:37:09,477 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-04-14 01:37:09,479 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-04-14 01:37:09,511 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:37:09,528 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:37:09,528 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:37:09,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:09,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:37:09,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:37:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:37:09,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:37:09,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504135518] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:37:09,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:37:09,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 14 [2025-04-14 01:37:09,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995574959] [2025-04-14 01:37:09,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:37:09,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:37:09,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:09,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:37:09,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:37:09,842 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-04-14 01:37:09,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 532 transitions, 7780 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-04-14 01:37:09,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:09,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-04-14 01:37:09,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:20,917 INFO L116 PetriNetUnfolderBase]: 77082/107579 cut-off events. [2025-04-14 01:37:20,918 INFO L117 PetriNetUnfolderBase]: For 926060/926479 co-relation queries the response was YES. [2025-04-14 01:37:21,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555360 conditions, 107579 events. 77082/107579 cut-off events. For 926060/926479 co-relation queries the response was YES. Maximal size of possible extension queue 4715. Compared 766720 event pairs, 3537 based on Foata normal form. 1984/109208 useless extension candidates. Maximal degree in co-relation 526821. Up to 26474 conditions per place. [2025-04-14 01:37:21,862 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 816 selfloop transitions, 503 changer transitions 0/1326 dead transitions. [2025-04-14 01:37:21,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 1326 transitions, 20735 flow [2025-04-14 01:37:21,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:37:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:37:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 326 transitions. [2025-04-14 01:37:21,863 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6892177589852009 [2025-04-14 01:37:21,863 INFO L175 Difference]: Start difference. First operand has 105 places, 532 transitions, 7780 flow. Second operand 11 states and 326 transitions. [2025-04-14 01:37:21,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 1326 transitions, 20735 flow [2025-04-14 01:37:35,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 1326 transitions, 20629 flow, removed 53 selfloop flow, removed 0 redundant places. [2025-04-14 01:37:35,668 INFO L231 Difference]: Finished difference. Result has 122 places, 837 transitions, 13486 flow [2025-04-14 01:37:35,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=7756, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13486, PETRI_PLACES=122, PETRI_TRANSITIONS=837} [2025-04-14 01:37:35,669 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 75 predicate places. [2025-04-14 01:37:35,669 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 837 transitions, 13486 flow [2025-04-14 01:37:35,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-04-14 01:37:35,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:37:35,669 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:37:35,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:37:35,869 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-14 01:37:35,870 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:37:35,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:37:35,871 INFO L85 PathProgramCache]: Analyzing trace with hash -340245802, now seen corresponding path program 5 times [2025-04-14 01:37:35,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:37:35,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026892741] [2025-04-14 01:37:35,871 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:37:35,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:37:35,876 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:37:35,881 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:37:35,881 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:37:35,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:37:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:37:36,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:37:36,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026892741] [2025-04-14 01:37:36,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026892741] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:37:36,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:37:36,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:37:36,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277149056] [2025-04-14 01:37:36,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:37:36,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:37:36,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:37:36,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:37:36,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:37:36,009 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-04-14 01:37:36,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 837 transitions, 13486 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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-04-14 01:37:36,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:37:36,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-04-14 01:37:36,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:37:43,736 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([313] L85-->L91: Formula: (or (and (< 0 v_~n2~0_115) (= v_~p2~0_115 (+ v_~p2~0_116 v_~m~0_109)) (= v_~n2~0_115 (+ v_~n2~0_114 1))) (and (= v_~n2~0_115 v_~n2~0_114) (= |v_thread3Thread1of1ForFork3_#t~post2_2| |v_thread3Thread1of1ForFork3_#t~post2_1|) (<= v_~n2~0_115 0) (= v_~p2~0_116 v_~p2~0_115))) InVars {~p2~0=v_~p2~0_116, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_115, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_1|} OutVars{~p2~0=v_~p2~0_115, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_114, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork3_#t~post2][1219], [Black: 103#(and (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 18#L65loopEntrytrue, Black: 79#(and (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 140#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 98#(<= ~n1~0 0), Black: 340#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 73#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 65#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), 133#true, Black: 75#(< 0 ~n2~0), Black: 336#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), 275#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 344#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 77#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 63#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 117#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 138#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 81#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), 39#L132-1true, Black: 61#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 342#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 115#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 57#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 113#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 111#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 93#(or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))), 59#true, 362#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 107#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 62#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 144#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (= thread4Thread1of1ForFork1_~cond~3 1)), 36#L47true, 71#true, Black: 142#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1)))), 97#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 105#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 137#(< 0 ~n2~0), Black: 334#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), 4#thread4EXITtrue, Black: 303#(or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 83#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 109#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 13#L91true, Black: 101#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 119#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 76#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1))]) [2025-04-14 01:37:43,737 INFO L286 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-04-14 01:37:43,737 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-14 01:37:43,737 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-14 01:37:43,737 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-14 01:37:45,660 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([313] L85-->L91: Formula: (or (and (< 0 v_~n2~0_115) (= v_~p2~0_115 (+ v_~p2~0_116 v_~m~0_109)) (= v_~n2~0_115 (+ v_~n2~0_114 1))) (and (= v_~n2~0_115 v_~n2~0_114) (= |v_thread3Thread1of1ForFork3_#t~post2_2| |v_thread3Thread1of1ForFork3_#t~post2_1|) (<= v_~n2~0_115 0) (= v_~p2~0_116 v_~p2~0_115))) InVars {~p2~0=v_~p2~0_116, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_115, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_1|} OutVars{~p2~0=v_~p2~0_115, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_114, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork3_#t~post2][1219], [Black: 103#(and (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 18#L65loopEntrytrue, Black: 79#(and (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 140#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 98#(<= ~n1~0 0), Black: 73#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 340#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), 133#true, Black: 65#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 75#(< 0 ~n2~0), Black: 336#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), 275#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 344#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 77#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 63#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 117#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 138#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 81#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 61#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 342#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 115#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 57#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 113#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 111#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 93#(or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))), 59#true, Black: 107#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 362#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 16#L133true, Black: 62#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 144#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (= thread4Thread1of1ForFork1_~cond~3 1)), 36#L47true, 71#true, Black: 142#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1)))), 97#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 105#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 137#(< 0 ~n2~0), Black: 334#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), 4#thread4EXITtrue, Black: 303#(or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 83#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 109#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 13#L91true, Black: 101#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 119#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 76#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1))]) [2025-04-14 01:37:45,661 INFO L286 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-04-14 01:37:45,661 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-04-14 01:37:45,661 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-04-14 01:37:45,661 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-04-14 01:37:45,711 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([313] L85-->L91: Formula: (or (and (< 0 v_~n2~0_115) (= v_~p2~0_115 (+ v_~p2~0_116 v_~m~0_109)) (= v_~n2~0_115 (+ v_~n2~0_114 1))) (and (= v_~n2~0_115 v_~n2~0_114) (= |v_thread3Thread1of1ForFork3_#t~post2_2| |v_thread3Thread1of1ForFork3_#t~post2_1|) (<= v_~n2~0_115 0) (= v_~p2~0_116 v_~p2~0_115))) InVars {~p2~0=v_~p2~0_116, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_115, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_1|} OutVars{~p2~0=v_~p2~0_115, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_114, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork3_#t~post2][1219], [Black: 103#(and (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 140#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 79#(and (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 73#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 98#(<= ~n1~0 0), Black: 340#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), 133#true, Black: 75#(< 0 ~n2~0), Black: 65#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 336#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), 275#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 344#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 77#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 63#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 117#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 138#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 81#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), 39#L132-1true, Black: 61#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 342#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 115#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 57#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 113#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 111#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 93#(or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))), 59#true, 362#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 107#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 62#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 144#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (= thread4Thread1of1ForFork1_~cond~3 1)), 71#true, Black: 142#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1)))), 36#L47true, 97#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 105#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 137#(< 0 ~n2~0), 27#thread2EXITtrue, Black: 334#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), 4#thread4EXITtrue, Black: 303#(or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 83#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 109#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 13#L91true, Black: 101#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 119#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 76#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1))]) [2025-04-14 01:37:45,711 INFO L286 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-04-14 01:37:45,711 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-04-14 01:37:45,711 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-04-14 01:37:45,711 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-04-14 01:37:45,712 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([313] L85-->L91: Formula: (or (and (< 0 v_~n2~0_115) (= v_~p2~0_115 (+ v_~p2~0_116 v_~m~0_109)) (= v_~n2~0_115 (+ v_~n2~0_114 1))) (and (= v_~n2~0_115 v_~n2~0_114) (= |v_thread3Thread1of1ForFork3_#t~post2_2| |v_thread3Thread1of1ForFork3_#t~post2_1|) (<= v_~n2~0_115 0) (= v_~p2~0_116 v_~p2~0_115))) InVars {~p2~0=v_~p2~0_116, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_115, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_1|} OutVars{~p2~0=v_~p2~0_115, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_114, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork3_#t~post2][1019], [Black: 103#(and (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 18#L65loopEntrytrue, Black: 79#(and (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 140#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 98#(<= ~n1~0 0), Black: 340#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 73#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 65#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), 133#true, Black: 75#(< 0 ~n2~0), Black: 336#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), 275#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 344#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 77#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 63#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 117#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 138#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 81#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), 39#L132-1true, Black: 61#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 342#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 115#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 57#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 113#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 111#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 93#(or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))), 37#L53true, 59#true, 362#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 107#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 62#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 144#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 142#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1)))), 71#true, 97#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 105#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 137#(< 0 ~n2~0), Black: 334#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), 4#thread4EXITtrue, Black: 303#(or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 83#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 109#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 13#L91true, Black: 101#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 119#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 76#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1))]) [2025-04-14 01:37:45,712 INFO L286 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-04-14 01:37:45,712 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-04-14 01:37:45,712 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-04-14 01:37:45,712 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-04-14 01:37:47,787 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([313] L85-->L91: Formula: (or (and (< 0 v_~n2~0_115) (= v_~p2~0_115 (+ v_~p2~0_116 v_~m~0_109)) (= v_~n2~0_115 (+ v_~n2~0_114 1))) (and (= v_~n2~0_115 v_~n2~0_114) (= |v_thread3Thread1of1ForFork3_#t~post2_2| |v_thread3Thread1of1ForFork3_#t~post2_1|) (<= v_~n2~0_115 0) (= v_~p2~0_116 v_~p2~0_115))) InVars {~p2~0=v_~p2~0_116, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_115, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_1|} OutVars{~p2~0=v_~p2~0_115, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_114, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork3_#t~post2][1219], [Black: 103#(and (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 79#(and (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 140#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 98#(<= ~n1~0 0), Black: 340#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 73#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 75#(< 0 ~n2~0), 133#true, Black: 65#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 336#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), 275#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 344#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 77#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 63#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 117#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 138#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 81#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 61#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 342#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 115#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 57#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 113#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 111#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 93#(or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))), 59#true, Black: 107#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 362#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 16#L133true, Black: 62#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 144#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 142#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1)))), 71#true, 36#L47true, 97#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 105#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 137#(< 0 ~n2~0), 27#thread2EXITtrue, Black: 334#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), 4#thread4EXITtrue, Black: 303#(or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 83#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 109#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 13#L91true, Black: 101#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 119#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 76#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1))]) [2025-04-14 01:37:47,787 INFO L286 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-04-14 01:37:47,787 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-14 01:37:47,787 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-14 01:37:47,787 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-14 01:37:47,788 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([313] L85-->L91: Formula: (or (and (< 0 v_~n2~0_115) (= v_~p2~0_115 (+ v_~p2~0_116 v_~m~0_109)) (= v_~n2~0_115 (+ v_~n2~0_114 1))) (and (= v_~n2~0_115 v_~n2~0_114) (= |v_thread3Thread1of1ForFork3_#t~post2_2| |v_thread3Thread1of1ForFork3_#t~post2_1|) (<= v_~n2~0_115 0) (= v_~p2~0_116 v_~p2~0_115))) InVars {~p2~0=v_~p2~0_116, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_115, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_1|} OutVars{~p2~0=v_~p2~0_115, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_114, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork3_#t~post2][1019], [Black: 103#(and (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 18#L65loopEntrytrue, Black: 79#(and (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 140#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 98#(<= ~n1~0 0), Black: 73#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 340#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 65#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 75#(< 0 ~n2~0), 133#true, Black: 336#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 344#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), 275#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 77#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 63#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 117#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 138#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 81#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 61#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 342#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 115#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 57#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 113#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 111#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 93#(or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))), 37#L53true, 59#true, Black: 107#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 362#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 16#L133true, Black: 62#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 144#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 142#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1)))), 71#true, 97#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 105#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 137#(< 0 ~n2~0), Black: 334#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), 4#thread4EXITtrue, Black: 303#(or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 83#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 109#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 13#L91true, Black: 101#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 119#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 76#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1))]) [2025-04-14 01:37:47,788 INFO L286 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-04-14 01:37:47,788 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-14 01:37:47,788 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-14 01:37:47,788 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-14 01:37:47,830 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([313] L85-->L91: Formula: (or (and (< 0 v_~n2~0_115) (= v_~p2~0_115 (+ v_~p2~0_116 v_~m~0_109)) (= v_~n2~0_115 (+ v_~n2~0_114 1))) (and (= v_~n2~0_115 v_~n2~0_114) (= |v_thread3Thread1of1ForFork3_#t~post2_2| |v_thread3Thread1of1ForFork3_#t~post2_1|) (<= v_~n2~0_115 0) (= v_~p2~0_116 v_~p2~0_115))) InVars {~p2~0=v_~p2~0_116, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_115, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_1|} OutVars{~p2~0=v_~p2~0_115, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_114, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork3_#t~post2][1019], [Black: 103#(and (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 140#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 79#(and (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 98#(<= ~n1~0 0), Black: 73#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 340#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 75#(< 0 ~n2~0), Black: 65#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), 133#true, Black: 336#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 344#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), 275#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 77#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 63#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 117#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 138#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 81#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), 39#L132-1true, Black: 61#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 342#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 115#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 57#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 113#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 111#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 93#(or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))), 37#L53true, 59#true, Black: 107#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 362#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 62#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 144#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (= thread4Thread1of1ForFork1_~cond~3 1)), 71#true, Black: 142#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1)))), 97#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 105#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 137#(< 0 ~n2~0), 27#thread2EXITtrue, Black: 334#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), 4#thread4EXITtrue, Black: 303#(or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 83#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 109#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 13#L91true, Black: 101#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 119#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 76#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1))]) [2025-04-14 01:37:47,831 INFO L286 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-04-14 01:37:47,831 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-14 01:37:47,831 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-14 01:37:47,831 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-14 01:37:49,310 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([313] L85-->L91: Formula: (or (and (< 0 v_~n2~0_115) (= v_~p2~0_115 (+ v_~p2~0_116 v_~m~0_109)) (= v_~n2~0_115 (+ v_~n2~0_114 1))) (and (= v_~n2~0_115 v_~n2~0_114) (= |v_thread3Thread1of1ForFork3_#t~post2_2| |v_thread3Thread1of1ForFork3_#t~post2_1|) (<= v_~n2~0_115 0) (= v_~p2~0_116 v_~p2~0_115))) InVars {~p2~0=v_~p2~0_116, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_115, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_1|} OutVars{~p2~0=v_~p2~0_115, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_114, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork3_#t~post2][1019], [Black: 103#(and (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 79#(and (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 140#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 98#(<= ~n1~0 0), Black: 340#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 73#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 75#(< 0 ~n2~0), 133#true, Black: 65#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 336#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), 275#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 344#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 77#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 63#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 117#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 138#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 81#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 61#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 342#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 115#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 57#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 113#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 111#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 93#(or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))), 37#L53true, 59#true, Black: 107#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 362#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 16#L133true, Black: 62#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 144#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (= thread4Thread1of1ForFork1_~cond~3 1)), 71#true, Black: 142#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1)))), 97#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 105#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 137#(< 0 ~n2~0), 27#thread2EXITtrue, Black: 334#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), 4#thread4EXITtrue, Black: 303#(or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 83#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 109#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 13#L91true, Black: 101#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 119#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 76#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1))]) [2025-04-14 01:37:49,311 INFO L286 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-04-14 01:37:49,311 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-14 01:37:49,311 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-14 01:37:49,311 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-14 01:37:53,325 INFO L116 PetriNetUnfolderBase]: 91755/135053 cut-off events. [2025-04-14 01:37:53,325 INFO L117 PetriNetUnfolderBase]: For 1551423/1552457 co-relation queries the response was YES. [2025-04-14 01:37:54,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789212 conditions, 135053 events. 91755/135053 cut-off events. For 1551423/1552457 co-relation queries the response was YES. Maximal size of possible extension queue 6530. Compared 1101556 event pairs, 10523 based on Foata normal form. 850/134860 useless extension candidates. Maximal degree in co-relation 745618. Up to 41782 conditions per place. [2025-04-14 01:37:55,054 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 1167 selfloop transitions, 510 changer transitions 0/1693 dead transitions. [2025-04-14 01:37:55,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 1693 transitions, 29068 flow [2025-04-14 01:37:55,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:37:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:37:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 255 transitions. [2025-04-14 01:37:55,056 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6589147286821705 [2025-04-14 01:37:55,056 INFO L175 Difference]: Start difference. First operand has 122 places, 837 transitions, 13486 flow. Second operand 9 states and 255 transitions. [2025-04-14 01:37:55,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 1693 transitions, 29068 flow [2025-04-14 01:38:43,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 1693 transitions, 29022 flow, removed 23 selfloop flow, removed 0 redundant places. [2025-04-14 01:38:43,578 INFO L231 Difference]: Finished difference. Result has 137 places, 937 transitions, 17288 flow [2025-04-14 01:38:43,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=13466, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=422, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=17288, PETRI_PLACES=137, PETRI_TRANSITIONS=937} [2025-04-14 01:38:43,581 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 90 predicate places. [2025-04-14 01:38:43,581 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 937 transitions, 17288 flow [2025-04-14 01:38:43,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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-04-14 01:38:43,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:38:43,581 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:38:43,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:38:43,581 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:38:43,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:38:43,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1407562026, now seen corresponding path program 6 times [2025-04-14 01:38:43,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:38:43,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999434942] [2025-04-14 01:38:43,582 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:38:43,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:38:43,591 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:38:43,600 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:38:43,600 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:38:43,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:38:43,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:38:43,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999434942] [2025-04-14 01:38:43,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999434942] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:38:43,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817591680] [2025-04-14 01:38:43,745 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:38:43,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:38:43,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:38:43,747 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-04-14 01:38:43,749 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-04-14 01:38:43,781 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:38:43,796 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:38:43,796 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:38:43,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:43,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 01:38:43,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:38:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:38:43,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:38:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:38:44,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817591680] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:38:44,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:38:44,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2025-04-14 01:38:44,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078013567] [2025-04-14 01:38:44,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:38:44,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:38:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:38:44,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:38:44,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:38:44,192 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-04-14 01:38:44,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 937 transitions, 17288 flow. Second operand has 17 states, 17 states have (on average 13.882352941176471) internal successors, (236), 17 states have internal predecessors, (236), 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-04-14 01:38:44,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:38:44,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-04-14 01:38:44,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:39:20,492 INFO L116 PetriNetUnfolderBase]: 174984/247681 cut-off events. [2025-04-14 01:39:20,493 INFO L117 PetriNetUnfolderBase]: For 2926574/2926902 co-relation queries the response was YES. [2025-04-14 01:39:22,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468041 conditions, 247681 events. 174984/247681 cut-off events. For 2926574/2926902 co-relation queries the response was YES. Maximal size of possible extension queue 9991. Compared 1960220 event pairs, 10608 based on Foata normal form. 2063/249151 useless extension candidates. Maximal degree in co-relation 1339326. Up to 57384 conditions per place. [2025-04-14 01:39:23,271 INFO L140 encePairwiseOnDemand]: 28/43 looper letters, 1134 selfloop transitions, 1467 changer transitions 5/2613 dead transitions. [2025-04-14 01:39:23,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 2613 transitions, 46622 flow [2025-04-14 01:39:23,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 01:39:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-14 01:39:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 835 transitions. [2025-04-14 01:39:23,274 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6696070569366479 [2025-04-14 01:39:23,274 INFO L175 Difference]: Start difference. First operand has 137 places, 937 transitions, 17288 flow. Second operand 29 states and 835 transitions. [2025-04-14 01:39:23,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 2613 transitions, 46622 flow [2025-04-14 01:43:43,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 2613 transitions, 46526 flow, removed 48 selfloop flow, removed 0 redundant places. [2025-04-14 01:43:43,235 INFO L231 Difference]: Finished difference. Result has 187 places, 1779 transitions, 38611 flow [2025-04-14 01:43:43,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=16700, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=680, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=38611, PETRI_PLACES=187, PETRI_TRANSITIONS=1779} [2025-04-14 01:43:43,237 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 140 predicate places. [2025-04-14 01:43:43,237 INFO L485 AbstractCegarLoop]: Abstraction has has 187 places, 1779 transitions, 38611 flow [2025-04-14 01:43:43,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.882352941176471) internal successors, (236), 17 states have internal predecessors, (236), 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-04-14 01:43:43,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:43:43,237 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:43:43,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 01:43:43,437 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-14 01:43:43,438 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:43:43,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:43:43,439 INFO L85 PathProgramCache]: Analyzing trace with hash -397162984, now seen corresponding path program 2 times [2025-04-14 01:43:43,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:43:43,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105349890] [2025-04-14 01:43:43,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:43:43,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:43:43,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:43:43,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:43:43,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:43:43,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:43:43,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:43:43,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105349890] [2025-04-14 01:43:43,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105349890] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:43:43,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:43:43,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:43:43,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105618415] [2025-04-14 01:43:43,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:43:43,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:43:43,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:43:43,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:43:43,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:43:43,904 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-04-14 01:43:43,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1779 transitions, 38611 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:43:43,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:43:43,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-04-14 01:43:43,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:03,550 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([313] L85-->L91: Formula: (or (and (< 0 v_~n2~0_115) (= v_~p2~0_115 (+ v_~p2~0_116 v_~m~0_109)) (= v_~n2~0_115 (+ v_~n2~0_114 1))) (and (= v_~n2~0_115 v_~n2~0_114) (= |v_thread3Thread1of1ForFork3_#t~post2_2| |v_thread3Thread1of1ForFork3_#t~post2_1|) (<= v_~n2~0_115 0) (= v_~p2~0_116 v_~p2~0_115))) InVars {~p2~0=v_~p2~0_116, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_115, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_1|} OutVars{~p2~0=v_~p2~0_115, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_114, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork3_#t~post2][220], [Black: 580#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 103#(and (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 598#(and (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 73#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 65#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 75#(< 0 ~n2~0), 133#true, Black: 354#(<= ~n1~0 ~n2~0), Black: 362#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 138#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 117#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 81#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 574#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 590#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 568#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork2_~cond~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 57#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 113#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 356#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork1_~cond~3) (<= (div thread4Thread1of1ForFork1_~cond~3 256) 0))), Black: 93#(or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))), Black: 578#(and (or (< 0 thread3Thread1of1ForFork3_~cond~2) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 564#(and (= ~n2~0 ~n1~0) (or (= thread1Thread1of1ForFork2_~cond~0 1) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0))) (or (and (<= ~n1~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n1~0) (= thread3Thread1of1ForFork3_~cond~2 1))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< thread1Thread1of1ForFork2_~cond~0 1) (< 0 ~n2~0))), 16#L133true, Black: 144#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (= thread4Thread1of1ForFork1_~cond~3 1)), 352#true, 43#thread2ENTRYtrue, Black: 572#(and (or (< 0 thread3Thread1of1ForFork3_~cond~2) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 97#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 105#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 137#(< 0 ~n2~0), Black: 334#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 570#(and (<= ~n1~0 ~n2~0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 588#(and (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 303#(or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 83#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 372#true, Black: 527#(or (and (<= ~n1~0 0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 109#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 360#(and (<= ~n1~0 ~n2~0) (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork1_~cond~3) (<= (div thread4Thread1of1ForFork1_~cond~3 256) 0)))), 531#(or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 76#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 586#(and (or (< ~n2~0 1) (= thread3Thread1of1ForFork3_~cond~2 1)) (or (< 0 ~n1~0) (= thread3Thread1of1ForFork3_~cond~2 0)) (or (= thread1Thread1of1ForFork2_~cond~0 1) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0) (or (< thread1Thread1of1ForFork2_~cond~0 1) (< 0 ~n2~0))), Black: 364#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~n1~0 ~n2~0)), Black: 79#(and (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 140#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 340#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 98#(<= ~n1~0 0), Black: 582#(and (or (< ~n2~0 1) (= thread3Thread1of1ForFork3_~cond~2 1)) (or (< 0 ~n1~0) (= thread3Thread1of1ForFork3_~cond~2 0)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 336#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), 275#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 344#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 77#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 374#(<= ~n1~0 ~n2~0), Black: 63#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 592#(and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), 61#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 523#(or (and (<= ~n1~0 0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 115#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 342#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 584#(and (or (< 0 thread3Thread1of1ForFork3_~cond~2) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~n1~0 ~n2~0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 59#true, Black: 594#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 111#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 576#(and (<= ~n1~0 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 357#(<= ~n1~0 0), Black: 107#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 62#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), 71#true, Black: 142#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1)))), 34#L46loopEntrytrue, Black: 381#(and (= ~n2~0 ~n1~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), 35#L103loopEntrytrue, 621#true, 13#L91true, Black: 358#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 101#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 119#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2025-04-14 01:44:03,551 INFO L286 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-04-14 01:44:03,551 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-14 01:44:03,551 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-14 01:44:03,551 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-14 01:44:03,556 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([300] L46loopEntry-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (= (mod v_thread1Thread1of1ForFork2_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_5} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_5, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset][176], [Black: 580#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 103#(and (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 523#(or (and (<= ~n1~0 0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 598#(and (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 73#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 65#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 75#(< 0 ~n2~0), 133#true, Black: 354#(<= ~n1~0 ~n2~0), Black: 362#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 138#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 117#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 81#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 574#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 590#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 61#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 568#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork2_~cond~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= thread3Thread1of1ForFork3_~cond~2 1)), 21#thread1EXITtrue, Black: 57#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 113#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 356#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork1_~cond~3) (<= (div thread4Thread1of1ForFork1_~cond~3 256) 0))), Black: 93#(or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))), Black: 578#(and (or (< 0 thread3Thread1of1ForFork3_~cond~2) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 564#(and (= ~n2~0 ~n1~0) (or (= thread1Thread1of1ForFork2_~cond~0 1) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0))) (or (and (<= ~n1~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n1~0) (= thread3Thread1of1ForFork3_~cond~2 1))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< thread1Thread1of1ForFork2_~cond~0 1) (< 0 ~n2~0))), 16#L133true, Black: 144#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (= thread4Thread1of1ForFork1_~cond~3 1)), 352#true, 43#thread2ENTRYtrue, Black: 572#(and (or (< 0 thread3Thread1of1ForFork3_~cond~2) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 97#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 105#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 137#(< 0 ~n2~0), Black: 334#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 570#(and (<= ~n1~0 ~n2~0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 588#(and (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 303#(or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 83#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 372#true, Black: 527#(or (and (<= ~n1~0 0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 109#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 360#(and (<= ~n1~0 ~n2~0) (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork1_~cond~3) (<= (div thread4Thread1of1ForFork1_~cond~3 256) 0)))), Black: 76#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 586#(and (or (< ~n2~0 1) (= thread3Thread1of1ForFork3_~cond~2 1)) (or (< 0 ~n1~0) (= thread3Thread1of1ForFork3_~cond~2 0)) (or (= thread1Thread1of1ForFork2_~cond~0 1) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0) (or (< thread1Thread1of1ForFork2_~cond~0 1) (< 0 ~n2~0))), Black: 275#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 364#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~n1~0 ~n2~0)), Black: 79#(and (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 140#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), 63#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 340#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 98#(<= ~n1~0 0), Black: 582#(and (or (< ~n2~0 1) (= thread3Thread1of1ForFork3_~cond~2 1)) (or (< 0 ~n1~0) (= thread3Thread1of1ForFork3_~cond~2 0)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 531#(or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 336#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 344#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 77#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 374#(<= ~n1~0 ~n2~0), Black: 592#(and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 115#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), 22#L85true, Black: 584#(and (or (< 0 thread3Thread1of1ForFork3_~cond~2) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~n1~0 ~n2~0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 59#true, Black: 594#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 111#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 576#(and (<= ~n1~0 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 357#(<= ~n1~0 0), Black: 107#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 62#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), 71#true, Black: 142#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1)))), Black: 381#(and (= ~n2~0 ~n1~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), 35#L103loopEntrytrue, 621#true, Black: 358#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 101#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 119#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), 342#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256)))]) [2025-04-14 01:44:03,556 INFO L286 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-04-14 01:44:03,556 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-14 01:44:03,556 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-14 01:44:03,556 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-14 01:44:03,587 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([319] L104-->L110: Formula: (or (and (= v_~n2~0_107 v_~n2~0_106) (<= v_~n2~0_107 1) (= v_~p2~0_108 v_~p2~0_107)) (and (= (+ 2 v_~n2~0_106) v_~n2~0_107) (= v_~p2~0_107 (+ (* 2 v_~m~0_101) v_~p2~0_108)) (< 1 v_~n2~0_107))) InVars {~n2~0=v_~n2~0_107, ~p2~0=v_~p2~0_108, ~m~0=v_~m~0_101} OutVars{~n2~0=v_~n2~0_106, ~p2~0=v_~p2~0_107, ~m~0=v_~m~0_101} AuxVars[] AssignedVars[~n2~0, ~p2~0][768], [Black: 580#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 103#(and (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 598#(and (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 73#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 65#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 75#(< 0 ~n2~0), 133#true, Black: 354#(<= ~n1~0 ~n2~0), Black: 362#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 117#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 138#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 574#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 81#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 590#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 568#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork2_~cond~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 57#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 113#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 356#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork1_~cond~3) (<= (div thread4Thread1of1ForFork1_~cond~3 256) 0))), Black: 93#(or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))), Black: 578#(and (or (< 0 thread3Thread1of1ForFork3_~cond~2) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 564#(and (= ~n2~0 ~n1~0) (or (= thread1Thread1of1ForFork2_~cond~0 1) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0))) (or (and (<= ~n1~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n1~0) (= thread3Thread1of1ForFork3_~cond~2 1))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< thread1Thread1of1ForFork2_~cond~0 1) (< 0 ~n2~0))), 16#L133true, Black: 144#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (= thread4Thread1of1ForFork1_~cond~3 1)), 352#true, 43#thread2ENTRYtrue, Black: 572#(and (or (< 0 thread3Thread1of1ForFork3_~cond~2) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 97#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 105#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 137#(< 0 ~n2~0), Black: 334#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), Black: 570#(and (<= ~n1~0 ~n2~0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 588#(and (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 303#(or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 83#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 372#true, Black: 109#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 527#(or (and (<= ~n1~0 0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), 11#L110true, Black: 360#(and (<= ~n1~0 ~n2~0) (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork1_~cond~3) (<= (div thread4Thread1of1ForFork1_~cond~3 256) 0)))), 531#(or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 76#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 586#(and (or (< ~n2~0 1) (= thread3Thread1of1ForFork3_~cond~2 1)) (or (< 0 ~n1~0) (= thread3Thread1of1ForFork3_~cond~2 0)) (or (= thread1Thread1of1ForFork2_~cond~0 1) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0) (or (< thread1Thread1of1ForFork2_~cond~0 1) (< 0 ~n2~0))), Black: 364#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~n1~0 ~n2~0)), Black: 140#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 79#(and (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 98#(<= ~n1~0 0), Black: 340#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 582#(and (or (< ~n2~0 1) (= thread3Thread1of1ForFork3_~cond~2 1)) (or (< 0 ~n1~0) (= thread3Thread1of1ForFork3_~cond~2 0)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 336#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), 275#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 344#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 77#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 374#(<= ~n1~0 ~n2~0), Black: 63#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 592#(and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), 61#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 523#(or (and (<= ~n1~0 0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 115#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 342#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), 22#L85true, Black: 584#(and (or (< 0 thread3Thread1of1ForFork3_~cond~2) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~n1~0 ~n2~0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 59#true, Black: 594#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 111#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 357#(<= ~n1~0 0), Black: 576#(and (<= ~n1~0 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 107#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 62#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 142#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1)))), 71#true, 34#L46loopEntrytrue, Black: 381#(and (= ~n2~0 ~n1~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), 621#true, Black: 101#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 358#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 119#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2025-04-14 01:44:03,588 INFO L286 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-04-14 01:44:03,588 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-04-14 01:44:03,588 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-04-14 01:44:03,588 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-04-14 01:44:10,166 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([313] L85-->L91: Formula: (or (and (< 0 v_~n2~0_115) (= v_~p2~0_115 (+ v_~p2~0_116 v_~m~0_109)) (= v_~n2~0_115 (+ v_~n2~0_114 1))) (and (= v_~n2~0_115 v_~n2~0_114) (= |v_thread3Thread1of1ForFork3_#t~post2_2| |v_thread3Thread1of1ForFork3_#t~post2_1|) (<= v_~n2~0_115 0) (= v_~p2~0_116 v_~p2~0_115))) InVars {~p2~0=v_~p2~0_116, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_115, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_1|} OutVars{~p2~0=v_~p2~0_115, ~m~0=v_~m~0_109, ~n2~0=v_~n2~0_114, thread3Thread1of1ForFork3_#t~post2=|v_thread3Thread1of1ForFork3_#t~post2_2|} AuxVars[] AssignedVars[~n2~0, ~p2~0, thread3Thread1of1ForFork3_#t~post2][220], [Black: 580#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 103#(and (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 598#(and (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 73#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 65#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 75#(< 0 ~n2~0), 133#true, Black: 354#(<= ~n1~0 ~n2~0), Black: 362#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 138#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 117#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 81#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 574#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 590#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 568#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork2_~cond~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 57#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 113#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 356#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork1_~cond~3) (<= (div thread4Thread1of1ForFork1_~cond~3 256) 0))), Black: 93#(or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))), Black: 578#(and (or (< 0 thread3Thread1of1ForFork3_~cond~2) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 564#(and (= ~n2~0 ~n1~0) (or (= thread1Thread1of1ForFork2_~cond~0 1) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0))) (or (and (<= ~n1~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n1~0) (= thread3Thread1of1ForFork3_~cond~2 1))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< thread1Thread1of1ForFork2_~cond~0 1) (< 0 ~n2~0))), 16#L133true, Black: 144#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (= thread4Thread1of1ForFork1_~cond~3 1)), 352#true, 43#thread2ENTRYtrue, Black: 572#(and (or (< 0 thread3Thread1of1ForFork3_~cond~2) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 97#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 105#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 137#(< 0 ~n2~0), Black: 334#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), 4#thread4EXITtrue, Black: 570#(and (<= ~n1~0 ~n2~0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 588#(and (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 303#(or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 83#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 372#true, Black: 527#(or (and (<= ~n1~0 0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 109#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 360#(and (<= ~n1~0 ~n2~0) (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork1_~cond~3) (<= (div thread4Thread1of1ForFork1_~cond~3 256) 0)))), 531#(or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 76#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 586#(and (or (< ~n2~0 1) (= thread3Thread1of1ForFork3_~cond~2 1)) (or (< 0 ~n1~0) (= thread3Thread1of1ForFork3_~cond~2 0)) (or (= thread1Thread1of1ForFork2_~cond~0 1) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0) (or (< thread1Thread1of1ForFork2_~cond~0 1) (< 0 ~n2~0))), Black: 364#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~n1~0 ~n2~0)), Black: 79#(and (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 140#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 340#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 98#(<= ~n1~0 0), Black: 582#(and (or (< ~n2~0 1) (= thread3Thread1of1ForFork3_~cond~2 1)) (or (< 0 ~n1~0) (= thread3Thread1of1ForFork3_~cond~2 0)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 336#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), 275#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 344#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 77#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 374#(<= ~n1~0 ~n2~0), Black: 63#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 592#(and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), 61#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 523#(or (and (<= ~n1~0 0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 115#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 342#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 584#(and (or (< 0 thread3Thread1of1ForFork3_~cond~2) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~n1~0 ~n2~0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 59#true, Black: 594#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 111#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 576#(and (<= ~n1~0 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 357#(<= ~n1~0 0), Black: 107#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 62#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), 71#true, Black: 142#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1)))), 34#L46loopEntrytrue, Black: 381#(and (= ~n2~0 ~n1~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), 621#true, 13#L91true, Black: 358#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 101#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 119#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))]) [2025-04-14 01:44:10,166 INFO L286 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-04-14 01:44:10,166 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-04-14 01:44:10,167 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-04-14 01:44:10,167 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-04-14 01:44:10,167 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([300] L46loopEntry-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res.offset_1| 0) (= (mod v_thread1Thread1of1ForFork2_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork2_#res.base_1| 0)) InVars {thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_5} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_5, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_1|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset][176], [Black: 580#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 103#(and (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 523#(or (and (<= ~n1~0 0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 598#(and (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 73#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 65#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 75#(< 0 ~n2~0), 133#true, Black: 354#(<= ~n1~0 ~n2~0), Black: 362#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 138#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork1_~cond~3 1)), Black: 117#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 81#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 574#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 590#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 61#(or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 568#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= thread1Thread1of1ForFork2_~cond~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= thread3Thread1of1ForFork3_~cond~2 1)), 21#thread1EXITtrue, Black: 57#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 113#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 356#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork1_~cond~3) (<= (div thread4Thread1of1ForFork1_~cond~3 256) 0))), Black: 93#(or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))), Black: 578#(and (or (< 0 thread3Thread1of1ForFork3_~cond~2) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 564#(and (= ~n2~0 ~n1~0) (or (= thread1Thread1of1ForFork2_~cond~0 1) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0))) (or (and (<= ~n1~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n1~0) (= thread3Thread1of1ForFork3_~cond~2 1))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (or (< thread1Thread1of1ForFork2_~cond~0 1) (< 0 ~n2~0))), 16#L133true, Black: 144#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (= thread4Thread1of1ForFork1_~cond~3 1)), 352#true, 43#thread2ENTRYtrue, Black: 572#(and (or (< 0 thread3Thread1of1ForFork3_~cond~2) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (<= ~n1~0 ~n2~0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), 97#(or (and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)) (< ~n1~0 1)), Black: 105#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0)) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 137#(< 0 ~n2~0), Black: 334#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1))), 4#thread4EXITtrue, Black: 570#(and (<= ~n1~0 ~n2~0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 588#(and (or (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 303#(or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 83#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 372#true, Black: 527#(or (and (<= ~n1~0 0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 109#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 360#(and (<= ~n1~0 ~n2~0) (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork1_~cond~3) (<= (div thread4Thread1of1ForFork1_~cond~3 256) 0)))), Black: 76#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 586#(and (or (< ~n2~0 1) (= thread3Thread1of1ForFork3_~cond~2 1)) (or (< 0 ~n1~0) (= thread3Thread1of1ForFork3_~cond~2 0)) (or (= thread1Thread1of1ForFork2_~cond~0 1) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0))) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0) (or (< thread1Thread1of1ForFork2_~cond~0 1) (< 0 ~n2~0))), Black: 275#(< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)), Black: 364#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~n1~0 ~n2~0)), Black: 79#(and (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 140#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), 63#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 340#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 98#(<= ~n1~0 0), Black: 582#(and (or (< ~n2~0 1) (= thread3Thread1of1ForFork3_~cond~2 1)) (or (< 0 ~n1~0) (= thread3Thread1of1ForFork3_~cond~2 0)) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0)), Black: 531#(or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256))), Black: 336#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 ~n2~0) (< ~n1~0 1)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 344#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 77#(and (<= (div thread3Thread1of1ForFork3_~cond~2 256) 0) (<= 1 thread3Thread1of1ForFork3_~cond~2)), Black: 374#(<= ~n1~0 ~n2~0), Black: 592#(and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (<= ~n1~0 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)), Black: 115#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), 22#L85true, Black: 584#(and (or (< 0 thread3Thread1of1ForFork3_~cond~2) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= ~n1~0 ~n2~0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 59#true, Black: 594#(and (or (< 0 ~n2~0) (< ~n1~0 1)) (or (< ~n1~0 1) (< 0 (mod thread3Thread1of1ForFork3_~cond~2 256)))), Black: 111#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 576#(and (<= ~n1~0 ~n2~0) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 357#(<= ~n1~0 0), Black: 107#(and (<= ~n1~0 0) (or (and (<= ~n2~0 0) (= thread3Thread1of1ForFork3_~cond~2 0)) (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork3_~cond~2 1)))), Black: 62#(and (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1))) (or (and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork2_~cond~0 1)))), 71#true, Black: 142#(and (<= 1 ~n2~0) (or (and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 1)))), Black: 381#(and (= ~n2~0 ~n1~0) (= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))), 621#true, Black: 358#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~cond~0 0)), Black: 101#(and (or (not (= thread2Thread1of1ForFork0_~cond~1 0)) (< ~n1~0 1)) (or (< ~n1~0 1) (< ~n1~0 (+ ~n2~0 1))) (or (< 0 ~n1~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 119#(and (<= 0 thread1Thread1of1ForFork2_~cond~0) (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), 342#(and (or (< 0 ~n2~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= 1 (mod thread3Thread1of1ForFork3_~cond~2 256)))]) [2025-04-14 01:44:10,167 INFO L286 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-04-14 01:44:10,167 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-04-14 01:44:10,167 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-04-14 01:44:10,167 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event