./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:13:33,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:13:33,609 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 03:13:33,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:13:33,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:13:33,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:13:33,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:13:33,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:13:33,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:13:33,639 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:13:33,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:13:33,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:13:33,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:13:33,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:13:33,640 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:13:33,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:13:33,640 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:13:33,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:13:33,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:13:33,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:13:33,640 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:13:33,641 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:13:33,641 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:13:33,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:13:33,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:13:33,641 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:13:33,641 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:13:33,641 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:13:33,641 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:13:33,641 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:13:33,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:13:33,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:13:33,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:13:33,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:13:33,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:13:33,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:13:33,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:13:33,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:13:33,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:13:33,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:13:33,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:13:33,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:13:33,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:13:33,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:13:33,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:13:33,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:13:33,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:13:33,643 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 [2024-11-28 03:13:33,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:13:33,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:13:33,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:13:33,953 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:13:33,955 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:13:33,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2024-11-28 03:13:37,057 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/data/9ff5fa6f3/f5d1aa3fbe514748a49a633c63565f9d/FLAG387a59cc7 [2024-11-28 03:13:37,380 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:13:37,380 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2024-11-28 03:13:37,394 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/data/9ff5fa6f3/f5d1aa3fbe514748a49a633c63565f9d/FLAG387a59cc7 [2024-11-28 03:13:37,417 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/data/9ff5fa6f3/f5d1aa3fbe514748a49a633c63565f9d [2024-11-28 03:13:37,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:13:37,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:13:37,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:13:37,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:13:37,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:13:37,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:13:37" (1/1) ... [2024-11-28 03:13:37,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d6929f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37, skipping insertion in model container [2024-11-28 03:13:37,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:13:37" (1/1) ... [2024-11-28 03:13:37,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:13:37,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:13:37,704 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:13:37,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:13:37,755 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:13:37,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37 WrapperNode [2024-11-28 03:13:37,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:13:37,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:13:37,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:13:37,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:13:37,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37" (1/1) ... [2024-11-28 03:13:37,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37" (1/1) ... [2024-11-28 03:13:37,792 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2024-11-28 03:13:37,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:13:37,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:13:37,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:13:37,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:13:37,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37" (1/1) ... [2024-11-28 03:13:37,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37" (1/1) ... [2024-11-28 03:13:37,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37" (1/1) ... [2024-11-28 03:13:37,827 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]. [2024-11-28 03:13:37,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37" (1/1) ... [2024-11-28 03:13:37,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37" (1/1) ... [2024-11-28 03:13:37,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37" (1/1) ... [2024-11-28 03:13:37,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37" (1/1) ... [2024-11-28 03:13:37,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37" (1/1) ... [2024-11-28 03:13:37,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37" (1/1) ... [2024-11-28 03:13:37,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37" (1/1) ... [2024-11-28 03:13:37,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:13:37,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:13:37,853 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:13:37,853 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:13:37,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37" (1/1) ... [2024-11-28 03:13:37,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:13:37,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:13:37,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:13:37,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:13:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:13:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-28 03:13:37,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-28 03:13:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-28 03:13:37,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-28 03:13:37,928 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-28 03:13:37,929 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-28 03:13:37,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:13:37,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 03:13:37,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 03:13:37,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:13:37,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:13:37,931 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:13:38,028 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:13:38,030 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:13:38,247 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:13:38,247 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:13:38,414 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:13:38,415 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 03:13:38,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:13:38 BoogieIcfgContainer [2024-11-28 03:13:38,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:13:38,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:13:38,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:13:38,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:13:38,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:13:37" (1/3) ... [2024-11-28 03:13:38,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d64be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:13:38, skipping insertion in model container [2024-11-28 03:13:38,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:13:37" (2/3) ... [2024-11-28 03:13:38,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d64be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:13:38, skipping insertion in model container [2024-11-28 03:13:38,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:13:38" (3/3) ... [2024-11-28 03:13:38,432 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2024-11-28 03:13:38,445 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:13:38,447 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-mult-equiv.wvr.c that has 4 procedures, 32 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2024-11-28 03:13:38,447 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:13:38,531 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-28 03:13:38,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 89 flow [2024-11-28 03:13:38,607 INFO L124 PetriNetUnfolderBase]: 3/31 cut-off events. [2024-11-28 03:13:38,612 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 03:13:38,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-11-28 03:13:38,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 34 transitions, 89 flow [2024-11-28 03:13:38,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 78 flow [2024-11-28 03:13:38,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:13:38,650 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=None, 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;@12373573, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:13:38,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-28 03:13:38,668 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:13:38,668 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-11-28 03:13:38,668 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 03:13:38,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:13:38,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:13:38,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:13:38,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash -75799991, now seen corresponding path program 1 times [2024-11-28 03:13:38,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:38,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366016655] [2024-11-28 03:13:38,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:38,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:13:39,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:39,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366016655] [2024-11-28 03:13:39,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366016655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:39,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:39,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:13:39,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616509068] [2024-11-28 03:13:39,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:39,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:13:39,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:39,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:13:39,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:13:39,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-28 03:13:39,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:13:39,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:13:39,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-28 03:13:39,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:13:39,765 INFO L124 PetriNetUnfolderBase]: 321/552 cut-off events. [2024-11-28 03:13:39,767 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-28 03:13:39,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 552 events. 321/552 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2480 event pairs, 34 based on Foata normal form. 2/533 useless extension candidates. Maximal degree in co-relation 896. Up to 376 conditions per place. [2024-11-28 03:13:39,778 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 26 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2024-11-28 03:13:39,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 179 flow [2024-11-28 03:13:39,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:13:39,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:13:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-28 03:13:39,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2024-11-28 03:13:39,799 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 78 flow. Second operand 3 states and 78 transitions. [2024-11-28 03:13:39,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 179 flow [2024-11-28 03:13:39,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 157 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 03:13:39,811 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 88 flow [2024-11-28 03:13:39,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2024-11-28 03:13:39,819 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2024-11-28 03:13:39,820 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 88 flow [2024-11-28 03:13:39,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:13:39,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:13:39,821 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] [2024-11-28 03:13:39,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:13:39,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:13:39,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:39,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1212639627, now seen corresponding path program 1 times [2024-11-28 03:13:39,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:39,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356400762] [2024-11-28 03:13:39,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:39,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:40,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:13:40,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:40,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356400762] [2024-11-28 03:13:40,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356400762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:40,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:40,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:13:40,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175627275] [2024-11-28 03:13:40,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:40,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:13:40,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:40,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:13:40,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:13:40,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-11-28 03:13:40,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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) [2024-11-28 03:13:40,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:13:40,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-11-28 03:13:40,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:13:40,935 INFO L124 PetriNetUnfolderBase]: 577/914 cut-off events. [2024-11-28 03:13:40,937 INFO L125 PetriNetUnfolderBase]: For 198/221 co-relation queries the response was YES. [2024-11-28 03:13:40,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2076 conditions, 914 events. 577/914 cut-off events. For 198/221 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4326 event pairs, 20 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 619. Up to 436 conditions per place. [2024-11-28 03:13:40,955 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 62 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2024-11-28 03:13:40,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 84 transitions, 389 flow [2024-11-28 03:13:40,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:13:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 03:13:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2024-11-28 03:13:40,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6596638655462185 [2024-11-28 03:13:40,960 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 88 flow. Second operand 7 states and 157 transitions. [2024-11-28 03:13:40,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 84 transitions, 389 flow [2024-11-28 03:13:40,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 84 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:13:40,965 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 184 flow [2024-11-28 03:13:40,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2024-11-28 03:13:40,967 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2024-11-28 03:13:40,968 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 184 flow [2024-11-28 03:13:40,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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) [2024-11-28 03:13:40,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:13:40,968 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] [2024-11-28 03:13:40,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:13:40,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:13:40,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:40,971 INFO L85 PathProgramCache]: Analyzing trace with hash -397358025, now seen corresponding path program 2 times [2024-11-28 03:13:40,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:40,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118279651] [2024-11-28 03:13:40,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:13:40,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:41,007 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:13:41,011 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:13:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:13:41,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:41,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118279651] [2024-11-28 03:13:41,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118279651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:41,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:41,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:13:41,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590495481] [2024-11-28 03:13:41,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:41,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:13:41,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:41,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:13:41,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:13:41,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-11-28 03:13:41,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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) [2024-11-28 03:13:41,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:13:41,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-11-28 03:13:41,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:13:41,896 INFO L124 PetriNetUnfolderBase]: 698/1107 cut-off events. [2024-11-28 03:13:41,896 INFO L125 PetriNetUnfolderBase]: For 742/780 co-relation queries the response was YES. [2024-11-28 03:13:41,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2985 conditions, 1107 events. 698/1107 cut-off events. For 742/780 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5419 event pairs, 70 based on Foata normal form. 31/1097 useless extension candidates. Maximal degree in co-relation 2789. Up to 713 conditions per place. [2024-11-28 03:13:41,906 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 55 selfloop transitions, 21 changer transitions 2/86 dead transitions. [2024-11-28 03:13:41,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 86 transitions, 511 flow [2024-11-28 03:13:41,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:13:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 03:13:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2024-11-28 03:13:41,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.634453781512605 [2024-11-28 03:13:41,908 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 184 flow. Second operand 7 states and 151 transitions. [2024-11-28 03:13:41,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 86 transitions, 511 flow [2024-11-28 03:13:41,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 86 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:13:41,914 INFO L231 Difference]: Finished difference. Result has 52 places, 55 transitions, 340 flow [2024-11-28 03:13:41,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2024-11-28 03:13:41,915 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2024-11-28 03:13:41,915 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 55 transitions, 340 flow [2024-11-28 03:13:41,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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) [2024-11-28 03:13:41,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:13:41,915 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] [2024-11-28 03:13:41,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:13:41,916 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:13:41,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:41,916 INFO L85 PathProgramCache]: Analyzing trace with hash -844622991, now seen corresponding path program 3 times [2024-11-28 03:13:41,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:41,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131445727] [2024-11-28 03:13:41,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:13:41,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:41,935 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-28 03:13:41,935 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:13:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:13:42,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:42,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131445727] [2024-11-28 03:13:42,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131445727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:42,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:42,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:13:42,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809907907] [2024-11-28 03:13:42,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:42,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:13:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:42,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:13:42,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:13:42,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2024-11-28 03:13:42,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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) [2024-11-28 03:13:42,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:13:42,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2024-11-28 03:13:42,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:13:42,817 INFO L124 PetriNetUnfolderBase]: 1454/2181 cut-off events. [2024-11-28 03:13:42,817 INFO L125 PetriNetUnfolderBase]: For 2634/2702 co-relation queries the response was YES. [2024-11-28 03:13:42,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6874 conditions, 2181 events. 1454/2181 cut-off events. For 2634/2702 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 11379 event pairs, 123 based on Foata normal form. 31/2181 useless extension candidates. Maximal degree in co-relation 5199. Up to 915 conditions per place. [2024-11-28 03:13:42,840 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 84 selfloop transitions, 34 changer transitions 2/127 dead transitions. [2024-11-28 03:13:42,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 127 transitions, 872 flow [2024-11-28 03:13:42,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:13:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 03:13:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-11-28 03:13:42,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-11-28 03:13:42,845 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 340 flow. Second operand 8 states and 187 transitions. [2024-11-28 03:13:42,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 127 transitions, 872 flow [2024-11-28 03:13:42,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 830 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-28 03:13:42,870 INFO L231 Difference]: Finished difference. Result has 62 places, 68 transitions, 530 flow [2024-11-28 03:13:42,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=530, PETRI_PLACES=62, PETRI_TRANSITIONS=68} [2024-11-28 03:13:42,872 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 25 predicate places. [2024-11-28 03:13:42,873 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 68 transitions, 530 flow [2024-11-28 03:13:42,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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) [2024-11-28 03:13:42,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:13:42,873 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] [2024-11-28 03:13:42,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:13:42,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:13:42,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:42,875 INFO L85 PathProgramCache]: Analyzing trace with hash 164856335, now seen corresponding path program 4 times [2024-11-28 03:13:42,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:42,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739129277] [2024-11-28 03:13:42,876 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:13:42,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:42,909 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:13:42,909 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:13:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:13:43,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:43,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739129277] [2024-11-28 03:13:43,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739129277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:43,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:43,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:13:43,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556166490] [2024-11-28 03:13:43,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:43,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:13:43,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:43,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:13:43,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:13:43,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 34 [2024-11-28 03:13:43,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 68 transitions, 530 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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) [2024-11-28 03:13:43,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:13:43,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 34 [2024-11-28 03:13:43,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:13:44,127 INFO L124 PetriNetUnfolderBase]: 1354/2213 cut-off events. [2024-11-28 03:13:44,127 INFO L125 PetriNetUnfolderBase]: For 4633/4845 co-relation queries the response was YES. [2024-11-28 03:13:44,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7854 conditions, 2213 events. 1354/2213 cut-off events. For 4633/4845 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 13095 event pairs, 122 based on Foata normal form. 38/2186 useless extension candidates. Maximal degree in co-relation 5878. Up to 1474 conditions per place. [2024-11-28 03:13:44,152 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 82 selfloop transitions, 50 changer transitions 2/147 dead transitions. [2024-11-28 03:13:44,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 147 transitions, 1185 flow [2024-11-28 03:13:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:13:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-28 03:13:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 252 transitions. [2024-11-28 03:13:44,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6176470588235294 [2024-11-28 03:13:44,155 INFO L175 Difference]: Start difference. First operand has 62 places, 68 transitions, 530 flow. Second operand 12 states and 252 transitions. [2024-11-28 03:13:44,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 147 transitions, 1185 flow [2024-11-28 03:13:44,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 147 transitions, 1164 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-28 03:13:44,182 INFO L231 Difference]: Finished difference. Result has 79 places, 103 transitions, 932 flow [2024-11-28 03:13:44,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=932, PETRI_PLACES=79, PETRI_TRANSITIONS=103} [2024-11-28 03:13:44,183 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 42 predicate places. [2024-11-28 03:13:44,183 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 103 transitions, 932 flow [2024-11-28 03:13:44,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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) [2024-11-28 03:13:44,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:13:44,186 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] [2024-11-28 03:13:44,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:13:44,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:13:44,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:44,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1025771482, now seen corresponding path program 1 times [2024-11-28 03:13:44,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:44,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815765821] [2024-11-28 03:13:44,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:44,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:13:44,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:44,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815765821] [2024-11-28 03:13:44,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815765821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:44,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:44,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:13:44,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457979719] [2024-11-28 03:13:44,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:44,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:13:44,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:44,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:13:44,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:13:44,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2024-11-28 03:13:44,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 103 transitions, 932 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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) [2024-11-28 03:13:44,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:13:44,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2024-11-28 03:13:44,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:13:45,519 INFO L124 PetriNetUnfolderBase]: 2061/3147 cut-off events. [2024-11-28 03:13:45,520 INFO L125 PetriNetUnfolderBase]: For 11260/11426 co-relation queries the response was YES. [2024-11-28 03:13:45,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13092 conditions, 3147 events. 2061/3147 cut-off events. For 11260/11426 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 18043 event pairs, 206 based on Foata normal form. 51/3152 useless extension candidates. Maximal degree in co-relation 11708. Up to 1755 conditions per place. [2024-11-28 03:13:45,617 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 123 selfloop transitions, 34 changer transitions 2/166 dead transitions. [2024-11-28 03:13:45,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 166 transitions, 1620 flow [2024-11-28 03:13:45,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:13:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 03:13:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2024-11-28 03:13:45,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2024-11-28 03:13:45,621 INFO L175 Difference]: Start difference. First operand has 79 places, 103 transitions, 932 flow. Second operand 7 states and 154 transitions. [2024-11-28 03:13:45,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 166 transitions, 1620 flow [2024-11-28 03:13:45,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 166 transitions, 1461 flow, removed 70 selfloop flow, removed 1 redundant places. [2024-11-28 03:13:45,695 INFO L231 Difference]: Finished difference. Result has 88 places, 106 transitions, 976 flow [2024-11-28 03:13:45,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=976, PETRI_PLACES=88, PETRI_TRANSITIONS=106} [2024-11-28 03:13:45,698 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 51 predicate places. [2024-11-28 03:13:45,699 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 106 transitions, 976 flow [2024-11-28 03:13:45,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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) [2024-11-28 03:13:45,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:13:45,700 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] [2024-11-28 03:13:45,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:13:45,702 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:13:45,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:45,703 INFO L85 PathProgramCache]: Analyzing trace with hash -113011668, now seen corresponding path program 2 times [2024-11-28 03:13:45,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:45,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996724301] [2024-11-28 03:13:45,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:13:45,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:45,737 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:13:45,737 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:13:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:13:46,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:46,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996724301] [2024-11-28 03:13:46,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996724301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:46,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:46,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:13:46,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332385316] [2024-11-28 03:13:46,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:46,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:13:46,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:46,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:13:46,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:13:46,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-11-28 03:13:46,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 106 transitions, 976 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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) [2024-11-28 03:13:46,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:13:46,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-11-28 03:13:46,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:13:47,776 INFO L124 PetriNetUnfolderBase]: 2485/3894 cut-off events. [2024-11-28 03:13:47,776 INFO L125 PetriNetUnfolderBase]: For 18243/18536 co-relation queries the response was YES. [2024-11-28 03:13:47,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17221 conditions, 3894 events. 2485/3894 cut-off events. For 18243/18536 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 22437 event pairs, 346 based on Foata normal form. 39/3872 useless extension candidates. Maximal degree in co-relation 15385. Up to 3177 conditions per place. [2024-11-28 03:13:47,828 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 113 selfloop transitions, 45 changer transitions 3/172 dead transitions. [2024-11-28 03:13:47,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 172 transitions, 1777 flow [2024-11-28 03:13:47,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:13:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 03:13:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2024-11-28 03:13:47,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2024-11-28 03:13:47,830 INFO L175 Difference]: Start difference. First operand has 88 places, 106 transitions, 976 flow. Second operand 7 states and 154 transitions. [2024-11-28 03:13:47,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 172 transitions, 1777 flow [2024-11-28 03:13:47,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 172 transitions, 1741 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-28 03:13:47,920 INFO L231 Difference]: Finished difference. Result has 97 places, 128 transitions, 1410 flow [2024-11-28 03:13:47,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1410, PETRI_PLACES=97, PETRI_TRANSITIONS=128} [2024-11-28 03:13:47,922 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 60 predicate places. [2024-11-28 03:13:47,922 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 128 transitions, 1410 flow [2024-11-28 03:13:47,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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) [2024-11-28 03:13:47,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:13:47,923 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] [2024-11-28 03:13:47,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:13:47,923 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:13:47,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash -448690722, now seen corresponding path program 1 times [2024-11-28 03:13:47,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:47,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426684038] [2024-11-28 03:13:47,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:13:47,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:13:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:13:48,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:48,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426684038] [2024-11-28 03:13:48,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426684038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:48,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:48,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:13:48,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065806259] [2024-11-28 03:13:48,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:48,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:13:48,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:48,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:13:48,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:13:48,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-11-28 03:13:48,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 128 transitions, 1410 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-28 03:13:48,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:13:48,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-11-28 03:13:48,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:13:49,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L79-1-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~M~0=v_~M~0_22, ~q~0=v_~q~0_14, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][131], [24#L100true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 63#(and (= ~N~0 ~L~0) (<= 1 (mod ~L~0 4294967296))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), 88#true, Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 137#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 135#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 133#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 124#true, 15#L50true, Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 73#true, Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 48#true, 142#true, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), 6#L83true, Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 94#(<= 4294967295 (mod ~L~0 4294967296)), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 34#L72true, 112#true, 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 115#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 114#(= ~N~0 ~L~0), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 117#(< 0 (mod ~L~0 4294967296))]) [2024-11-28 03:13:49,065 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-28 03:13:49,066 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-28 03:13:49,066 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-11-28 03:13:49,066 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-11-28 03:13:49,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L79-1-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~M~0=v_~M~0_22, ~q~0=v_~q~0_14, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][131], [24#L100true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 63#(and (= ~N~0 ~L~0) (<= 1 (mod ~L~0 4294967296))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), 88#true, Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 137#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 135#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 133#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 124#true, Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), 15#L50true, Black: 73#true, Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 48#true, 142#true, 14#L63true, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), 6#L83true, Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 94#(<= 4294967295 (mod ~L~0 4294967296)), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 112#true, 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 115#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 114#(= ~N~0 ~L~0), Black: 117#(< 0 (mod ~L~0 4294967296)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-11-28 03:13:49,239 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-28 03:13:49,239 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 03:13:49,243 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-11-28 03:13:49,243 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-11-28 03:13:49,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L79-1-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~M~0=v_~M~0_22, ~q~0=v_~q~0_14, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][131], [24#L100true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 63#(and (= ~N~0 ~L~0) (<= 1 (mod ~L~0 4294967296))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), 88#true, Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 137#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 135#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 133#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 124#true, 15#L50true, Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 73#true, Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 48#true, 142#true, 8#thread2EXITtrue, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), 6#L83true, Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 94#(<= 4294967295 (mod ~L~0 4294967296)), 112#true, 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 115#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 114#(= ~N~0 ~L~0), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 117#(< 0 (mod ~L~0 4294967296))]) [2024-11-28 03:13:49,254 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-28 03:13:49,254 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 03:13:49,254 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-11-28 03:13:49,254 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-11-28 03:13:49,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L79-1-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~M~0=v_~M~0_22, ~q~0=v_~q~0_14, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][130], [24#L100true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 63#(and (= ~N~0 ~L~0) (<= 1 (mod ~L~0 4294967296))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), 88#true, Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 137#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 135#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 133#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 124#true, Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 73#true, Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 7#L44true, 48#true, 14#L63true, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), 6#L83true, Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 94#(<= 4294967295 (mod ~L~0 4294967296)), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 112#true, 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 115#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 114#(= ~N~0 ~L~0), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 117#(< 0 (mod ~L~0 4294967296)), 144#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))]) [2024-11-28 03:13:49,490 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-28 03:13:49,493 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 03:13:49,493 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-28 03:13:49,494 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 03:13:49,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L79-1-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~M~0=v_~M~0_22, ~q~0=v_~q~0_14, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][150], [24#L100true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 63#(and (= ~N~0 ~L~0) (<= 1 (mod ~L~0 4294967296))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), 88#true, Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 137#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 135#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 133#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 124#true, Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 73#true, Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 7#L44true, 48#true, 8#thread2EXITtrue, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), 6#L83true, Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 94#(<= 4294967295 (mod ~L~0 4294967296)), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 146#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)), 112#true, 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 115#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 114#(= ~N~0 ~L~0), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 117#(< 0 (mod ~L~0 4294967296))]) [2024-11-28 03:13:49,494 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-28 03:13:49,495 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 03:13:49,495 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-28 03:13:49,495 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 03:13:49,747 INFO L124 PetriNetUnfolderBase]: 4209/6701 cut-off events. [2024-11-28 03:13:49,748 INFO L125 PetriNetUnfolderBase]: For 42327/42950 co-relation queries the response was YES. [2024-11-28 03:13:49,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31748 conditions, 6701 events. 4209/6701 cut-off events. For 42327/42950 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 44156 event pairs, 639 based on Foata normal form. 28/6109 useless extension candidates. Maximal degree in co-relation 28415. Up to 2629 conditions per place. [2024-11-28 03:13:49,857 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 189 selfloop transitions, 128 changer transitions 6/336 dead transitions. [2024-11-28 03:13:49,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 336 transitions, 4123 flow [2024-11-28 03:13:49,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:13:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:13:49,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-11-28 03:13:49,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6519607843137255 [2024-11-28 03:13:49,859 INFO L175 Difference]: Start difference. First operand has 97 places, 128 transitions, 1410 flow. Second operand 6 states and 133 transitions. [2024-11-28 03:13:49,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 336 transitions, 4123 flow [2024-11-28 03:13:50,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 336 transitions, 3969 flow, removed 30 selfloop flow, removed 3 redundant places. [2024-11-28 03:13:50,090 INFO L231 Difference]: Finished difference. Result has 103 places, 237 transitions, 2960 flow [2024-11-28 03:13:50,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1333, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2960, PETRI_PLACES=103, PETRI_TRANSITIONS=237} [2024-11-28 03:13:50,094 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2024-11-28 03:13:50,096 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 237 transitions, 2960 flow [2024-11-28 03:13:50,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-28 03:13:50,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:13:50,096 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] [2024-11-28 03:13:50,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:13:50,097 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:13:50,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2132844804, now seen corresponding path program 2 times [2024-11-28 03:13:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:50,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10533865] [2024-11-28 03:13:50,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:13:50,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:50,221 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:13:50,223 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:13:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:13:50,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:50,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10533865] [2024-11-28 03:13:50,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10533865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:50,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:50,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:13:50,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848391255] [2024-11-28 03:13:50,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:50,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:13:50,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:50,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:13:50,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:13:50,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-11-28 03:13:50,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 237 transitions, 2960 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-28 03:13:50,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:13:50,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-11-28 03:13:50,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:13:52,392 INFO L124 PetriNetUnfolderBase]: 4863/7912 cut-off events. [2024-11-28 03:13:52,393 INFO L125 PetriNetUnfolderBase]: For 67645/68610 co-relation queries the response was YES. [2024-11-28 03:13:52,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43461 conditions, 7912 events. 4863/7912 cut-off events. For 67645/68610 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 54578 event pairs, 1193 based on Foata normal form. 55/7782 useless extension candidates. Maximal degree in co-relation 38572. Up to 3686 conditions per place. [2024-11-28 03:13:52,508 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 114 selfloop transitions, 167 changer transitions 3/297 dead transitions. [2024-11-28 03:13:52,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 297 transitions, 4006 flow [2024-11-28 03:13:52,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:13:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:13:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-11-28 03:13:52,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6647058823529411 [2024-11-28 03:13:52,510 INFO L175 Difference]: Start difference. First operand has 103 places, 237 transitions, 2960 flow. Second operand 5 states and 113 transitions. [2024-11-28 03:13:52,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 297 transitions, 4006 flow [2024-11-28 03:13:52,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 297 transitions, 3998 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-11-28 03:13:52,822 INFO L231 Difference]: Finished difference. Result has 110 places, 248 transitions, 3635 flow [2024-11-28 03:13:52,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2952, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3635, PETRI_PLACES=110, PETRI_TRANSITIONS=248} [2024-11-28 03:13:52,823 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 73 predicate places. [2024-11-28 03:13:52,823 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 248 transitions, 3635 flow [2024-11-28 03:13:52,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-28 03:13:52,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:13:52,823 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] [2024-11-28 03:13:52,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:13:52,824 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:13:52,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:52,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1909359092, now seen corresponding path program 3 times [2024-11-28 03:13:52,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:52,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510461970] [2024-11-28 03:13:52,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:13:52,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:52,846 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 03:13:52,846 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:13:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:13:53,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:53,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510461970] [2024-11-28 03:13:53,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510461970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:53,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:53,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:13:53,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8881208] [2024-11-28 03:13:53,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:53,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:13:53,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:53,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:13:53,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:13:53,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-11-28 03:13:53,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 248 transitions, 3635 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:13:53,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:13:53,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-11-28 03:13:53,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:13:55,317 INFO L124 PetriNetUnfolderBase]: 7195/11217 cut-off events. [2024-11-28 03:13:55,317 INFO L125 PetriNetUnfolderBase]: For 117968/119246 co-relation queries the response was YES. [2024-11-28 03:13:55,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65696 conditions, 11217 events. 7195/11217 cut-off events. For 117968/119246 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 75061 event pairs, 1409 based on Foata normal form. 191/11335 useless extension candidates. Maximal degree in co-relation 58417. Up to 3390 conditions per place. [2024-11-28 03:13:55,437 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 182 selfloop transitions, 211 changer transitions 2/405 dead transitions. [2024-11-28 03:13:55,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 405 transitions, 5966 flow [2024-11-28 03:13:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:13:55,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 03:13:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-11-28 03:13:55,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680672268907563 [2024-11-28 03:13:55,439 INFO L175 Difference]: Start difference. First operand has 110 places, 248 transitions, 3635 flow. Second operand 7 states and 162 transitions. [2024-11-28 03:13:55,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 405 transitions, 5966 flow [2024-11-28 03:13:56,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 405 transitions, 5730 flow, removed 24 selfloop flow, removed 1 redundant places. [2024-11-28 03:13:56,219 INFO L231 Difference]: Finished difference. Result has 120 places, 297 transitions, 4870 flow [2024-11-28 03:13:56,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3454, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4870, PETRI_PLACES=120, PETRI_TRANSITIONS=297} [2024-11-28 03:13:56,220 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 83 predicate places. [2024-11-28 03:13:56,221 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 297 transitions, 4870 flow [2024-11-28 03:13:56,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:13:56,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:13:56,222 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] [2024-11-28 03:13:56,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:13:56,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:13:56,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:56,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1880952990, now seen corresponding path program 4 times [2024-11-28 03:13:56,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:56,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242483400] [2024-11-28 03:13:56,225 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:13:56,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:56,242 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:13:56,242 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:13:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:13:56,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:56,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242483400] [2024-11-28 03:13:56,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242483400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:56,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:56,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:13:56,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938656489] [2024-11-28 03:13:56,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:56,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:13:56,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:56,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:13:56,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:13:56,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-11-28 03:13:56,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 297 transitions, 4870 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-28 03:13:56,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:13:56,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-11-28 03:13:56,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:13:58,495 INFO L124 PetriNetUnfolderBase]: 6157/9853 cut-off events. [2024-11-28 03:13:58,496 INFO L125 PetriNetUnfolderBase]: For 124166/125509 co-relation queries the response was YES. [2024-11-28 03:13:58,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63494 conditions, 9853 events. 6157/9853 cut-off events. For 124166/125509 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 68136 event pairs, 1772 based on Foata normal form. 83/9803 useless extension candidates. Maximal degree in co-relation 56179. Up to 5703 conditions per place. [2024-11-28 03:13:58,619 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 118 selfloop transitions, 201 changer transitions 5/343 dead transitions. [2024-11-28 03:13:58,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 343 transitions, 5809 flow [2024-11-28 03:13:58,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:13:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:13:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-11-28 03:13:58,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-11-28 03:13:58,621 INFO L175 Difference]: Start difference. First operand has 120 places, 297 transitions, 4870 flow. Second operand 5 states and 115 transitions. [2024-11-28 03:13:58,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 343 transitions, 5809 flow [2024-11-28 03:13:59,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 343 transitions, 5787 flow, removed 11 selfloop flow, removed 0 redundant places. [2024-11-28 03:13:59,299 INFO L231 Difference]: Finished difference. Result has 126 places, 291 transitions, 5212 flow [2024-11-28 03:13:59,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4774, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5212, PETRI_PLACES=126, PETRI_TRANSITIONS=291} [2024-11-28 03:13:59,300 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 89 predicate places. [2024-11-28 03:13:59,300 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 291 transitions, 5212 flow [2024-11-28 03:13:59,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-28 03:13:59,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:13:59,300 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] [2024-11-28 03:13:59,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:13:59,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:13:59,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:59,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1598088762, now seen corresponding path program 3 times [2024-11-28 03:13:59,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:13:59,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540023852] [2024-11-28 03:13:59,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:13:59,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:13:59,318 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 03:13:59,319 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:13:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:13:59,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:13:59,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540023852] [2024-11-28 03:13:59,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540023852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:13:59,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:13:59,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:13:59,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594224732] [2024-11-28 03:13:59,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:13:59,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:13:59,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:13:59,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:13:59,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:13:59,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-11-28 03:13:59,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 291 transitions, 5212 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2024-11-28 03:13:59,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:13:59,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-11-28 03:13:59,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:14:01,299 INFO L124 PetriNetUnfolderBase]: 4810/7832 cut-off events. [2024-11-28 03:14:01,300 INFO L125 PetriNetUnfolderBase]: For 104133/105535 co-relation queries the response was YES. [2024-11-28 03:14:01,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51951 conditions, 7832 events. 4810/7832 cut-off events. For 104133/105535 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 53611 event pairs, 689 based on Foata normal form. 272/7851 useless extension candidates. Maximal degree in co-relation 46614. Up to 6470 conditions per place. [2024-11-28 03:14:01,382 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 250 selfloop transitions, 44 changer transitions 8/328 dead transitions. [2024-11-28 03:14:01,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 328 transitions, 6060 flow [2024-11-28 03:14:01,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:14:01,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:14:01,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-11-28 03:14:01,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6647058823529411 [2024-11-28 03:14:01,383 INFO L175 Difference]: Start difference. First operand has 126 places, 291 transitions, 5212 flow. Second operand 5 states and 113 transitions. [2024-11-28 03:14:01,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 328 transitions, 6060 flow [2024-11-28 03:14:01,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 328 transitions, 5688 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-11-28 03:14:01,782 INFO L231 Difference]: Finished difference. Result has 130 places, 283 transitions, 4767 flow [2024-11-28 03:14:01,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4665, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4767, PETRI_PLACES=130, PETRI_TRANSITIONS=283} [2024-11-28 03:14:01,782 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 93 predicate places. [2024-11-28 03:14:01,783 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 283 transitions, 4767 flow [2024-11-28 03:14:01,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2024-11-28 03:14:01,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:14:01,783 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] [2024-11-28 03:14:01,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:14:01,784 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:14:01,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:14:01,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1054591634, now seen corresponding path program 5 times [2024-11-28 03:14:01,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:14:01,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425794558] [2024-11-28 03:14:01,784 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 03:14:01,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:14:01,803 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:14:01,804 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:14:02,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:14:02,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:14:02,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425794558] [2024-11-28 03:14:02,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425794558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:14:02,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412582906] [2024-11-28 03:14:02,064 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 03:14:02,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:14:02,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:14:02,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:14:02,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:14:02,153 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:14:02,154 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:14:02,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 03:14:02,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:14:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:14:02,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:14:03,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:14:03,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412582906] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:14:03,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:14:03,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2024-11-28 03:14:03,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287423062] [2024-11-28 03:14:03,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:14:03,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:14:03,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:14:03,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:14:03,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:14:03,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-11-28 03:14:03,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 283 transitions, 4767 flow. Second operand has 12 states, 12 states have (on average 12.75) internal successors, (153), 12 states have internal predecessors, (153), 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) [2024-11-28 03:14:03,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:14:03,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-11-28 03:14:03,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:14:11,249 INFO L124 PetriNetUnfolderBase]: 15491/23080 cut-off events. [2024-11-28 03:14:11,250 INFO L125 PetriNetUnfolderBase]: For 264121/264130 co-relation queries the response was YES. [2024-11-28 03:14:11,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145202 conditions, 23080 events. 15491/23080 cut-off events. For 264121/264130 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 155720 event pairs, 388 based on Foata normal form. 324/23398 useless extension candidates. Maximal degree in co-relation 131391. Up to 5837 conditions per place. [2024-11-28 03:14:11,637 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 447 selfloop transitions, 562 changer transitions 35/1048 dead transitions. [2024-11-28 03:14:11,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 1048 transitions, 16215 flow [2024-11-28 03:14:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-28 03:14:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-11-28 03:14:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 694 transitions. [2024-11-28 03:14:11,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5831932773109244 [2024-11-28 03:14:11,641 INFO L175 Difference]: Start difference. First operand has 130 places, 283 transitions, 4767 flow. Second operand 35 states and 694 transitions. [2024-11-28 03:14:11,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 1048 transitions, 16215 flow [2024-11-28 03:14:12,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 1048 transitions, 16085 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-11-28 03:14:12,561 INFO L231 Difference]: Finished difference. Result has 189 places, 710 transitions, 13515 flow [2024-11-28 03:14:12,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4697, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=13515, PETRI_PLACES=189, PETRI_TRANSITIONS=710} [2024-11-28 03:14:12,563 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 152 predicate places. [2024-11-28 03:14:12,563 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 710 transitions, 13515 flow [2024-11-28 03:14:12,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.75) internal successors, (153), 12 states have internal predecessors, (153), 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) [2024-11-28 03:14:12,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:14:12,563 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] [2024-11-28 03:14:12,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:14:12,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-28 03:14:12,768 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:14:12,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:14:12,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1210455752, now seen corresponding path program 6 times [2024-11-28 03:14:12,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:14:12,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334807858] [2024-11-28 03:14:12,768 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 03:14:12,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:14:12,781 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-28 03:14:12,782 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:14:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:14:12,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:14:12,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334807858] [2024-11-28 03:14:12,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334807858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:14:12,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:14:12,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:14:12,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327948882] [2024-11-28 03:14:12,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:14:12,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:14:12,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:14:12,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:14:12,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:14:12,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-11-28 03:14:12,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 710 transitions, 13515 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-28 03:14:12,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:14:12,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-11-28 03:14:12,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:14:18,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([256] L44-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][447], [Black: 137#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 133#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 201#(or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 350#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 370#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 376#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 15#L50true, Black: 398#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 145#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 356#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 148#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 144#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 374#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 392#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 204#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 358#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 368#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (= (mod ~N~0 4294967296) 1))))), 48#true, Black: 378#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 362#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 394#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 142#true, Black: 352#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 386#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 364#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 346#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 396#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 159#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 400#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 155#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 382#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 390#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (= (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), 73#true, Black: 372#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), Black: 309#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 380#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 360#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 117#(< 0 (mod ~L~0 4294967296)), Black: 384#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 170#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 172#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 169#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 168#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 167#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 199#true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 184#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 33#L79-1true, Black: 190#(= ~N~0 ~L~0), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 88#true, Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#true, 429#true, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 94#(<= 4294967295 (mod ~L~0 4294967296)), 34#L72true, 17#L99-4true, Black: 115#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 112#true, Black: 114#(= ~N~0 ~L~0)]) [2024-11-28 03:14:18,530 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-11-28 03:14:18,531 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-28 03:14:18,531 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-28 03:14:18,531 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-28 03:14:18,531 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([256] L44-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][454], [Black: 137#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 133#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 201#(or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 350#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 370#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 376#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 15#L50true, Black: 398#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 145#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 356#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 148#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 144#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 374#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 392#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 142#true, Black: 204#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 358#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 368#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (= (mod ~N~0 4294967296) 1))))), 48#true, Black: 378#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 362#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 394#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 352#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 386#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 364#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 346#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 396#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 159#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 400#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 155#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 382#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 390#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (= (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), 73#true, Black: 372#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), Black: 309#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 380#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 360#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 117#(< 0 (mod ~L~0 4294967296)), Black: 384#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 170#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 172#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 169#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 146#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 168#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 167#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 199#true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 184#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 33#L79-1true, Black: 190#(= ~N~0 ~L~0), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 88#true, Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#true, 429#true, 8#thread2EXITtrue, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 94#(<= 4294967295 (mod ~L~0 4294967296)), 17#L99-4true, Black: 115#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 112#true, Black: 114#(= ~N~0 ~L~0)]) [2024-11-28 03:14:18,531 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-11-28 03:14:18,531 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-28 03:14:18,531 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:14:18,531 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-28 03:14:18,589 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([256] L44-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][454], [Black: 137#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 133#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 201#(or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 350#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 370#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), 15#L50true, Black: 376#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 145#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 398#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 356#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 148#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 144#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 374#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 392#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 142#true, Black: 204#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 358#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 368#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (= (mod ~N~0 4294967296) 1))))), 48#true, Black: 378#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 362#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 394#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 352#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 386#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 364#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 346#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 396#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 159#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 400#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 155#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 382#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 390#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (= (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), 73#true, Black: 372#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), Black: 309#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 380#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 360#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 117#(< 0 (mod ~L~0 4294967296)), Black: 384#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 170#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 172#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 169#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 168#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 146#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 167#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 199#true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 184#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 33#L79-1true, Black: 190#(= ~N~0 ~L~0), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), 88#true, Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#true, 429#true, 8#thread2EXITtrue, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 94#(<= 4294967295 (mod ~L~0 4294967296)), 17#L99-4true, Black: 115#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 112#true, Black: 114#(= ~N~0 ~L~0)]) [2024-11-28 03:14:18,589 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-11-28 03:14:18,589 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-11-28 03:14:18,590 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:14:18,590 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-11-28 03:14:18,590 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:14:18,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([256] L44-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][239], [Black: 137#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 133#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 201#(or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 350#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 370#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 376#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 15#L50true, Black: 145#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 398#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 356#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 148#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 144#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 374#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 392#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 204#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 358#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 368#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (= (mod ~N~0 4294967296) 1))))), 48#true, Black: 378#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 362#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 394#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 142#true, Black: 352#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 386#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 364#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 346#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 396#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 159#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 400#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 155#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 382#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 390#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (= (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 372#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), Black: 309#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 380#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 117#(< 0 (mod ~L~0 4294967296)), Black: 360#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 170#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 172#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 169#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 168#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 167#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 199#true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 184#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 24#L100true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 33#L79-1true, Black: 190#(= ~N~0 ~L~0), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 88#true, Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 73#true, Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#true, 19#L69true, 429#true, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 94#(<= 4294967295 (mod ~L~0 4294967296)), 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 115#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 112#true, Black: 114#(= ~N~0 ~L~0)]) [2024-11-28 03:14:18,762 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-11-28 03:14:18,762 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:14:18,762 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-28 03:14:18,762 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 03:14:18,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([256] L44-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][454], [Black: 137#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 133#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 201#(or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 350#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 370#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), 15#L50true, Black: 376#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 145#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 398#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 356#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 148#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 144#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 374#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 392#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 142#true, Black: 204#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 358#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 368#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (= (mod ~N~0 4294967296) 1))))), 48#true, Black: 378#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 362#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 394#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 352#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 386#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 364#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 346#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 396#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 159#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 155#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 400#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 382#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 390#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (= (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), 73#true, Black: 372#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), Black: 309#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 380#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 360#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 117#(< 0 (mod ~L~0 4294967296)), Black: 384#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 170#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 172#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 169#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 146#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 168#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 167#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 199#true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 184#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 24#L100true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 33#L79-1true, Black: 190#(= ~N~0 ~L~0), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 88#true, Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#true, 429#true, 8#thread2EXITtrue, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 94#(<= 4294967295 (mod ~L~0 4294967296)), Black: 115#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 112#true, Black: 114#(= ~N~0 ~L~0)]) [2024-11-28 03:14:18,856 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-11-28 03:14:18,856 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:14:18,856 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:14:18,856 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:14:18,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([256] L44-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][558], [Black: 137#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 133#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 201#(or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 350#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 370#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), 15#L50true, Black: 376#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 398#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 145#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 148#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 356#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 374#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 144#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 392#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 142#true, Black: 358#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 368#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (= (mod ~N~0 4294967296) 1))))), 48#true, Black: 378#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 362#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 394#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 204#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 352#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 386#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 364#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 346#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 161#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 396#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 159#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 400#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 155#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 382#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 390#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (= (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), 73#true, Black: 199#true, Black: 372#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), Black: 309#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 380#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 360#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 117#(< 0 (mod ~L~0 4294967296)), Black: 384#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 170#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 172#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 169#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 146#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 168#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 167#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 184#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 24#L100true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 33#L79-1true, Black: 190#(= ~N~0 ~L~0), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 88#true, Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#true, 429#true, 8#thread2EXITtrue, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 94#(<= 4294967295 (mod ~L~0 4294967296)), Black: 115#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 112#true, Black: 114#(= ~N~0 ~L~0)]) [2024-11-28 03:14:18,861 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-11-28 03:14:18,861 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:14:18,861 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:14:18,861 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:14:19,206 INFO L124 PetriNetUnfolderBase]: 13229/20370 cut-off events. [2024-11-28 03:14:19,206 INFO L125 PetriNetUnfolderBase]: For 443830/445668 co-relation queries the response was YES. [2024-11-28 03:14:19,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163301 conditions, 20370 events. 13229/20370 cut-off events. For 443830/445668 co-relation queries the response was YES. Maximal size of possible extension queue 1414. Compared 147759 event pairs, 1967 based on Foata normal form. 452/20352 useless extension candidates. Maximal degree in co-relation 161001. Up to 8636 conditions per place. [2024-11-28 03:14:19,534 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 519 selfloop transitions, 433 changer transitions 6/1001 dead transitions. [2024-11-28 03:14:19,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 1001 transitions, 21019 flow [2024-11-28 03:14:19,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:14:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:14:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2024-11-28 03:14:19,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6127450980392157 [2024-11-28 03:14:19,536 INFO L175 Difference]: Start difference. First operand has 189 places, 710 transitions, 13515 flow. Second operand 6 states and 125 transitions. [2024-11-28 03:14:19,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 1001 transitions, 21019 flow [2024-11-28 03:14:23,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 1001 transitions, 19778 flow, removed 437 selfloop flow, removed 2 redundant places. [2024-11-28 03:14:23,243 INFO L231 Difference]: Finished difference. Result has 196 places, 871 transitions, 17535 flow [2024-11-28 03:14:23,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=12468, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=257, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=17535, PETRI_PLACES=196, PETRI_TRANSITIONS=871} [2024-11-28 03:14:23,245 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 159 predicate places. [2024-11-28 03:14:23,245 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 871 transitions, 17535 flow [2024-11-28 03:14:23,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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) [2024-11-28 03:14:23,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:14:23,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:14:23,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:14:23,245 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:14:23,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:14:23,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1494693050, now seen corresponding path program 7 times [2024-11-28 03:14:23,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:14:23,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745217866] [2024-11-28 03:14:23,246 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 03:14:23,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:14:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:14:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:14:23,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:14:23,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745217866] [2024-11-28 03:14:23,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745217866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:14:23,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:14:23,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:14:23,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793660507] [2024-11-28 03:14:23,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:14:23,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:14:23,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:14:23,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:14:23,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:14:23,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-11-28 03:14:23,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 871 transitions, 17535 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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) [2024-11-28 03:14:23,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:14:23,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-11-28 03:14:23,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:14:29,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([256] L44-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][624], [Black: 137#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 133#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 201#(or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 350#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 370#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 376#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 15#L50true, Black: 398#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 145#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 148#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 356#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 374#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 144#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 392#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 358#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 368#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (= (mod ~N~0 4294967296) 1))))), 48#true, Black: 378#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 362#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 394#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 204#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 352#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 386#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 364#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 346#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 396#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 159#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 155#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 400#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 382#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 390#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (= (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), 73#true, Black: 199#true, Black: 372#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), Black: 309#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 380#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 360#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 117#(< 0 (mod ~L~0 4294967296)), Black: 384#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 170#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 172#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 169#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 146#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 168#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 167#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 435#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 2 (mod ~N~0 4294967296))), Black: 433#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 432#(<= 2 (mod ~N~0 4294967296)), Black: 431#(or (< 1 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 184#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 441#true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 33#L79-1true, Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 62#(= ~N~0 ~L~0), 88#true, Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#true, 429#true, 8#thread2EXITtrue, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 94#(<= 4294967295 (mod ~L~0 4294967296)), 17#L99-4true, Black: 115#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 112#true, Black: 114#(= ~N~0 ~L~0)]) [2024-11-28 03:14:29,195 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-11-28 03:14:29,195 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:14:29,195 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-11-28 03:14:29,195 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-11-28 03:14:29,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L79-1-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~M~0=v_~M~0_22, ~q~0=v_~q~0_14, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][725], [Black: 137#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 133#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 201#(or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 350#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 370#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 376#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 398#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 145#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 356#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 148#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 144#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 374#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 392#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 204#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 358#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 48#true, Black: 368#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (= (mod ~N~0 4294967296) 1))))), Black: 378#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 362#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 394#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 352#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 386#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 364#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 346#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 159#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 396#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 400#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 155#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 390#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (= (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), 73#true, Black: 199#true, Black: 372#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), 6#L83true, Black: 309#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 380#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 360#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 384#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 170#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 172#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 169#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 146#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 168#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 167#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 112#true, 382#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 435#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 2 (mod ~N~0 4294967296))), Black: 433#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 432#(<= 2 (mod ~N~0 4294967296)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 431#(or (< 1 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 184#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 24#L100true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 88#true, Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#true, 7#L44true, 8#thread2EXITtrue, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), 443#(or (< 1 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 94#(<= 4294967295 (mod ~L~0 4294967296)), Black: 115#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 114#(= ~N~0 ~L~0), Black: 117#(< 0 (mod ~L~0 4294967296))]) [2024-11-28 03:14:29,582 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-28 03:14:29,582 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:14:29,582 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:14:29,582 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:14:29,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([256] L44-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][624], [Black: 137#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 133#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 201#(or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 350#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 370#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), 15#L50true, Black: 376#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 398#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 145#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 356#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 148#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 144#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 374#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 392#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 358#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 48#true, Black: 368#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (= (mod ~N~0 4294967296) 1))))), Black: 378#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 362#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 394#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 204#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 352#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 386#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 364#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 346#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 159#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 396#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 400#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 155#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 382#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 390#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (= (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), 73#true, Black: 199#true, Black: 372#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), Black: 309#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 380#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 360#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 117#(< 0 (mod ~L~0 4294967296)), Black: 384#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 170#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 172#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 169#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 146#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 168#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 167#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 435#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 2 (mod ~N~0 4294967296))), Black: 433#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 432#(<= 2 (mod ~N~0 4294967296)), Black: 431#(or (< 1 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 184#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 441#true, 24#L100true, 33#L79-1true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 88#true, Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#true, 429#true, 8#thread2EXITtrue, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 94#(<= 4294967295 (mod ~L~0 4294967296)), Black: 115#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 112#true, Black: 114#(= ~N~0 ~L~0)]) [2024-11-28 03:14:29,582 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-28 03:14:29,583 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:14:29,583 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:14:29,583 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:14:29,803 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([256] L44-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][624], [Black: 137#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 133#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 201#(or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))), Black: 350#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 370#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 376#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 15#L50true, Black: 398#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 145#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 356#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 148#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 144#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 374#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 392#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 358#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 368#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (= (mod ~N~0 4294967296) 1))))), 48#true, Black: 378#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 362#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 394#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 204#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 352#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 386#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 364#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 346#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0)), Black: 396#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 159#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 155#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 400#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (= (mod ~N~0 4294967296) 1))), Black: 382#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 390#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (<= 1 (mod ~N~0 4294967296)) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (= (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), 73#true, Black: 199#true, Black: 372#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), Black: 309#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 380#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 360#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), 117#(< 0 (mod ~L~0 4294967296)), Black: 384#(and (or (< 1 (mod ~N~0 4294967296)) (and (<= 0 (div thread2Thread1of1ForFork2_~cond~1 256)) (<= (mod thread2Thread1of1ForFork2_~cond~1 256) 0))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 170#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 172#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 169#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 168#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 146#(and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 167#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 435#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 2 (mod ~N~0 4294967296))), Black: 433#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 432#(<= 2 (mod ~N~0 4294967296)), Black: 431#(or (< 1 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 181#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 184#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 441#true, 24#L100true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 33#L79-1true, Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), 88#true, Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 165#true, 429#true, 8#thread2EXITtrue, Black: 96#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0)), Black: 102#(and (<= (+ ~L~0 1) ~N~0) (<= 4294967295 (mod ~L~0 4294967296)) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 98#(and (<= (+ ~L~0 1) ~N~0) (or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 100#(and (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0)) (<= (+ ~L~0 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 93#(or (< 4294967294 (mod ~L~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 92#(and (<= (+ ~L~0 1) ~N~0) (<= ~N~0 (+ (mod ~N~0 4294967296) ~L~0 1))), Black: 94#(<= 4294967295 (mod ~L~0 4294967296)), Black: 115#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 112#true, Black: 114#(= ~N~0 ~L~0)]) [2024-11-28 03:14:29,803 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-11-28 03:14:29,803 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:14:29,803 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:14:29,803 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-11-28 03:14:29,803 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:14:30,130 INFO L124 PetriNetUnfolderBase]: 15740/23922 cut-off events. [2024-11-28 03:14:30,130 INFO L125 PetriNetUnfolderBase]: For 520342/522874 co-relation queries the response was YES. [2024-11-28 03:14:30,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193822 conditions, 23922 events. 15740/23922 cut-off events. For 520342/522874 co-relation queries the response was YES. Maximal size of possible extension queue 1565. Compared 172547 event pairs, 1901 based on Foata normal form. 847/24298 useless extension candidates. Maximal degree in co-relation 191547. Up to 7929 conditions per place. [2024-11-28 03:14:30,474 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 570 selfloop transitions, 619 changer transitions 9/1241 dead transitions. [2024-11-28 03:14:30,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1241 transitions, 25873 flow [2024-11-28 03:14:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:14:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 03:14:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-11-28 03:14:30,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6013071895424836 [2024-11-28 03:14:30,476 INFO L175 Difference]: Start difference. First operand has 196 places, 871 transitions, 17535 flow. Second operand 9 states and 184 transitions. [2024-11-28 03:14:30,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1241 transitions, 25873 flow [2024-11-28 03:14:33,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 1241 transitions, 25278 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-11-28 03:14:33,310 INFO L231 Difference]: Finished difference. Result has 201 places, 1024 transitions, 21644 flow [2024-11-28 03:14:33,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=16959, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=866, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=454, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=21644, PETRI_PLACES=201, PETRI_TRANSITIONS=1024} [2024-11-28 03:14:33,311 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 164 predicate places. [2024-11-28 03:14:33,311 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 1024 transitions, 21644 flow [2024-11-28 03:14:33,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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) [2024-11-28 03:14:33,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:14:33,312 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] [2024-11-28 03:14:33,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:14:33,312 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:14:33,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:14:33,312 INFO L85 PathProgramCache]: Analyzing trace with hash -777775856, now seen corresponding path program 8 times [2024-11-28 03:14:33,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:14:33,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114120967] [2024-11-28 03:14:33,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:14:33,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:14:33,322 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:14:33,322 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:14:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:14:33,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:14:33,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114120967] [2024-11-28 03:14:33,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114120967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:14:33,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:14:33,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:14:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350475322] [2024-11-28 03:14:33,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:14:33,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:14:33,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:14:33,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:14:33,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:14:33,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-11-28 03:14:33,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 1024 transitions, 21644 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2024-11-28 03:14:33,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:14:33,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-11-28 03:14:33,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:14:39,803 INFO L124 PetriNetUnfolderBase]: 14988/23090 cut-off events. [2024-11-28 03:14:39,804 INFO L125 PetriNetUnfolderBase]: For 490029/491952 co-relation queries the response was YES. [2024-11-28 03:14:40,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190867 conditions, 23090 events. 14988/23090 cut-off events. For 490029/491952 co-relation queries the response was YES. Maximal size of possible extension queue 1541. Compared 167474 event pairs, 1121 based on Foata normal form. 268/22996 useless extension candidates. Maximal degree in co-relation 188618. Up to 18053 conditions per place. [2024-11-28 03:14:40,217 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 553 selfloop transitions, 60 changer transitions 2/1051 dead transitions. [2024-11-28 03:14:40,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1051 transitions, 23156 flow [2024-11-28 03:14:40,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:14:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:14:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-11-28 03:14:40,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2024-11-28 03:14:40,218 INFO L175 Difference]: Start difference. First operand has 201 places, 1024 transitions, 21644 flow. Second operand 5 states and 108 transitions. [2024-11-28 03:14:40,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1051 transitions, 23156 flow [2024-11-28 03:14:44,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 1051 transitions, 22179 flow, removed 104 selfloop flow, removed 8 redundant places. [2024-11-28 03:14:44,668 INFO L231 Difference]: Finished difference. Result has 197 places, 1025 transitions, 20835 flow [2024-11-28 03:14:44,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=20638, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1022, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=962, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=20835, PETRI_PLACES=197, PETRI_TRANSITIONS=1025} [2024-11-28 03:14:44,668 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 160 predicate places. [2024-11-28 03:14:44,669 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 1025 transitions, 20835 flow [2024-11-28 03:14:44,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2024-11-28 03:14:44,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:14:44,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:14:44,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:14:44,669 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:14:44,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:14:44,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1845103594, now seen corresponding path program 9 times [2024-11-28 03:14:44,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:14:44,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650885008] [2024-11-28 03:14:44,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:14:44,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:14:44,682 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 03:14:44,682 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:14:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:14:44,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:14:44,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650885008] [2024-11-28 03:14:44,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650885008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:14:44,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:14:44,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:14:44,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690319264] [2024-11-28 03:14:44,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:14:44,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:14:44,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:14:44,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:14:44,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:14:44,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-11-28 03:14:44,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 1025 transitions, 20835 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2024-11-28 03:14:44,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:14:44,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-11-28 03:14:44,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:14:52,824 INFO L124 PetriNetUnfolderBase]: 14956/23016 cut-off events. [2024-11-28 03:14:52,824 INFO L125 PetriNetUnfolderBase]: For 446578/448592 co-relation queries the response was YES. [2024-11-28 03:14:53,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183528 conditions, 23016 events. 14956/23016 cut-off events. For 446578/448592 co-relation queries the response was YES. Maximal size of possible extension queue 1542. Compared 166853 event pairs, 1031 based on Foata normal form. 291/22957 useless extension candidates. Maximal degree in co-relation 181337. Up to 18046 conditions per place. [2024-11-28 03:14:53,298 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 541 selfloop transitions, 70 changer transitions 1/1048 dead transitions. [2024-11-28 03:14:53,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1048 transitions, 22295 flow [2024-11-28 03:14:53,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:14:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:14:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-11-28 03:14:53,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.611764705882353 [2024-11-28 03:14:53,300 INFO L175 Difference]: Start difference. First operand has 197 places, 1025 transitions, 20835 flow. Second operand 5 states and 104 transitions. [2024-11-28 03:14:53,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 1048 transitions, 22295 flow [2024-11-28 03:14:58,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 1048 transitions, 21969 flow, removed 99 selfloop flow, removed 3 redundant places. [2024-11-28 03:14:58,136 INFO L231 Difference]: Finished difference. Result has 200 places, 1034 transitions, 20910 flow [2024-11-28 03:14:58,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=20524, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1025, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=962, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=20910, PETRI_PLACES=200, PETRI_TRANSITIONS=1034} [2024-11-28 03:14:58,137 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 163 predicate places. [2024-11-28 03:14:58,138 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 1034 transitions, 20910 flow [2024-11-28 03:14:58,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2024-11-28 03:14:58,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:14:58,138 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] [2024-11-28 03:14:58,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:14:58,138 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:14:58,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:14:58,139 INFO L85 PathProgramCache]: Analyzing trace with hash 730325828, now seen corresponding path program 10 times [2024-11-28 03:14:58,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:14:58,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018814946] [2024-11-28 03:14:58,140 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:14:58,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:14:58,153 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:14:58,154 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:14:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:14:58,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:14:58,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018814946] [2024-11-28 03:14:58,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018814946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:14:58,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:14:58,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:14:58,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243581019] [2024-11-28 03:14:58,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:14:58,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:14:58,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:14:58,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:14:58,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:14:58,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-11-28 03:14:58,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 1034 transitions, 20910 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2024-11-28 03:14:58,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:14:58,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-11-28 03:14:58,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:15:06,613 INFO L124 PetriNetUnfolderBase]: 15268/23578 cut-off events. [2024-11-28 03:15:06,613 INFO L125 PetriNetUnfolderBase]: For 448070/450080 co-relation queries the response was YES. [2024-11-28 03:15:06,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185727 conditions, 23578 events. 15268/23578 cut-off events. For 448070/450080 co-relation queries the response was YES. Maximal size of possible extension queue 1640. Compared 172789 event pairs, 1078 based on Foata normal form. 310/23492 useless extension candidates. Maximal degree in co-relation 183596. Up to 17924 conditions per place. [2024-11-28 03:15:07,069 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 600 selfloop transitions, 75 changer transitions 4/1112 dead transitions. [2024-11-28 03:15:07,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 1112 transitions, 23389 flow [2024-11-28 03:15:07,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:15:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:15:07,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-11-28 03:15:07,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6323529411764706 [2024-11-28 03:15:07,071 INFO L175 Difference]: Start difference. First operand has 200 places, 1034 transitions, 20910 flow. Second operand 6 states and 129 transitions. [2024-11-28 03:15:07,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 1112 transitions, 23389 flow [2024-11-28 03:15:10,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 1112 transitions, 23270 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-11-28 03:15:10,871 INFO L231 Difference]: Finished difference. Result has 200 places, 1035 transitions, 21017 flow [2024-11-28 03:15:10,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=20645, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1027, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=21017, PETRI_PLACES=200, PETRI_TRANSITIONS=1035} [2024-11-28 03:15:10,872 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 163 predicate places. [2024-11-28 03:15:10,872 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 1035 transitions, 21017 flow [2024-11-28 03:15:10,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2024-11-28 03:15:10,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:15:10,872 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:15:10,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:15:10,872 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:15:10,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:15:10,873 INFO L85 PathProgramCache]: Analyzing trace with hash -919132735, now seen corresponding path program 5 times [2024-11-28 03:15:10,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:15:10,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345498031] [2024-11-28 03:15:10,873 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 03:15:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:15:10,881 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:15:10,882 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:15:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:15:11,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:15:11,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345498031] [2024-11-28 03:15:11,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345498031] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:15:11,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274821552] [2024-11-28 03:15:11,141 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 03:15:11,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:15:11,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:15:11,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:15:11,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9d870ae7-f1d1-422d-9904-fe153b4bfdc4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:15:11,210 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:15:11,211 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:15:11,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 03:15:11,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:15:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:15:11,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:15:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:15:11,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274821552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:15:11,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:15:11,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2024-11-28 03:15:11,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463007393] [2024-11-28 03:15:11,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:15:11,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 03:15:11,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:15:11,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 03:15:11,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:15:11,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2024-11-28 03:15:11,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 1035 transitions, 21017 flow. Second operand has 16 states, 16 states have (on average 14.1875) internal successors, (227), 16 states have internal predecessors, (227), 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) [2024-11-28 03:15:11,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:15:11,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2024-11-28 03:15:11,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand