./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-hard1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/test-hard1.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:49:23,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:49:23,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:49:23,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:49:23,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:49:23,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:49:23,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:49:23,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:49:23,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:49:23,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:49:23,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:49:23,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:49:23,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:49:23,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:49:23,791 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:49:23,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:49:23,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:49:23,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:49:23,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:49:23,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:49:23,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:49:23,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:49:23,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:49:23,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:49:23,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:49:23,793 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:49:23,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:49:23,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:49:23,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:49:23,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:49:23,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:49:23,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:49:23,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:49:23,793 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34f393fd72a97393a0a39d407b9330aa7c1c7e210ad76310ea88c9427f882106 [2025-01-09 16:49:23,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:49:24,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:49:24,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:49:24,008 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:49:24,008 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:49:24,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-hard1.wvr.c [2025-01-09 16:49:25,118 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a82820303/16c81ef1e72847688d4267c9a9259e3e/FLAG397b50cbd [2025-01-09 16:49:25,354 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:49:25,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/test-hard1.wvr.c [2025-01-09 16:49:25,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a82820303/16c81ef1e72847688d4267c9a9259e3e/FLAG397b50cbd [2025-01-09 16:49:25,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a82820303/16c81ef1e72847688d4267c9a9259e3e [2025-01-09 16:49:25,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:49:25,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:49:25,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:49:25,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:49:25,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:49:25,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:49:25" (1/1) ... [2025-01-09 16:49:25,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6f894b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25, skipping insertion in model container [2025-01-09 16:49:25,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:49:25" (1/1) ... [2025-01-09 16:49:25,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:49:25,832 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/test-hard1.wvr.c[3425,3438] [2025-01-09 16:49:25,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:49:25,843 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:49:25,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/test-hard1.wvr.c[3425,3438] [2025-01-09 16:49:25,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:49:25,873 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:49:25,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25 WrapperNode [2025-01-09 16:49:25,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:49:25,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:49:25,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:49:25,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:49:25,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25" (1/1) ... [2025-01-09 16:49:25,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25" (1/1) ... [2025-01-09 16:49:25,900 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-01-09 16:49:25,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:49:25,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:49:25,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:49:25,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:49:25,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25" (1/1) ... [2025-01-09 16:49:25,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25" (1/1) ... [2025-01-09 16:49:25,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25" (1/1) ... [2025-01-09 16:49:25,919 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-01-09 16:49:25,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25" (1/1) ... [2025-01-09 16:49:25,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25" (1/1) ... [2025-01-09 16:49:25,925 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25" (1/1) ... [2025-01-09 16:49:25,926 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25" (1/1) ... [2025-01-09 16:49:25,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25" (1/1) ... [2025-01-09 16:49:25,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25" (1/1) ... [2025-01-09 16:49:25,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25" (1/1) ... [2025-01-09 16:49:25,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:49:25,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:49:25,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:49:25,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:49:25,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25" (1/1) ... [2025-01-09 16:49:25,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:49:25,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:49:25,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:49:25,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:49:25,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:49:25,990 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:49:25,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:49:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:49:25,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:49:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:49:25,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:49:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 16:49:25,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 16:49:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:49:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:49:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:49:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:49:25,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:49:25,993 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:49:26,067 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:49:26,069 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:49:26,218 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:49:26,218 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:49:26,357 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:49:26,361 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:49:26,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:49:26 BoogieIcfgContainer [2025-01-09 16:49:26,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:49:26,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:49:26,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:49:26,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:49:26,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:49:25" (1/3) ... [2025-01-09 16:49:26,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340c168e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:49:26, skipping insertion in model container [2025-01-09 16:49:26,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:25" (2/3) ... [2025-01-09 16:49:26,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340c168e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:49:26, skipping insertion in model container [2025-01-09 16:49:26,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:49:26" (3/3) ... [2025-01-09 16:49:26,368 INFO L128 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2025-01-09 16:49:26,379 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:49:26,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-hard1.wvr.c that has 5 procedures, 41 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 16:49:26,380 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:49:26,436 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 16:49:26,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 116 flow [2025-01-09 16:49:26,500 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2025-01-09 16:49:26,502 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:49:26,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 40 events. 4/40 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-01-09 16:49:26,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 44 transitions, 116 flow [2025-01-09 16:49:26,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 102 flow [2025-01-09 16:49:26,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:49:26,539 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@614e8dea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:49:26,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:49:26,551 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:49:26,551 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-01-09 16:49:26,551 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:49:26,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:26,551 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] [2025-01-09 16:49:26,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:49:26,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:26,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1542935189, now seen corresponding path program 1 times [2025-01-09 16:49:26,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:26,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026209331] [2025-01-09 16:49:26,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:49:26,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:26,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:49:26,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:49:26,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:49:26,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:26,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:26,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026209331] [2025-01-09 16:49:26,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026209331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:26,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:26,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:49:26,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536284627] [2025-01-09 16:49:26,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:26,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:49:26,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:26,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:49:26,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:49:26,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 44 [2025-01-09 16:49:26,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 16:49:26,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:26,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 44 [2025-01-09 16:49:26,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:27,225 INFO L124 PetriNetUnfolderBase]: 1367/2172 cut-off events. [2025-01-09 16:49:27,228 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-01-09 16:49:27,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4051 conditions, 2172 events. 1367/2172 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11250 event pairs, 123 based on Foata normal form. 1/2116 useless extension candidates. Maximal degree in co-relation 3481. Up to 1541 conditions per place. [2025-01-09 16:49:27,247 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 35 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2025-01-09 16:49:27,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 243 flow [2025-01-09 16:49:27,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:49:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:49:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-01-09 16:49:27,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7954545454545454 [2025-01-09 16:49:27,259 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 102 flow. Second operand 3 states and 105 transitions. [2025-01-09 16:49:27,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 243 flow [2025-01-09 16:49:27,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 213 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 16:49:27,269 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 119 flow [2025-01-09 16:49:27,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2025-01-09 16:49:27,274 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2025-01-09 16:49:27,275 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 119 flow [2025-01-09 16:49:27,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 16:49:27,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:27,275 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, 1] [2025-01-09 16:49:27,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:49:27,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:49:27,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:27,276 INFO L85 PathProgramCache]: Analyzing trace with hash -819610724, now seen corresponding path program 1 times [2025-01-09 16:49:27,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:27,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711342729] [2025-01-09 16:49:27,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:49:27,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:27,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:49:27,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:49:27,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:49:27,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:27,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:27,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711342729] [2025-01-09 16:49:27,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711342729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:27,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:27,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:49:27,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232549931] [2025-01-09 16:49:27,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:27,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:49:27,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:27,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:49:27,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:49:27,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2025-01-09 16:49:27,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-01-09 16:49:27,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:27,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2025-01-09 16:49:27,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:28,099 INFO L124 PetriNetUnfolderBase]: 3258/4771 cut-off events. [2025-01-09 16:49:28,099 INFO L125 PetriNetUnfolderBase]: For 1296/1311 co-relation queries the response was YES. [2025-01-09 16:49:28,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10883 conditions, 4771 events. 3258/4771 cut-off events. For 1296/1311 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 28059 event pairs, 1020 based on Foata normal form. 1/4272 useless extension candidates. Maximal degree in co-relation 2057. Up to 2161 conditions per place. [2025-01-09 16:49:28,127 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 81 selfloop transitions, 9 changer transitions 0/102 dead transitions. [2025-01-09 16:49:28,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 102 transitions, 478 flow [2025-01-09 16:49:28,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:49:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:49:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2025-01-09 16:49:28,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7227272727272728 [2025-01-09 16:49:28,129 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 119 flow. Second operand 5 states and 159 transitions. [2025-01-09 16:49:28,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 102 transitions, 478 flow [2025-01-09 16:49:28,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 102 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:49:28,131 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 176 flow [2025-01-09 16:49:28,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2025-01-09 16:49:28,132 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2025-01-09 16:49:28,132 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 176 flow [2025-01-09 16:49:28,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-01-09 16:49:28,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:28,133 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, 1] [2025-01-09 16:49:28,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:49:28,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:49:28,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash 398080696, now seen corresponding path program 2 times [2025-01-09 16:49:28,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:28,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526773604] [2025-01-09 16:49:28,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:49:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:28,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:49:28,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:49:28,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:49:28,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:28,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:28,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526773604] [2025-01-09 16:49:28,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526773604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:28,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:28,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:49:28,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249649509] [2025-01-09 16:49:28,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:28,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:49:28,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:28,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:49:28,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:49:28,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2025-01-09 16:49:28,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-01-09 16:49:28,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:28,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2025-01-09 16:49:28,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:29,146 INFO L124 PetriNetUnfolderBase]: 7791/11329 cut-off events. [2025-01-09 16:49:29,146 INFO L125 PetriNetUnfolderBase]: For 9161/10471 co-relation queries the response was YES. [2025-01-09 16:49:29,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31141 conditions, 11329 events. 7791/11329 cut-off events. For 9161/10471 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 70667 event pairs, 605 based on Foata normal form. 1266/12369 useless extension candidates. Maximal degree in co-relation 8318. Up to 4901 conditions per place. [2025-01-09 16:49:29,243 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 133 selfloop transitions, 49 changer transitions 0/194 dead transitions. [2025-01-09 16:49:29,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 194 transitions, 1101 flow [2025-01-09 16:49:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:49:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:49:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 270 transitions. [2025-01-09 16:49:29,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7670454545454546 [2025-01-09 16:49:29,245 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 176 flow. Second operand 8 states and 270 transitions. [2025-01-09 16:49:29,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 194 transitions, 1101 flow [2025-01-09 16:49:29,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 194 transitions, 1080 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:49:29,250 INFO L231 Difference]: Finished difference. Result has 61 places, 93 transitions, 599 flow [2025-01-09 16:49:29,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=599, PETRI_PLACES=61, PETRI_TRANSITIONS=93} [2025-01-09 16:49:29,251 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2025-01-09 16:49:29,251 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 93 transitions, 599 flow [2025-01-09 16:49:29,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-01-09 16:49:29,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:29,251 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, 1] [2025-01-09 16:49:29,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:49:29,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:49:29,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:29,252 INFO L85 PathProgramCache]: Analyzing trace with hash 446629026, now seen corresponding path program 3 times [2025-01-09 16:49:29,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:29,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987162582] [2025-01-09 16:49:29,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:49:29,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:29,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-01-09 16:49:29,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:49:29,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:49:29,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:29,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:29,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987162582] [2025-01-09 16:49:29,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987162582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:29,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:29,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:49:29,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087893893] [2025-01-09 16:49:29,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:29,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:49:29,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:29,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:49:29,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:49:29,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2025-01-09 16:49:29,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 93 transitions, 599 flow. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 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-01-09 16:49:29,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:29,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2025-01-09 16:49:29,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:30,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][91], [72#true, 24#L132-4true, 18#L109true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), 11#L55true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,380 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:49:30,380 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:49:30,380 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:49:30,380 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:49:30,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][91], [72#true, 24#L132-4true, 18#L109true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 17#thread1EXITtrue, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,433 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,433 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,433 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,433 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:49:30,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([326] L47-->L52: Formula: (or (and (= v_~p1~0_59 v_~p1~0_60) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (<= v_~n1~0_91 0) (= v_~n1~0_91 v_~n1~0_90)) (and (= (+ v_~m~0_65 v_~p1~0_60) v_~p1~0_59) (< 0 v_~n1~0_91) (= (+ v_~n1~0_90 1) v_~n1~0_91))) InVars {~m~0=v_~m~0_65, ~p1~0=v_~p1~0_60, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_65, ~p1~0=v_~p1~0_59, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, thread1Thread1of1ForFork1_#t~post1, ~n1~0][107], [72#true, 24#L132-4true, 42#L112true, 33#L74true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 6#L52true, 94#true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,477 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,477 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,477 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:49:30,477 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([326] L47-->L52: Formula: (or (and (= v_~p1~0_59 v_~p1~0_60) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (<= v_~n1~0_91 0) (= v_~n1~0_91 v_~n1~0_90)) (and (= (+ v_~m~0_65 v_~p1~0_60) v_~p1~0_59) (< 0 v_~n1~0_91) (= (+ v_~n1~0_90 1) v_~n1~0_91))) InVars {~m~0=v_~m~0_65, ~p1~0=v_~p1~0_60, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_65, ~p1~0=v_~p1~0_59, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, thread1Thread1of1ForFork1_#t~post1, ~n1~0][107], [72#true, 24#L132-4true, 33#L74true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 6#L52true, 94#true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 13#thread4EXITtrue, Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,478 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,478 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,478 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,478 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:49:30,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][91], [72#true, 18#L109true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 14#L133true, 41#L71true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), 11#L55true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,510 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,511 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,511 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:49:30,511 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 24#L132-4true, 42#L112true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 94#true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 11#L55true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,511 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,511 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:49:30,511 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,511 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 24#L132-4true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 94#true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 13#thread4EXITtrue, Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 11#L55true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,511 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,511 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,511 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,511 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:49:30,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][91], [72#true, 18#L109true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 14#L133true, 41#L71true, 17#thread1EXITtrue, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,562 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,562 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,562 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,562 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:49:30,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 24#L132-4true, 42#L112true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 94#true, 17#thread1EXITtrue, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,563 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,563 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,563 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,563 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:49:30,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 24#L132-4true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 94#true, 17#thread1EXITtrue, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 13#thread4EXITtrue, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,563 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,564 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,564 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:49:30,564 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 24#L132-4true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 10#L47true, 94#true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 13#thread4EXITtrue, Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,596 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,596 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,596 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:49:30,596 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 24#L132-4true, 42#L112true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 94#true, 10#L47true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,598 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,598 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,598 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,598 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:49:30,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([326] L47-->L52: Formula: (or (and (= v_~p1~0_59 v_~p1~0_60) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (<= v_~n1~0_91 0) (= v_~n1~0_91 v_~n1~0_90)) (and (= (+ v_~m~0_65 v_~p1~0_60) v_~p1~0_59) (< 0 v_~n1~0_91) (= (+ v_~n1~0_90 1) v_~n1~0_91))) InVars {~m~0=v_~m~0_65, ~p1~0=v_~p1~0_60, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_65, ~p1~0=v_~p1~0_59, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, thread1Thread1of1ForFork1_#t~post1, ~n1~0][107], [72#true, 42#L112true, 37#L93true, 33#L74true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 14#L133true, 6#L52true, 94#true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,603 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,603 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,603 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,603 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:49:30,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([326] L47-->L52: Formula: (or (and (= v_~p1~0_59 v_~p1~0_60) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (<= v_~n1~0_91 0) (= v_~n1~0_91 v_~n1~0_90)) (and (= (+ v_~m~0_65 v_~p1~0_60) v_~p1~0_59) (< 0 v_~n1~0_91) (= (+ v_~n1~0_90 1) v_~n1~0_91))) InVars {~m~0=v_~m~0_65, ~p1~0=v_~p1~0_60, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_65, ~p1~0=v_~p1~0_59, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, thread1Thread1of1ForFork1_#t~post1, ~n1~0][107], [72#true, 37#L93true, 33#L74true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 14#L133true, 6#L52true, 94#true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 13#thread4EXITtrue, Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,604 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,604 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,604 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,604 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:49:30,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 42#L112true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 14#L133true, 41#L71true, 94#true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 11#L55true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,630 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,630 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:49:30,630 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,630 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 14#L133true, 41#L71true, 94#true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 13#thread4EXITtrue, 11#L55true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,631 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,631 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,631 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:49:30,631 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 42#L112true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 14#L133true, 41#L71true, 94#true, 17#thread1EXITtrue, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,669 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,669 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,669 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,669 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:49:30,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 14#L133true, 41#L71true, 94#true, 17#thread1EXITtrue, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 13#thread4EXITtrue, Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,669 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,669 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,669 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,669 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][91], [72#true, 18#L109true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 5#L133-1true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,669 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,669 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,669 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,669 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:49:30,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), 14#L133true, Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 94#true, 10#L47true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 13#thread4EXITtrue, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,684 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,684 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,684 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,684 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 42#L112true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), 14#L133true, Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 10#L47true, 94#true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,684 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,684 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,684 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,684 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:49:30,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([326] L47-->L52: Formula: (or (and (= v_~p1~0_59 v_~p1~0_60) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (<= v_~n1~0_91 0) (= v_~n1~0_91 v_~n1~0_90)) (and (= (+ v_~m~0_65 v_~p1~0_60) v_~p1~0_59) (< 0 v_~n1~0_91) (= (+ v_~n1~0_90 1) v_~n1~0_91))) InVars {~m~0=v_~m~0_65, ~p1~0=v_~p1~0_60, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_65, ~p1~0=v_~p1~0_59, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, thread1Thread1of1ForFork1_#t~post1, ~n1~0][107], [72#true, 24#L132-4true, 18#L109true, 33#L74true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 6#L52true, 94#true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,685 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,685 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:49:30,685 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,685 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 24#L132-4true, 18#L109true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 94#true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 11#L55true, Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,698 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,698 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,698 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:49:30,698 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 94#true, 5#L133-1true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 13#thread4EXITtrue, Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,813 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-09 16:49:30,813 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:49:30,813 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:49:30,813 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 42#L112true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 94#true, 5#L133-1true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,814 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,814 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,814 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,814 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 24#L132-4true, 18#L109true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 94#true, 17#thread1EXITtrue, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,814 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,814 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,814 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,814 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 24#L132-4true, 18#L109true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 94#true, 10#L47true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,822 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,822 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,822 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,822 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([326] L47-->L52: Formula: (or (and (= v_~p1~0_59 v_~p1~0_60) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (<= v_~n1~0_91 0) (= v_~n1~0_91 v_~n1~0_90)) (and (= (+ v_~m~0_65 v_~p1~0_60) v_~p1~0_59) (< 0 v_~n1~0_91) (= (+ v_~n1~0_90 1) v_~n1~0_91))) InVars {~m~0=v_~m~0_65, ~p1~0=v_~p1~0_60, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_65, ~p1~0=v_~p1~0_59, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, thread1Thread1of1ForFork1_#t~post1, ~n1~0][107], [72#true, 18#L109true, 33#L74true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 14#L133true, 6#L52true, 94#true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,823 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,823 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,823 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,823 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 18#L109true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 14#L133true, 41#L71true, 94#true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 11#L55true, Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,829 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,829 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,829 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:49:30,829 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:49:30,839 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 18#L109true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 14#L133true, 41#L71true, 94#true, 17#thread1EXITtrue, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,839 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-09 16:49:30,839 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:49:30,839 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,839 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:49:30,851 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 18#L109true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), 14#L133true, Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 94#true, 10#L47true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,851 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-09 16:49:30,851 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:49:30,851 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:49:30,851 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:49:30,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][52], [72#true, 18#L109true, 37#L93true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 41#L71true, 94#true, 5#L133-1true, Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0))]) [2025-01-09 16:49:30,862 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-09 16:49:30,862 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:49:30,862 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:49:30,863 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:49:30,880 INFO L124 PetriNetUnfolderBase]: 12871/18608 cut-off events. [2025-01-09 16:49:30,880 INFO L125 PetriNetUnfolderBase]: For 66252/69166 co-relation queries the response was YES. [2025-01-09 16:49:30,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68026 conditions, 18608 events. 12871/18608 cut-off events. For 66252/69166 co-relation queries the response was YES. Maximal size of possible extension queue 1200. Compared 121251 event pairs, 1525 based on Foata normal form. 2550/20415 useless extension candidates. Maximal degree in co-relation 42016. Up to 6248 conditions per place. [2025-01-09 16:49:30,985 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 233 selfloop transitions, 51 changer transitions 0/298 dead transitions. [2025-01-09 16:49:30,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 298 transitions, 2604 flow [2025-01-09 16:49:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:49:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:49:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 272 transitions. [2025-01-09 16:49:30,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6868686868686869 [2025-01-09 16:49:30,987 INFO L175 Difference]: Start difference. First operand has 61 places, 93 transitions, 599 flow. Second operand 9 states and 272 transitions. [2025-01-09 16:49:30,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 298 transitions, 2604 flow [2025-01-09 16:49:31,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 298 transitions, 2604 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:49:31,027 INFO L231 Difference]: Finished difference. Result has 76 places, 133 transitions, 1145 flow [2025-01-09 16:49:31,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1145, PETRI_PLACES=76, PETRI_TRANSITIONS=133} [2025-01-09 16:49:31,028 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2025-01-09 16:49:31,028 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 133 transitions, 1145 flow [2025-01-09 16:49:31,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 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-01-09 16:49:31,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:31,028 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, 1] [2025-01-09 16:49:31,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:49:31,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:49:31,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:31,029 INFO L85 PathProgramCache]: Analyzing trace with hash 179236206, now seen corresponding path program 4 times [2025-01-09 16:49:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:31,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270149242] [2025-01-09 16:49:31,029 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:49:31,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:31,041 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-01-09 16:49:31,052 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:49:31,052 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:49:31,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:31,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:31,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270149242] [2025-01-09 16:49:31,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270149242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:31,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:31,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:49:31,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84954124] [2025-01-09 16:49:31,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:31,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:49:31,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:31,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:49:31,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:49:31,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2025-01-09 16:49:31,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 133 transitions, 1145 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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-01-09 16:49:31,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:31,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2025-01-09 16:49:31,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:33,289 INFO L124 PetriNetUnfolderBase]: 20653/29128 cut-off events. [2025-01-09 16:49:33,289 INFO L125 PetriNetUnfolderBase]: For 120642/127158 co-relation queries the response was YES. [2025-01-09 16:49:33,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118734 conditions, 29128 events. 20653/29128 cut-off events. For 120642/127158 co-relation queries the response was YES. Maximal size of possible extension queue 1873. Compared 192717 event pairs, 2650 based on Foata normal form. 3922/32101 useless extension candidates. Maximal degree in co-relation 110417. Up to 12715 conditions per place. [2025-01-09 16:49:33,828 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 129 selfloop transitions, 151 changer transitions 0/293 dead transitions. [2025-01-09 16:49:33,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 293 transitions, 2882 flow [2025-01-09 16:49:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:49:33,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:49:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 231 transitions. [2025-01-09 16:49:33,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-01-09 16:49:33,830 INFO L175 Difference]: Start difference. First operand has 76 places, 133 transitions, 1145 flow. Second operand 7 states and 231 transitions. [2025-01-09 16:49:33,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 293 transitions, 2882 flow [2025-01-09 16:49:34,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 293 transitions, 2878 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-01-09 16:49:34,088 INFO L231 Difference]: Finished difference. Result has 86 places, 209 transitions, 2421 flow [2025-01-09 16:49:34,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2421, PETRI_PLACES=86, PETRI_TRANSITIONS=209} [2025-01-09 16:49:34,089 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 38 predicate places. [2025-01-09 16:49:34,090 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 209 transitions, 2421 flow [2025-01-09 16:49:34,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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-01-09 16:49:34,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:34,090 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, 1] [2025-01-09 16:49:34,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:49:34,091 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:49:34,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:34,091 INFO L85 PathProgramCache]: Analyzing trace with hash -79342530, now seen corresponding path program 5 times [2025-01-09 16:49:34,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:34,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763666178] [2025-01-09 16:49:34,091 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:49:34,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:34,097 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:49:34,104 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:49:34,105 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:49:34,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:34,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:34,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763666178] [2025-01-09 16:49:34,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763666178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:34,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:34,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:49:34,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957822170] [2025-01-09 16:49:34,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:34,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:49:34,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:34,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:49:34,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:49:34,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2025-01-09 16:49:34,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 209 transitions, 2421 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 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-01-09 16:49:34,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:34,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2025-01-09 16:49:34,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:37,975 INFO L124 PetriNetUnfolderBase]: 32603/45966 cut-off events. [2025-01-09 16:49:37,976 INFO L125 PetriNetUnfolderBase]: For 260219/266066 co-relation queries the response was YES. [2025-01-09 16:49:38,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215536 conditions, 45966 events. 32603/45966 cut-off events. For 260219/266066 co-relation queries the response was YES. Maximal size of possible extension queue 2654. Compared 314384 event pairs, 2564 based on Foata normal form. 6358/51887 useless extension candidates. Maximal degree in co-relation 205964. Up to 15136 conditions per place. [2025-01-09 16:49:38,252 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 253 selfloop transitions, 283 changer transitions 0/545 dead transitions. [2025-01-09 16:49:38,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 545 transitions, 7108 flow [2025-01-09 16:49:38,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:49:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:49:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 301 transitions. [2025-01-09 16:49:38,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6840909090909091 [2025-01-09 16:49:38,254 INFO L175 Difference]: Start difference. First operand has 86 places, 209 transitions, 2421 flow. Second operand 10 states and 301 transitions. [2025-01-09 16:49:38,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 545 transitions, 7108 flow [2025-01-09 16:49:39,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 545 transitions, 6953 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:49:39,901 INFO L231 Difference]: Finished difference. Result has 102 places, 391 transitions, 5894 flow [2025-01-09 16:49:39,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2340, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5894, PETRI_PLACES=102, PETRI_TRANSITIONS=391} [2025-01-09 16:49:39,902 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 54 predicate places. [2025-01-09 16:49:39,902 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 391 transitions, 5894 flow [2025-01-09 16:49:39,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 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-01-09 16:49:39,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:39,903 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, 1] [2025-01-09 16:49:39,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:49:39,903 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:49:39,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:39,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1739792832, now seen corresponding path program 1 times [2025-01-09 16:49:39,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:39,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316542919] [2025-01-09 16:49:39,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:49:39,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:39,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:49:39,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:49:39,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:49:39,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:40,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:40,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316542919] [2025-01-09 16:49:40,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316542919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:40,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:40,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:49:40,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641599418] [2025-01-09 16:49:40,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:40,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:49:40,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:40,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:49:40,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:49:40,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2025-01-09 16:49:40,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 391 transitions, 5894 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-01-09 16:49:40,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:40,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2025-01-09 16:49:40,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:48,161 INFO L124 PetriNetUnfolderBase]: 59079/86914 cut-off events. [2025-01-09 16:49:48,161 INFO L125 PetriNetUnfolderBase]: For 855228/872440 co-relation queries the response was YES. [2025-01-09 16:49:48,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484590 conditions, 86914 events. 59079/86914 cut-off events. For 855228/872440 co-relation queries the response was YES. Maximal size of possible extension queue 4609. Compared 685820 event pairs, 6178 based on Foata normal form. 5590/88266 useless extension candidates. Maximal degree in co-relation 475639. Up to 31799 conditions per place. [2025-01-09 16:49:49,072 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 218 selfloop transitions, 832 changer transitions 0/1159 dead transitions. [2025-01-09 16:49:49,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 1159 transitions, 19370 flow [2025-01-09 16:49:49,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:49:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:49:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 262 transitions. [2025-01-09 16:49:49,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7443181818181818 [2025-01-09 16:49:49,074 INFO L175 Difference]: Start difference. First operand has 102 places, 391 transitions, 5894 flow. Second operand 8 states and 262 transitions. [2025-01-09 16:49:49,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 1159 transitions, 19370 flow [2025-01-09 16:50:18,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 1159 transitions, 18879 flow, removed 18 selfloop flow, removed 1 redundant places. [2025-01-09 16:50:18,079 INFO L231 Difference]: Finished difference. Result has 114 places, 1018 transitions, 18122 flow [2025-01-09 16:50:18,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=5747, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=18122, PETRI_PLACES=114, PETRI_TRANSITIONS=1018} [2025-01-09 16:50:18,080 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 66 predicate places. [2025-01-09 16:50:18,080 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 1018 transitions, 18122 flow [2025-01-09 16:50:18,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-01-09 16:50:18,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:18,080 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, 1] [2025-01-09 16:50:18,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:50:18,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:50:18,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:18,081 INFO L85 PathProgramCache]: Analyzing trace with hash 572977414, now seen corresponding path program 2 times [2025-01-09 16:50:18,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:18,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519944554] [2025-01-09 16:50:18,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:50:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:18,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-09 16:50:18,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:50:18,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:50:18,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:50:18,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:18,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519944554] [2025-01-09 16:50:18,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519944554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:50:18,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:50:18,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:50:18,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122271805] [2025-01-09 16:50:18,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:50:18,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:50:18,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:50:18,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:50:18,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:50:18,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2025-01-09 16:50:18,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 1018 transitions, 18122 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-01-09 16:50:18,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:18,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2025-01-09 16:50:18,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:21,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([344] L104-->L109: Formula: (or (and (= v_~p2~0_80 v_~p2~0_79) (= v_~n2~0_81 v_~n2~0_80) (<= v_~n2~0_81 1)) (and (= (+ v_~p2~0_80 (* v_~m~0_73 2)) v_~p2~0_79) (< 1 v_~n2~0_81) (= (+ v_~n2~0_80 2) v_~n2~0_81))) InVars {~n2~0=v_~n2~0_81, ~p2~0=v_~p2~0_80, ~m~0=v_~m~0_73} OutVars{~n2~0=v_~n2~0_80, ~p2~0=v_~p2~0_79, ~m~0=v_~m~0_73} AuxVars[] AssignedVars[~n2~0, ~p2~0][486], [Black: 123#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 127#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 121#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), 24#L132-4true, Black: 125#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 18#L109true, 33#L74true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 157#true, Black: 146#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 140#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 137#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 138#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 134#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 148#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), Black: 144#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 142#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 72#true, 37#L93true, Black: 161#(< 0 ~n2~0), Black: 162#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)), 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 106#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 164#(and (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 99#(<= ~n1~0 0), Black: 166#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1)))), Black: 104#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 168#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 96#(<= ~n1~0 ~n2~0), Black: 159#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 102#(and (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))) (<= ~n1~0 ~n2~0)), Black: 100#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 17#thread1EXITtrue, 175#true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-01-09 16:50:21,275 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:50:21,275 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:21,275 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:21,275 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:21,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([326] L47-->L52: Formula: (or (and (= v_~p1~0_59 v_~p1~0_60) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (<= v_~n1~0_91 0) (= v_~n1~0_91 v_~n1~0_90)) (and (= (+ v_~m~0_65 v_~p1~0_60) v_~p1~0_59) (< 0 v_~n1~0_91) (= (+ v_~n1~0_90 1) v_~n1~0_91))) InVars {~m~0=v_~m~0_65, ~p1~0=v_~p1~0_60, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_65, ~p1~0=v_~p1~0_59, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, thread1Thread1of1ForFork1_#t~post1, ~n1~0][558], [Black: 123#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 127#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 42#L112true, Black: 121#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 125#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 33#L74true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 102#(and (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))) (<= ~n1~0 ~n2~0)), 134#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 146#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 140#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 137#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 138#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 74#(<= ~n1~0 ~n2~0), Black: 148#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 144#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 142#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 23#$Ultimate##0true, 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 162#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)), 14#L133true, Black: 161#(< 0 ~n2~0), 6#L52true, Black: 106#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 164#(and (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 99#(<= ~n1~0 0), Black: 166#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1)))), Black: 168#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 104#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 96#(<= ~n1~0 ~n2~0), Black: 159#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 100#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), 116#(<= ~n1~0 ~n2~0), 175#true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-01-09 16:50:21,914 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:50:21,914 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:50:21,914 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-01-09 16:50:21,914 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:50:22,427 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread3Thread1of1ForFork0_~cond~2_5 256) 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][42], [Black: 123#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 127#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 121#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), 24#L132-4true, 42#L112true, Black: 125#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 102#(and (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))) (<= ~n1~0 ~n2~0)), 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), 15#thread3EXITtrue, Black: 146#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 137#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 138#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 134#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), 168#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 148#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 144#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 142#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 161#(< 0 ~n2~0), Black: 162#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 106#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 164#(and (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 99#(<= ~n1~0 0), Black: 166#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1)))), Black: 104#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 96#(<= ~n1~0 ~n2~0), Black: 159#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 100#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), 116#(<= ~n1~0 ~n2~0), 17#thread1EXITtrue, 140#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), 74#(<= ~n1~0 ~n2~0), 175#true, 31#thread2EXITtrue, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-01-09 16:50:22,427 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,427 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,428 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,428 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([344] L104-->L109: Formula: (or (and (= v_~p2~0_80 v_~p2~0_79) (= v_~n2~0_81 v_~n2~0_80) (<= v_~n2~0_81 1)) (and (= (+ v_~p2~0_80 (* v_~m~0_73 2)) v_~p2~0_79) (< 1 v_~n2~0_81) (= (+ v_~n2~0_80 2) v_~n2~0_81))) InVars {~n2~0=v_~n2~0_81, ~p2~0=v_~p2~0_80, ~m~0=v_~m~0_73} OutVars{~n2~0=v_~n2~0_80, ~p2~0=v_~p2~0_79, ~m~0=v_~m~0_73} AuxVars[] AssignedVars[~n2~0, ~p2~0][486], [Black: 123#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 127#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 121#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), 24#L132-4true, Black: 125#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 18#L109true, Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 157#true, 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 146#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 140#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 137#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 138#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 134#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 148#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), Black: 144#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 142#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 72#true, 37#L93true, Black: 161#(< 0 ~n2~0), Black: 162#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 106#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 164#(and (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 99#(<= ~n1~0 0), Black: 166#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1)))), Black: 104#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 168#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 96#(<= ~n1~0 ~n2~0), Black: 159#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 102#(and (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))) (<= ~n1~0 ~n2~0)), Black: 100#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 17#thread1EXITtrue, 175#true, 31#thread2EXITtrue, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-01-09 16:50:22,428 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:50:22,428 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:50:22,428 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:50:22,428 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:50:22,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([326] L47-->L52: Formula: (or (and (= v_~p1~0_59 v_~p1~0_60) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (<= v_~n1~0_91 0) (= v_~n1~0_91 v_~n1~0_90)) (and (= (+ v_~m~0_65 v_~p1~0_60) v_~p1~0_59) (< 0 v_~n1~0_91) (= (+ v_~n1~0_90 1) v_~n1~0_91))) InVars {~m~0=v_~m~0_65, ~p1~0=v_~p1~0_60, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_65, ~p1~0=v_~p1~0_59, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, thread1Thread1of1ForFork1_#t~post1, ~n1~0][90], [Black: 123#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 127#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 121#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), 24#L132-4true, Black: 125#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 161#(< 0 ~n2~0), 33#L74true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 146#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 137#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 138#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), 96#(<= ~n1~0 ~n2~0), 21#$Ultimate##0true, Black: 134#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 148#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 144#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 142#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 37#L93true, 6#L52true, Black: 162#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 164#(and (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 106#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 99#(<= ~n1~0 0), Black: 166#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1)))), Black: 104#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 168#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 159#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 102#(and (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))) (<= ~n1~0 ~n2~0)), Black: 100#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), 116#(<= ~n1~0 ~n2~0), 140#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), 74#(<= ~n1~0 ~n2~0), 175#true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-01-09 16:50:22,501 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,501 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-09 16:50:22,501 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,501 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-09 16:50:22,533 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread3Thread1of1ForFork0_~cond~2_5 256) 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][42], [Black: 123#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 127#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 121#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), 24#L132-4true, 42#L112true, Black: 125#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 33#L74true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 102#(and (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))) (<= ~n1~0 ~n2~0)), 15#thread3EXITtrue, Black: 146#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 137#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 138#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 134#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 168#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 148#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 144#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 142#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 161#(< 0 ~n2~0), Black: 162#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)), 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 106#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 164#(and (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 99#(<= ~n1~0 0), Black: 166#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1)))), Black: 104#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 96#(<= ~n1~0 ~n2~0), Black: 159#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 100#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), 17#thread1EXITtrue, 116#(<= ~n1~0 ~n2~0), 140#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), 74#(<= ~n1~0 ~n2~0), 175#true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-01-09 16:50:22,533 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2025-01-09 16:50:22,533 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-01-09 16:50:22,533 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-01-09 16:50:22,533 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2025-01-09 16:50:22,593 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread3Thread1of1ForFork0_~cond~2_5 256) 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][42], [Black: 123#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 127#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 121#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), 42#L112true, Black: 125#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 33#L74true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 102#(and (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))) (<= ~n1~0 ~n2~0)), 15#thread3EXITtrue, Black: 146#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 137#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 138#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 134#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 148#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), 168#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 144#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 142#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 14#L133true, Black: 161#(< 0 ~n2~0), Black: 162#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)), 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 106#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 164#(and (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 99#(<= ~n1~0 0), Black: 166#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1)))), Black: 104#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 96#(<= ~n1~0 ~n2~0), Black: 159#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 100#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), 116#(<= ~n1~0 ~n2~0), 17#thread1EXITtrue, 140#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), 74#(<= ~n1~0 ~n2~0), 175#true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-01-09 16:50:22,593 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,593 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,593 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,593 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([344] L104-->L109: Formula: (or (and (= v_~p2~0_80 v_~p2~0_79) (= v_~n2~0_81 v_~n2~0_80) (<= v_~n2~0_81 1)) (and (= (+ v_~p2~0_80 (* v_~m~0_73 2)) v_~p2~0_79) (< 1 v_~n2~0_81) (= (+ v_~n2~0_80 2) v_~n2~0_81))) InVars {~n2~0=v_~n2~0_81, ~p2~0=v_~p2~0_80, ~m~0=v_~m~0_73} OutVars{~n2~0=v_~n2~0_80, ~p2~0=v_~p2~0_79, ~m~0=v_~m~0_73} AuxVars[] AssignedVars[~n2~0, ~p2~0][486], [Black: 123#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 127#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 121#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 125#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 18#L109true, 33#L74true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 157#true, Black: 146#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 140#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 137#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 138#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 134#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 148#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), Black: 144#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 142#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 72#true, 37#L93true, 14#L133true, Black: 161#(< 0 ~n2~0), Black: 162#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)), 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 106#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 164#(and (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 99#(<= ~n1~0 0), Black: 166#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1)))), Black: 104#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 168#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 96#(<= ~n1~0 ~n2~0), Black: 159#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 102#(and (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))) (<= ~n1~0 ~n2~0)), Black: 100#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 17#thread1EXITtrue, 175#true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-01-09 16:50:22,594 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:50:22,594 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:50:22,594 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:50:22,594 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:50:22,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (= (mod v_thread3Thread1of1ForFork0_~cond~2_5 256) 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|, thread3Thread1of1ForFork0_~cond~2=v_thread3Thread1of1ForFork0_~cond~2_5} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][42], [Black: 123#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 127#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 121#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), 24#L132-4true, 42#L112true, Black: 125#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 102#(and (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))) (<= ~n1~0 ~n2~0)), 15#thread3EXITtrue, Black: 146#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 137#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 138#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 134#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), 7#L66true, 168#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 148#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 144#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 142#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 161#(< 0 ~n2~0), Black: 162#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)), 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 106#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 164#(and (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 99#(<= ~n1~0 0), Black: 166#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1)))), Black: 104#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 96#(<= ~n1~0 ~n2~0), Black: 159#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 100#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), 116#(<= ~n1~0 ~n2~0), 17#thread1EXITtrue, 140#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), 74#(<= ~n1~0 ~n2~0), 175#true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-01-09 16:50:22,605 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,605 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,605 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,606 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][345], [Black: 123#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 127#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 121#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), 24#L132-4true, 42#L112true, Black: 125#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 102#(and (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))) (<= ~n1~0 ~n2~0)), Black: 146#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 137#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 138#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 134#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 148#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 144#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 142#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 37#L93true, 162#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)), 41#L71true, Black: 161#(< 0 ~n2~0), Black: 106#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 164#(and (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 99#(<= ~n1~0 0), Black: 166#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1)))), Black: 104#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 168#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 96#(<= ~n1~0 ~n2~0), Black: 159#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 100#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), 116#(<= ~n1~0 ~n2~0), 17#thread1EXITtrue, 140#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), 74#(<= ~n1~0 ~n2~0), 175#true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-01-09 16:50:22,609 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,609 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,609 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,609 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:50:22,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([344] L104-->L109: Formula: (or (and (= v_~p2~0_80 v_~p2~0_79) (= v_~n2~0_81 v_~n2~0_80) (<= v_~n2~0_81 1)) (and (= (+ v_~p2~0_80 (* v_~m~0_73 2)) v_~p2~0_79) (< 1 v_~n2~0_81) (= (+ v_~n2~0_80 2) v_~n2~0_81))) InVars {~n2~0=v_~n2~0_81, ~p2~0=v_~p2~0_80, ~m~0=v_~m~0_73} OutVars{~n2~0=v_~n2~0_80, ~p2~0=v_~p2~0_79, ~m~0=v_~m~0_73} AuxVars[] AssignedVars[~n2~0, ~p2~0][486], [Black: 123#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 127#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 121#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), 24#L132-4true, Black: 125#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 18#L109true, Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 157#true, Black: 146#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 140#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 137#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 138#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 74#(<= ~n1~0 ~n2~0), Black: 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 134#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), 7#L66true, Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 148#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), Black: 144#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 142#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 72#true, 37#L93true, Black: 161#(< 0 ~n2~0), Black: 162#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)), 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 106#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 164#(and (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 99#(<= ~n1~0 0), Black: 166#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1)))), Black: 104#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 168#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 96#(<= ~n1~0 ~n2~0), Black: 159#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 102#(and (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))) (<= ~n1~0 ~n2~0)), Black: 100#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 17#thread1EXITtrue, 175#true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-01-09 16:50:22,610 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:50:22,610 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:50:22,610 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:50:22,610 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:50:23,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([326] L47-->L52: Formula: (or (and (= v_~p1~0_59 v_~p1~0_60) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (<= v_~n1~0_91 0) (= v_~n1~0_91 v_~n1~0_90)) (and (= (+ v_~m~0_65 v_~p1~0_60) v_~p1~0_59) (< 0 v_~n1~0_91) (= (+ v_~n1~0_90 1) v_~n1~0_91))) InVars {~m~0=v_~m~0_65, ~p1~0=v_~p1~0_60, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_65, ~p1~0=v_~p1~0_59, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, thread1Thread1of1ForFork1_#t~post1, ~n1~0][559], [Black: 123#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 127#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 42#L112true, Black: 121#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 125#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 102#(and (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))) (<= ~n1~0 ~n2~0)), 134#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 146#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 140#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 137#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 138#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 74#(<= ~n1~0 ~n2~0), Black: 148#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 144#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 142#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 23#$Ultimate##0true, 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 162#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)), 14#L133true, 6#L52true, Black: 161#(< 0 ~n2~0), Black: 164#(and (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 106#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 99#(<= ~n1~0 0), Black: 166#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1)))), Black: 168#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 104#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 159#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 96#(<= ~n1~0 ~n2~0), Black: 100#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), 116#(<= ~n1~0 ~n2~0), 175#true, 31#thread2EXITtrue, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-01-09 16:50:23,394 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-01-09 16:50:23,394 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:50:23,394 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:50:23,394 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:50:23,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([326] L47-->L52: Formula: (or (and (= v_~p1~0_59 v_~p1~0_60) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (<= v_~n1~0_91 0) (= v_~n1~0_91 v_~n1~0_90)) (and (= (+ v_~m~0_65 v_~p1~0_60) v_~p1~0_59) (< 0 v_~n1~0_91) (= (+ v_~n1~0_90 1) v_~n1~0_91))) InVars {~m~0=v_~m~0_65, ~p1~0=v_~p1~0_60, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~n1~0=v_~n1~0_91} OutVars{~m~0=v_~m~0_65, ~p1~0=v_~p1~0_59, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|, ~n1~0=v_~n1~0_90} AuxVars[] AssignedVars[~p1~0, thread1Thread1of1ForFork1_#t~post1, ~n1~0][558], [Black: 123#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 127#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 42#L112true, Black: 121#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 125#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 102#(and (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))) (<= ~n1~0 ~n2~0)), 134#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 146#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 140#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 137#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 138#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 74#(<= ~n1~0 ~n2~0), 7#L66true, Black: 148#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 144#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 142#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 23#$Ultimate##0true, 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 162#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)), 14#L133true, Black: 161#(< 0 ~n2~0), 6#L52true, Black: 106#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 164#(and (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 99#(<= ~n1~0 0), Black: 166#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1)))), Black: 168#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 104#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 96#(<= ~n1~0 ~n2~0), Black: 159#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 100#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), 116#(<= ~n1~0 ~n2~0), 175#true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-01-09 16:50:23,508 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-01-09 16:50:23,508 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:50:23,508 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:50:23,508 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:50:23,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L66-->L71: Formula: (or (and (= v_~n1~0_99 v_~n1~0_98) (= v_~p1~0_68 v_~p1~0_67) (<= v_~n1~0_99 1)) (and (< 1 v_~n1~0_99) (= (+ v_~p1~0_68 (* v_~m~0_69 2)) v_~p1~0_67) (= (+ v_~n1~0_98 2) v_~n1~0_99))) InVars {~p1~0=v_~p1~0_68, ~n1~0=v_~n1~0_99, ~m~0=v_~m~0_69} OutVars{~p1~0=v_~p1~0_67, ~n1~0=v_~n1~0_98, ~m~0=v_~m~0_69} AuxVars[] AssignedVars[~p1~0, ~n1~0][345], [Black: 123#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 127#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), 42#L112true, Black: 121#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 125#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 66#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)), Black: 62#(or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))), Black: 68#(and (= thread2Thread1of1ForFork3_~cond~1 0) (<= 0 (div thread1Thread1of1ForFork1_~cond~0 256)) (<= ~n1~0 0) (<= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 102#(and (or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))) (<= ~n1~0 ~n2~0)), 134#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), Black: 146#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 140#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 137#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 138#(and (= thread4Thread1of1ForFork2_~cond~3 thread3Thread1of1ForFork0_~cond~2) (<= 1 thread3Thread1of1ForFork0_~cond~2) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0)), Black: 74#(<= ~n1~0 ~n2~0), Black: 85#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 148#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 79#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= ~n1~0 ~n2~0)), Black: 144#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)), Black: 87#(and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= ~n1~0 ~n2~0)), Black: 142#(and (or (and (<= 1 ~n2~0) (= thread3Thread1of1ForFork0_~cond~2 1)) (and (<= ~n2~0 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 81#(and (or (and (<= 1 ~n1~0) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 23#$Ultimate##0true, 83#(and (<= 1 ~n2~0) (<= ~n1~0 ~n2~0)), 162#(and (<= 1 ~n2~0) (= thread4Thread1of1ForFork2_~cond~3 1)), 14#L133true, 41#L71true, Black: 161#(< 0 ~n2~0), Black: 106#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 164#(and (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 99#(<= ~n1~0 0), Black: 166#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1)))), Black: 168#(and (<= 1 ~n2~0) (or (and (= thread2Thread1of1ForFork3_~cond~1 0) (<= ~n1~0 0)) (and (<= 1 ~n1~0) (= thread2Thread1of1ForFork3_~cond~1 1))) (= thread4Thread1of1ForFork2_~cond~3 1)), Black: 104#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 96#(<= ~n1~0 ~n2~0), Black: 159#(or (< 0 ~n2~0) (< ~n1~0 (+ ~n2~0 1))), 10#L47true, Black: 100#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 98#(or (< ~n1~0 1) (and (<= 1 thread4Thread1of1ForFork2_~cond~3) (<= (div thread4Thread1of1ForFork2_~cond~3 256) 0))), 116#(<= ~n1~0 ~n2~0), 175#true, Black: 58#(= (mod ~p1~0 4294967296) (mod ~p2~0 4294967296))]) [2025-01-09 16:50:23,508 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-01-09 16:50:23,508 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:50:23,508 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:50:23,508 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event