./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:53:30,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:53:31,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:53:31,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:53:31,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:53:31,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:53:31,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:53:31,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:53:31,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:53:31,041 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:53:31,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:53:31,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:53:31,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:53:31,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:53:31,043 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:53:31,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:53:31,044 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:53:31,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:53:31,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:53:31,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:53:31,045 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:53:31,046 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:53:31,046 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:53:31,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:53:31,047 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:53:31,047 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:53:31,048 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:53:31,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:53:31,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:53:31,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:53:31,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:53:31,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:53:31,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:53:31,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:53:31,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:53:31,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:53:31,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:53:31,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:53:31,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:53:31,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:53:31,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:53:31,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:53:31,053 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 [2024-11-19 09:53:31,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:53:31,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:53:31,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:53:31,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:53:31,331 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:53:31,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-11-19 09:53:32,826 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:53:33,010 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:53:33,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-11-19 09:53:33,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0211afd0/456f70bb49b44ac284605be5885b6295/FLAG1ef1f32e7 [2024-11-19 09:53:33,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0211afd0/456f70bb49b44ac284605be5885b6295 [2024-11-19 09:53:33,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:53:33,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:53:33,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:53:33,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:53:33,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:53:33,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:53:33" (1/1) ... [2024-11-19 09:53:33,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3c29fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:33, skipping insertion in model container [2024-11-19 09:53:33,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:53:33" (1/1) ... [2024-11-19 09:53:33,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:53:33,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:53:33,651 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:53:33,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:53:33,684 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:53:33,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:33 WrapperNode [2024-11-19 09:53:33,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:53:33,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:53:33,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:53:33,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:53:33,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:33" (1/1) ... [2024-11-19 09:53:33,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:33" (1/1) ... [2024-11-19 09:53:33,717 INFO L138 Inliner]: procedures = 21, calls = 23, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 116 [2024-11-19 09:53:33,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:53:33,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:53:33,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:53:33,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:53:33,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:33" (1/1) ... [2024-11-19 09:53:33,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:33" (1/1) ... [2024-11-19 09:53:33,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:33" (1/1) ... [2024-11-19 09:53:33,754 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-19 09:53:33,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:33" (1/1) ... [2024-11-19 09:53:33,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:33" (1/1) ... [2024-11-19 09:53:33,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:33" (1/1) ... [2024-11-19 09:53:33,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:33" (1/1) ... [2024-11-19 09:53:33,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:33" (1/1) ... [2024-11-19 09:53:33,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:33" (1/1) ... [2024-11-19 09:53:33,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:53:33,781 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:53:33,781 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:53:33,782 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:53:33,783 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:33" (1/1) ... [2024-11-19 09:53:33,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:53:33,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:33,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:53:33,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:53:33,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:53:33,878 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 09:53:33,879 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 09:53:33,879 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 09:53:33,880 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 09:53:33,880 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 09:53:33,880 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 09:53:33,880 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-19 09:53:33,881 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-19 09:53:33,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:53:33,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:53:33,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:53:33,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:53:33,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:53:33,883 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:53:33,999 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:53:34,002 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:53:34,327 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:53:34,328 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:53:34,510 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:53:34,511 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 09:53:34,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:53:34 BoogieIcfgContainer [2024-11-19 09:53:34,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:53:34,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:53:34,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:53:34,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:53:34,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:53:33" (1/3) ... [2024-11-19 09:53:34,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34886046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:53:34, skipping insertion in model container [2024-11-19 09:53:34,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:33" (2/3) ... [2024-11-19 09:53:34,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34886046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:53:34, skipping insertion in model container [2024-11-19 09:53:34,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:53:34" (3/3) ... [2024-11-19 09:53:34,522 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-11-19 09:53:34,541 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:53:34,542 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 09:53:34,542 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:53:34,604 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-19 09:53:34,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 104 flow [2024-11-19 09:53:34,680 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2024-11-19 09:53:34,680 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 09:53:34,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 34 events. 4/34 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2024-11-19 09:53:34,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 38 transitions, 104 flow [2024-11-19 09:53:34,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 33 transitions, 90 flow [2024-11-19 09:53:34,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:53:34,710 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;@58fb3519, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:53:34,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 09:53:34,729 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:53:34,731 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2024-11-19 09:53:34,731 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 09:53:34,731 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:34,732 INFO L204 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-19 09:53:34,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:53:34,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:34,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1645416888, now seen corresponding path program 1 times [2024-11-19 09:53:34,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:34,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245724327] [2024-11-19 09:53:34,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:34,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:35,072 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-19 09:53:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:35,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245724327] [2024-11-19 09:53:35,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245724327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:35,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:35,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:53:35,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625794197] [2024-11-19 09:53:35,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:35,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:53:35,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:35,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:53:35,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:53:35,112 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2024-11-19 09:53:35,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-19 09:53:35,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:35,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2024-11-19 09:53:35,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:35,475 INFO L124 PetriNetUnfolderBase]: 1184/1704 cut-off events. [2024-11-19 09:53:35,476 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-11-19 09:53:35,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3368 conditions, 1704 events. 1184/1704 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7305 event pairs, 182 based on Foata normal form. 45/1726 useless extension candidates. Maximal degree in co-relation 2858. Up to 1334 conditions per place. [2024-11-19 09:53:35,497 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 34 selfloop transitions, 3 changer transitions 2/48 dead transitions. [2024-11-19 09:53:35,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 219 flow [2024-11-19 09:53:35,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:53:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:53:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-11-19 09:53:35,512 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7456140350877193 [2024-11-19 09:53:35,514 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 90 flow. Second operand 3 states and 85 transitions. [2024-11-19 09:53:35,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 219 flow [2024-11-19 09:53:35,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-19 09:53:35,524 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 93 flow [2024-11-19 09:53:35,527 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2024-11-19 09:53:35,530 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2024-11-19 09:53:35,531 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 93 flow [2024-11-19 09:53:35,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-19 09:53:35,531 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:35,533 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:35,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:53:35,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:53:35,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:35,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1647341710, now seen corresponding path program 1 times [2024-11-19 09:53:35,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:35,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395077264] [2024-11-19 09:53:35,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:35,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:35,825 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-19 09:53:35,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:35,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395077264] [2024-11-19 09:53:35,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395077264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:35,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:35,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:53:35,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176054508] [2024-11-19 09:53:35,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:35,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:53:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:35,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:53:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:53:35,842 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-19 09:53:35,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:53:35,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:35,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-19 09:53:35,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:36,253 INFO L124 PetriNetUnfolderBase]: 1990/2821 cut-off events. [2024-11-19 09:53:36,254 INFO L125 PetriNetUnfolderBase]: For 694/738 co-relation queries the response was YES. [2024-11-19 09:53:36,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6514 conditions, 2821 events. 1990/2821 cut-off events. For 694/738 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 12985 event pairs, 331 based on Foata normal form. 8/2647 useless extension candidates. Maximal degree in co-relation 1262. Up to 1664 conditions per place. [2024-11-19 09:53:36,276 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 68 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2024-11-19 09:53:36,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 85 transitions, 398 flow [2024-11-19 09:53:36,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:53:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:53:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-11-19 09:53:36,280 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7315789473684211 [2024-11-19 09:53:36,281 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 93 flow. Second operand 5 states and 139 transitions. [2024-11-19 09:53:36,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 85 transitions, 398 flow [2024-11-19 09:53:36,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 85 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:53:36,284 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 155 flow [2024-11-19 09:53:36,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2024-11-19 09:53:36,286 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2024-11-19 09:53:36,286 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 155 flow [2024-11-19 09:53:36,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:53:36,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:36,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:36,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:53:36,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:53:36,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:36,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1609744724, now seen corresponding path program 2 times [2024-11-19 09:53:36,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:36,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834002613] [2024-11-19 09:53:36,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:36,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:36,317 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:53:36,318 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:36,511 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-19 09:53:36,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:36,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834002613] [2024-11-19 09:53:36,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834002613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:36,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734551417] [2024-11-19 09:53:36,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:36,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:36,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:36,515 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:36,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:53:36,602 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:53:36,603 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:36,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:53:36,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:36,766 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-19 09:53:36,766 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:36,850 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-19 09:53:36,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734551417] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:36,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:53:36,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 9 [2024-11-19 09:53:36,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404204847] [2024-11-19 09:53:36,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:36,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:53:36,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:36,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:53:36,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:53:36,858 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-19 09:53:36,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-19 09:53:36,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:36,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-19 09:53:36,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:37,222 INFO L124 PetriNetUnfolderBase]: 2797/3838 cut-off events. [2024-11-19 09:53:37,223 INFO L125 PetriNetUnfolderBase]: For 2128/2160 co-relation queries the response was YES. [2024-11-19 09:53:37,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10144 conditions, 3838 events. 2797/3838 cut-off events. For 2128/2160 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 17926 event pairs, 481 based on Foata normal form. 117/3901 useless extension candidates. Maximal degree in co-relation 1597. Up to 1606 conditions per place. [2024-11-19 09:53:37,251 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 59 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2024-11-19 09:53:37,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 74 transitions, 387 flow [2024-11-19 09:53:37,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:53:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:53:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-11-19 09:53:37,254 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7039473684210527 [2024-11-19 09:53:37,254 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 155 flow. Second operand 4 states and 107 transitions. [2024-11-19 09:53:37,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 74 transitions, 387 flow [2024-11-19 09:53:37,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 74 transitions, 387 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:53:37,257 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 195 flow [2024-11-19 09:53:37,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2024-11-19 09:53:37,258 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2024-11-19 09:53:37,258 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 195 flow [2024-11-19 09:53:37,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-19 09:53:37,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:37,259 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:37,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 09:53:37,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:37,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:53:37,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:37,460 INFO L85 PathProgramCache]: Analyzing trace with hash 522999774, now seen corresponding path program 1 times [2024-11-19 09:53:37,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:37,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405975727] [2024-11-19 09:53:37,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:37,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:37,548 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-19 09:53:37,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:37,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405975727] [2024-11-19 09:53:37,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405975727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:37,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:37,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:53:37,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820839979] [2024-11-19 09:53:37,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:37,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:53:37,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:37,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:53:37,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:53:37,560 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-19 09:53:37,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:53:37,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:37,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-19 09:53:37,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:37,980 INFO L124 PetriNetUnfolderBase]: 2799/3995 cut-off events. [2024-11-19 09:53:37,981 INFO L125 PetriNetUnfolderBase]: For 8125/8481 co-relation queries the response was YES. [2024-11-19 09:53:37,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12976 conditions, 3995 events. 2799/3995 cut-off events. For 8125/8481 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 20475 event pairs, 593 based on Foata normal form. 6/3636 useless extension candidates. Maximal degree in co-relation 4958. Up to 3079 conditions per place. [2024-11-19 09:53:38,018 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 60 selfloop transitions, 8 changer transitions 10/89 dead transitions. [2024-11-19 09:53:38,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 531 flow [2024-11-19 09:53:38,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:53:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:53:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-11-19 09:53:38,022 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7052631578947368 [2024-11-19 09:53:38,022 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 195 flow. Second operand 5 states and 134 transitions. [2024-11-19 09:53:38,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 531 flow [2024-11-19 09:53:38,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 89 transitions, 531 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:53:38,033 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 255 flow [2024-11-19 09:53:38,033 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=255, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2024-11-19 09:53:38,034 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2024-11-19 09:53:38,035 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 255 flow [2024-11-19 09:53:38,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:53:38,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:38,036 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:38,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:53:38,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:53:38,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:38,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1266768156, now seen corresponding path program 2 times [2024-11-19 09:53:38,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:38,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821073311] [2024-11-19 09:53:38,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:38,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:38,054 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:53:38,054 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:38,175 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-19 09:53:38,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:38,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821073311] [2024-11-19 09:53:38,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821073311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:38,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:38,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:53:38,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344518412] [2024-11-19 09:53:38,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:38,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:53:38,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:38,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:53:38,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:53:38,181 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-19 09:53:38,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-19 09:53:38,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:38,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-19 09:53:38,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:38,651 INFO L124 PetriNetUnfolderBase]: 4095/5705 cut-off events. [2024-11-19 09:53:38,651 INFO L125 PetriNetUnfolderBase]: For 9520/9668 co-relation queries the response was YES. [2024-11-19 09:53:38,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19144 conditions, 5705 events. 4095/5705 cut-off events. For 9520/9668 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 29195 event pairs, 605 based on Foata normal form. 53/5655 useless extension candidates. Maximal degree in co-relation 8919. Up to 4435 conditions per place. [2024-11-19 09:53:38,697 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 64 selfloop transitions, 8 changer transitions 8/88 dead transitions. [2024-11-19 09:53:38,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 615 flow [2024-11-19 09:53:38,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:53:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:53:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2024-11-19 09:53:38,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6973684210526315 [2024-11-19 09:53:38,699 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 255 flow. Second operand 4 states and 106 transitions. [2024-11-19 09:53:38,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 615 flow [2024-11-19 09:53:38,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 88 transitions, 599 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-19 09:53:38,706 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 319 flow [2024-11-19 09:53:38,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2024-11-19 09:53:38,707 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2024-11-19 09:53:38,707 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 319 flow [2024-11-19 09:53:38,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-19 09:53:38,707 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:38,708 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:38,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:53:38,708 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:53:38,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:38,709 INFO L85 PathProgramCache]: Analyzing trace with hash 152237776, now seen corresponding path program 3 times [2024-11-19 09:53:38,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:38,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647535597] [2024-11-19 09:53:38,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:53:38,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:38,722 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 09:53:38,723 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:38,795 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-19 09:53:38,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:38,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647535597] [2024-11-19 09:53:38,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647535597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:38,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:38,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:53:38,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642801556] [2024-11-19 09:53:38,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:38,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:53:38,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:38,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:53:38,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:53:38,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-19 09:53:38,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 319 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:53:38,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:38,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-19 09:53:38,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:39,350 INFO L124 PetriNetUnfolderBase]: 3464/4985 cut-off events. [2024-11-19 09:53:39,350 INFO L125 PetriNetUnfolderBase]: For 14144/14510 co-relation queries the response was YES. [2024-11-19 09:53:39,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19207 conditions, 4985 events. 3464/4985 cut-off events. For 14144/14510 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 26931 event pairs, 609 based on Foata normal form. 54/4918 useless extension candidates. Maximal degree in co-relation 9091. Up to 3397 conditions per place. [2024-11-19 09:53:39,389 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 66 selfloop transitions, 8 changer transitions 13/100 dead transitions. [2024-11-19 09:53:39,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 100 transitions, 730 flow [2024-11-19 09:53:39,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:53:39,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:53:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-11-19 09:53:39,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7052631578947368 [2024-11-19 09:53:39,392 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 319 flow. Second operand 5 states and 134 transitions. [2024-11-19 09:53:39,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 100 transitions, 730 flow [2024-11-19 09:53:39,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 724 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:53:39,400 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 360 flow [2024-11-19 09:53:39,400 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=360, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2024-11-19 09:53:39,401 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2024-11-19 09:53:39,402 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 360 flow [2024-11-19 09:53:39,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:53:39,402 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:39,402 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:39,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:53:39,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:53:39,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:39,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1611859778, now seen corresponding path program 4 times [2024-11-19 09:53:39,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:39,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870561056] [2024-11-19 09:53:39,404 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:53:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:39,421 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:53:39,422 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:39,474 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-19 09:53:39,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:39,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870561056] [2024-11-19 09:53:39,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870561056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:39,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:39,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:53:39,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578410331] [2024-11-19 09:53:39,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:39,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:53:39,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:39,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:53:39,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:53:39,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-19 09:53:39,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 360 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-19 09:53:39,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:39,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-19 09:53:39,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:40,202 INFO L124 PetriNetUnfolderBase]: 3587/5029 cut-off events. [2024-11-19 09:53:40,202 INFO L125 PetriNetUnfolderBase]: For 17220/17517 co-relation queries the response was YES. [2024-11-19 09:53:40,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20309 conditions, 5029 events. 3587/5029 cut-off events. For 17220/17517 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 26228 event pairs, 590 based on Foata normal form. 279/5297 useless extension candidates. Maximal degree in co-relation 12811. Up to 2720 conditions per place. [2024-11-19 09:53:40,238 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 74 selfloop transitions, 13 changer transitions 11/109 dead transitions. [2024-11-19 09:53:40,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 109 transitions, 884 flow [2024-11-19 09:53:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:53:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:53:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-11-19 09:53:40,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6947368421052632 [2024-11-19 09:53:40,240 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 360 flow. Second operand 5 states and 132 transitions. [2024-11-19 09:53:40,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 109 transitions, 884 flow [2024-11-19 09:53:40,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 862 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-19 09:53:40,248 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 418 flow [2024-11-19 09:53:40,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=418, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2024-11-19 09:53:40,249 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2024-11-19 09:53:40,250 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 418 flow [2024-11-19 09:53:40,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-19 09:53:40,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:40,250 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:40,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:53:40,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:53:40,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:40,251 INFO L85 PathProgramCache]: Analyzing trace with hash -654886344, now seen corresponding path program 1 times [2024-11-19 09:53:40,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:40,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401619916] [2024-11-19 09:53:40,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:40,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:53:40,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:40,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401619916] [2024-11-19 09:53:40,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401619916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:40,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:40,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:53:40,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175289551] [2024-11-19 09:53:40,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:40,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:53:40,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:40,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:53:40,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:53:40,422 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-19 09:53:40,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 418 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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-19 09:53:40,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:40,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-19 09:53:40,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:40,954 INFO L124 PetriNetUnfolderBase]: 3376/4815 cut-off events. [2024-11-19 09:53:40,954 INFO L125 PetriNetUnfolderBase]: For 22662/23237 co-relation queries the response was YES. [2024-11-19 09:53:40,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21083 conditions, 4815 events. 3376/4815 cut-off events. For 22662/23237 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 25233 event pairs, 892 based on Foata normal form. 146/4833 useless extension candidates. Maximal degree in co-relation 9983. Up to 3939 conditions per place. [2024-11-19 09:53:41,001 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 60 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2024-11-19 09:53:41,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 86 transitions, 786 flow [2024-11-19 09:53:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:53:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:53:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-11-19 09:53:41,003 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6381578947368421 [2024-11-19 09:53:41,003 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 418 flow. Second operand 4 states and 97 transitions. [2024-11-19 09:53:41,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 86 transitions, 786 flow [2024-11-19 09:53:41,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 86 transitions, 758 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-11-19 09:53:41,020 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 510 flow [2024-11-19 09:53:41,020 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=510, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2024-11-19 09:53:41,023 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2024-11-19 09:53:41,023 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 510 flow [2024-11-19 09:53:41,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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-19 09:53:41,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:41,024 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:41,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:53:41,024 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:53:41,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:41,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1678103974, now seen corresponding path program 2 times [2024-11-19 09:53:41,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:41,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849449876] [2024-11-19 09:53:41,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:41,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:41,036 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:53:41,037 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:53:41,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:41,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849449876] [2024-11-19 09:53:41,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849449876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:41,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266041913] [2024-11-19 09:53:41,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:41,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:41,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:41,179 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:41,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:53:41,260 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:53:41,261 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:41,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:53:41,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:53:41,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:53:41,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266041913] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:41,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:53:41,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 9 [2024-11-19 09:53:41,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472708251] [2024-11-19 09:53:41,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:41,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:53:41,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:41,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:53:41,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:53:41,445 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-19 09:53:41,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 510 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-19 09:53:41,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:41,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-19 09:53:41,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:41,972 INFO L124 PetriNetUnfolderBase]: 3460/4850 cut-off events. [2024-11-19 09:53:41,972 INFO L125 PetriNetUnfolderBase]: For 21431/21621 co-relation queries the response was YES. [2024-11-19 09:53:41,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21922 conditions, 4850 events. 3460/4850 cut-off events. For 21431/21621 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 24513 event pairs, 614 based on Foata normal form. 185/5014 useless extension candidates. Maximal degree in co-relation 12503. Up to 2183 conditions per place. [2024-11-19 09:53:42,031 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 85 selfloop transitions, 12 changer transitions 1/109 dead transitions. [2024-11-19 09:53:42,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 109 transitions, 985 flow [2024-11-19 09:53:42,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:53:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:53:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-19 09:53:42,033 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7105263157894737 [2024-11-19 09:53:42,033 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 510 flow. Second operand 4 states and 108 transitions. [2024-11-19 09:53:42,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 109 transitions, 985 flow [2024-11-19 09:53:42,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 109 transitions, 985 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:53:42,050 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 572 flow [2024-11-19 09:53:42,051 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=572, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2024-11-19 09:53:42,053 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2024-11-19 09:53:42,053 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 572 flow [2024-11-19 09:53:42,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-19 09:53:42,053 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:42,053 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:42,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 09:53:42,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-19 09:53:42,254 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:53:42,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash -652813186, now seen corresponding path program 3 times [2024-11-19 09:53:42,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:42,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615994206] [2024-11-19 09:53:42,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:53:42,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:42,267 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 09:53:42,268 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:42,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:53:42,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:42,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615994206] [2024-11-19 09:53:42,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615994206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:42,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:42,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:53:42,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449078455] [2024-11-19 09:53:42,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:42,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:53:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:42,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:53:42,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:53:42,348 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-19 09:53:42,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 572 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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-19 09:53:42,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:42,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-19 09:53:42,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:42,675 INFO L124 PetriNetUnfolderBase]: 2860/4080 cut-off events. [2024-11-19 09:53:42,676 INFO L125 PetriNetUnfolderBase]: For 23443/24159 co-relation queries the response was YES. [2024-11-19 09:53:42,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20073 conditions, 4080 events. 2860/4080 cut-off events. For 23443/24159 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 20457 event pairs, 836 based on Foata normal form. 95/4086 useless extension candidates. Maximal degree in co-relation 13489. Up to 3623 conditions per place. [2024-11-19 09:53:42,725 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 51 selfloop transitions, 4 changer transitions 5/77 dead transitions. [2024-11-19 09:53:42,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 77 transitions, 704 flow [2024-11-19 09:53:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:53:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:53:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-11-19 09:53:42,727 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2024-11-19 09:53:42,727 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 572 flow. Second operand 4 states and 92 transitions. [2024-11-19 09:53:42,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 77 transitions, 704 flow [2024-11-19 09:53:42,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 77 transitions, 704 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:53:42,739 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 528 flow [2024-11-19 09:53:42,740 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=528, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2024-11-19 09:53:42,740 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2024-11-19 09:53:42,741 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 528 flow [2024-11-19 09:53:42,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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-19 09:53:42,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:42,741 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:42,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:53:42,742 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:53:42,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:42,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2019249940, now seen corresponding path program 1 times [2024-11-19 09:53:42,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920208489] [2024-11-19 09:53:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:42,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:42,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920208489] [2024-11-19 09:53:42,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920208489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:42,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376999408] [2024-11-19 09:53:42,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:42,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:42,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:42,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:42,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 09:53:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:42,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:53:42,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:53:43,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:53:43,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376999408] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:43,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:53:43,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 3] total 10 [2024-11-19 09:53:43,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437241647] [2024-11-19 09:53:43,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:43,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:53:43,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:43,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:53:43,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:53:43,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-19 09:53:43,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 528 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-19 09:53:43,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:43,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-19 09:53:43,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:43,703 INFO L124 PetriNetUnfolderBase]: 3783/5379 cut-off events. [2024-11-19 09:53:43,703 INFO L125 PetriNetUnfolderBase]: For 33441/34230 co-relation queries the response was YES. [2024-11-19 09:53:43,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26051 conditions, 5379 events. 3783/5379 cut-off events. For 33441/34230 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 26849 event pairs, 686 based on Foata normal form. 268/5549 useless extension candidates. Maximal degree in co-relation 14112. Up to 2434 conditions per place. [2024-11-19 09:53:43,750 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 79 selfloop transitions, 13 changer transitions 0/108 dead transitions. [2024-11-19 09:53:43,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 108 transitions, 1079 flow [2024-11-19 09:53:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:53:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:53:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-11-19 09:53:43,755 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6842105263157895 [2024-11-19 09:53:43,755 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 528 flow. Second operand 4 states and 104 transitions. [2024-11-19 09:53:43,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 108 transitions, 1079 flow [2024-11-19 09:53:43,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 108 transitions, 1054 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-19 09:53:43,773 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 649 flow [2024-11-19 09:53:43,773 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=649, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2024-11-19 09:53:43,773 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2024-11-19 09:53:43,773 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 649 flow [2024-11-19 09:53:43,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-19 09:53:43,774 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:43,774 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:43,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 09:53:43,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:43,975 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:53:43,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:43,975 INFO L85 PathProgramCache]: Analyzing trace with hash -837348424, now seen corresponding path program 1 times [2024-11-19 09:53:43,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:43,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037310265] [2024-11-19 09:53:43,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:43,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:53:44,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:44,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037310265] [2024-11-19 09:53:44,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037310265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:44,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311393425] [2024-11-19 09:53:44,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:44,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:44,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:44,079 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:44,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 09:53:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:44,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:53:44,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:44,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:44,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311393425] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:44,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:44,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 5 [2024-11-19 09:53:44,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734485863] [2024-11-19 09:53:44,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:44,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:53:44,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:44,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:53:44,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:53:44,262 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2024-11-19 09:53:44,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 649 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-19 09:53:44,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:44,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2024-11-19 09:53:44,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:45,016 INFO L124 PetriNetUnfolderBase]: 6743/10372 cut-off events. [2024-11-19 09:53:45,017 INFO L125 PetriNetUnfolderBase]: For 74392/76368 co-relation queries the response was YES. [2024-11-19 09:53:45,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54560 conditions, 10372 events. 6743/10372 cut-off events. For 74392/76368 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 66474 event pairs, 1735 based on Foata normal form. 849/11028 useless extension candidates. Maximal degree in co-relation 38292. Up to 4454 conditions per place. [2024-11-19 09:53:45,100 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 85 selfloop transitions, 21 changer transitions 2/136 dead transitions. [2024-11-19 09:53:45,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 136 transitions, 1469 flow [2024-11-19 09:53:45,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:53:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:53:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2024-11-19 09:53:45,101 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7763157894736842 [2024-11-19 09:53:45,101 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 649 flow. Second operand 4 states and 118 transitions. [2024-11-19 09:53:45,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 136 transitions, 1469 flow [2024-11-19 09:53:45,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 136 transitions, 1461 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-11-19 09:53:45,128 INFO L231 Difference]: Finished difference. Result has 78 places, 87 transitions, 953 flow [2024-11-19 09:53:45,128 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=953, PETRI_PLACES=78, PETRI_TRANSITIONS=87} [2024-11-19 09:53:45,129 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2024-11-19 09:53:45,129 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 87 transitions, 953 flow [2024-11-19 09:53:45,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-19 09:53:45,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:45,129 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:45,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:53:45,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:45,330 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:53:45,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:45,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2053421388, now seen corresponding path program 2 times [2024-11-19 09:53:45,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:45,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787244368] [2024-11-19 09:53:45,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:45,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:45,343 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:53:45,343 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:45,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:45,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787244368] [2024-11-19 09:53:45,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787244368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:45,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160691331] [2024-11-19 09:53:45,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:45,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:45,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:45,427 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:45,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 09:53:45,505 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:53:45,505 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:45,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:53:45,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:45,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:45,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160691331] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:45,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:45,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 7 [2024-11-19 09:53:45,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952996830] [2024-11-19 09:53:45,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:45,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:53:45,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:45,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:53:45,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:53:45,620 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2024-11-19 09:53:45,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 87 transitions, 953 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 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-19 09:53:45,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:45,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2024-11-19 09:53:45,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:47,480 INFO L124 PetriNetUnfolderBase]: 13295/20383 cut-off events. [2024-11-19 09:53:47,481 INFO L125 PetriNetUnfolderBase]: For 199361/203341 co-relation queries the response was YES. [2024-11-19 09:53:48,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119222 conditions, 20383 events. 13295/20383 cut-off events. For 199361/203341 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 144637 event pairs, 2655 based on Foata normal form. 1048/21022 useless extension candidates. Maximal degree in co-relation 84247. Up to 7652 conditions per place. [2024-11-19 09:53:48,142 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 111 selfloop transitions, 50 changer transitions 1/190 dead transitions. [2024-11-19 09:53:48,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 190 transitions, 2290 flow [2024-11-19 09:53:48,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:53:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:53:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-11-19 09:53:48,143 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8 [2024-11-19 09:53:48,143 INFO L175 Difference]: Start difference. First operand has 78 places, 87 transitions, 953 flow. Second operand 5 states and 152 transitions. [2024-11-19 09:53:48,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 190 transitions, 2290 flow [2024-11-19 09:53:48,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 190 transitions, 2266 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-11-19 09:53:48,203 INFO L231 Difference]: Finished difference. Result has 84 places, 116 transitions, 1507 flow [2024-11-19 09:53:48,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1507, PETRI_PLACES=84, PETRI_TRANSITIONS=116} [2024-11-19 09:53:48,204 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2024-11-19 09:53:48,204 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 116 transitions, 1507 flow [2024-11-19 09:53:48,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 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-19 09:53:48,204 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:48,205 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:48,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 09:53:48,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 09:53:48,406 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:53:48,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:48,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1933318530, now seen corresponding path program 3 times [2024-11-19 09:53:48,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:48,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477559006] [2024-11-19 09:53:48,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:53:48,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:48,424 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 09:53:48,424 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:48,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:48,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477559006] [2024-11-19 09:53:48,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477559006] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:48,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954286344] [2024-11-19 09:53:48,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:53:48,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:48,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:48,523 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:48,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 09:53:48,599 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 09:53:48,600 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:48,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:53:48,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:53:48,747 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:53:48,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954286344] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:48,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:48,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-19 09:53:48,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078476572] [2024-11-19 09:53:48,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:48,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:53:48,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:48,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:53:48,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:53:48,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-19 09:53:48,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 116 transitions, 1507 flow. Second operand has 13 states, 13 states have (on average 16.846153846153847) internal successors, (219), 13 states have internal predecessors, (219), 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-19 09:53:48,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:48,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-19 09:53:48,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:55,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][594], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 1149#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i2~0 ~N2~0)), 33#$Ultimate##0true, 806#(= ~counter~0 0), 251#true, 164#(< ~i2~0 ~N2~0), 366#(< ~j1~0 ~M1~0), 54#true, 242#true, Black: 63#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 19#L99-1true, 23#L79true, Black: 808#(= ~counter~0 2), 8#L52true, Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 618#(= ~counter~0 0), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 259#true, 434#true, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:53:55,858 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:53:55,858 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:53:55,858 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:53:55,858 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:53:56,649 INFO L124 PetriNetUnfolderBase]: 47407/67691 cut-off events. [2024-11-19 09:53:56,649 INFO L125 PetriNetUnfolderBase]: For 607378/613850 co-relation queries the response was YES. [2024-11-19 09:53:56,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400732 conditions, 67691 events. 47407/67691 cut-off events. For 607378/613850 co-relation queries the response was YES. Maximal size of possible extension queue 2772. Compared 479087 event pairs, 3151 based on Foata normal form. 1403/68790 useless extension candidates. Maximal degree in co-relation 322001. Up to 20158 conditions per place. [2024-11-19 09:53:57,280 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 582 selfloop transitions, 96 changer transitions 68/763 dead transitions. [2024-11-19 09:53:57,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 763 transitions, 10902 flow [2024-11-19 09:53:57,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 09:53:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-19 09:53:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 524 transitions. [2024-11-19 09:53:57,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.656641604010025 [2024-11-19 09:53:57,284 INFO L175 Difference]: Start difference. First operand has 84 places, 116 transitions, 1507 flow. Second operand 21 states and 524 transitions. [2024-11-19 09:53:57,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 763 transitions, 10902 flow [2024-11-19 09:53:57,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 763 transitions, 10314 flow, removed 294 selfloop flow, removed 0 redundant places. [2024-11-19 09:53:57,961 INFO L231 Difference]: Finished difference. Result has 117 places, 206 transitions, 3169 flow [2024-11-19 09:53:57,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3169, PETRI_PLACES=117, PETRI_TRANSITIONS=206} [2024-11-19 09:53:57,962 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2024-11-19 09:53:57,963 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 206 transitions, 3169 flow [2024-11-19 09:53:57,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.846153846153847) internal successors, (219), 13 states have internal predecessors, (219), 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-19 09:53:57,963 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:57,963 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:57,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 09:53:58,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:58,164 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 09:53:58,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:58,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1459472144, now seen corresponding path program 4 times [2024-11-19 09:53:58,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:58,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509710236] [2024-11-19 09:53:58,165 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:53:58,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:58,178 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:53:58,178 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:58,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:58,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509710236] [2024-11-19 09:53:58,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509710236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:58,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688370859] [2024-11-19 09:53:58,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:53:58,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:58,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:58,254 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:58,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 09:53:58,326 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:53:58,327 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:58,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:53:58,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:53:58,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:53:58,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688370859] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:58,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:58,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-19 09:53:58,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336180434] [2024-11-19 09:53:58,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:58,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:53:58,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:58,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:53:58,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:53:58,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-11-19 09:53:58,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 206 transitions, 3169 flow. Second operand has 14 states, 14 states have (on average 16.214285714285715) internal successors, (227), 14 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-19 09:53:58,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:58,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-11-19 09:53:58,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:15,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][911], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 1515#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 618#(= ~counter~0 0), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 63#true, 19#L99-1true, 23#L79true, Black: 808#(= ~counter~0 2), 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 9#L67true, Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), 11#thread2EXITtrue, Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:15,951 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 09:54:15,951 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:15,951 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-19 09:54:15,951 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-19 09:54:16,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1609], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 251#true, 164#(< ~i2~0 ~N2~0), 54#true, 15#L98-4true, Black: 619#(= ~counter~0 1), 9#L67true, Black: 618#(= ~counter~0 0), Black: 366#(< ~j1~0 ~M1~0), 10#thread1EXITtrue, Black: 52#(= ~counter~0 0), 616#true, Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), 807#(= ~counter~0 1), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 242#true, Black: 63#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 806#(= ~counter~0 0), 8#L52true, Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 434#true, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 1222#(and (<= 0 ~j1~0) (<= ~i2~0 1) (or (< ~M1~0 (+ 2 ~j1~0)) (< (+ ~i2~0 1) ~N2~0)) (= ~M1~0 ~N2~0)), 1521#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 09:54:16,466 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 09:54:16,466 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-19 09:54:16,466 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:54:16,466 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-19 09:54:19,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1920], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 1149#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i2~0 ~N2~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, 15#L98-4true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 7#L56true, 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), 9#L67true, Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 618#(= ~counter~0 0), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 1238#true, Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:19,196 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:54:19,196 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:19,196 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:19,196 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:19,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][2188], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 1149#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i2~0 ~N2~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, 15#L98-4true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 7#L56true, 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), 9#L67true, Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 618#(= ~counter~0 0), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 1240#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0))]) [2024-11-19 09:54:19,205 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:54:19,205 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:19,205 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:19,205 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:20,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][911], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 1515#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 618#(= ~counter~0 0), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 63#true, 19#L99-1true, 23#L79true, Black: 808#(= ~counter~0 2), 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 38#thread3EXITtrue, Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), 11#thread2EXITtrue, Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:20,153 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:54:20,153 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:20,153 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:20,153 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:20,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][911], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 1515#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 618#(= ~counter~0 0), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 63#true, 23#L79true, Black: 808#(= ~counter~0 2), 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 619#(= ~counter~0 1), 9#L67true, Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 29#L100true, Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:20,599 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:54:20,599 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:20,599 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:20,599 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:20,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1242], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 20#L64true, 806#(= ~counter~0 0), 251#true, 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 366#(< ~j1~0 ~M1~0), Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 618#(= ~counter~0 0), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 1535#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 63#true, 19#L99-1true, 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 259#true, 434#true, 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), 11#thread2EXITtrue, Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:20,624 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:54:20,624 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:20,624 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:20,624 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:20,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1609], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 251#true, 164#(< ~i2~0 ~N2~0), 54#true, 9#L67true, Black: 619#(= ~counter~0 1), Black: 618#(= ~counter~0 0), Black: 366#(< ~j1~0 ~M1~0), 10#thread1EXITtrue, Black: 52#(= ~counter~0 0), 12#L99true, 616#true, Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 807#(= ~counter~0 1), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 242#true, Black: 63#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 806#(= ~counter~0 0), 8#L52true, Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 434#true, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 1222#(and (<= 0 ~j1~0) (<= ~i2~0 1) (or (< ~M1~0 (+ 2 ~j1~0)) (< (+ ~i2~0 1) ~N2~0)) (= ~M1~0 ~N2~0)), 1521#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 09:54:20,703 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:54:20,704 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:20,704 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:20,704 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:21,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1919], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 251#true, 164#(< ~i2~0 ~N2~0), 366#(< ~j1~0 ~M1~0), 54#true, 15#L98-4true, Black: 619#(= ~counter~0 1), Black: 618#(= ~counter~0 0), Black: 259#true, 10#thread1EXITtrue, Black: 52#(= ~counter~0 0), 616#true, Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 20#L64true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), 807#(= ~counter~0 1), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 242#true, Black: 63#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 1541#(and (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~j1~0 1) ~M1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), 23#L79true, Black: 808#(= ~counter~0 2), Black: 806#(= ~counter~0 0), 8#L52true, Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 434#true, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 1222#(and (<= 0 ~j1~0) (<= ~i2~0 1) (or (< ~M1~0 (+ 2 ~j1~0)) (< (+ ~i2~0 1) ~N2~0)) (= ~M1~0 ~N2~0)), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 09:54:21,205 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:54:21,205 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:21,205 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:21,205 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:21,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1609], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 251#true, 164#(< ~i2~0 ~N2~0), 54#true, 15#L98-4true, Black: 619#(= ~counter~0 1), Black: 618#(= ~counter~0 0), Black: 366#(< ~j1~0 ~M1~0), 10#thread1EXITtrue, Black: 52#(= ~counter~0 0), 616#true, Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 1218#(and (<= 0 ~j1~0) (<= ~i2~0 1) (<= ~M1~0 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), 807#(= ~counter~0 1), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 242#true, Black: 63#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 806#(= ~counter~0 0), 8#L52true, Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 434#true, 38#thread3EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 1521#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 09:54:21,206 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:54:21,206 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:21,206 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:54:21,206 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:54:22,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1920], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 1149#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i2~0 ~N2~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 7#L56true, 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), 9#L67true, Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 618#(= ~counter~0 0), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 1238#true, Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 12#L99true, 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:22,933 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:22,933 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:22,933 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:22,933 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:22,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][2188], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 1149#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i2~0 ~N2~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 999#(<= ~M1~0 ~j1~0), 259#true, Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), 54#true, Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 7#L56true, Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), 9#L67true, Black: 619#(= ~counter~0 1), Black: 618#(= ~counter~0 0), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 12#L99true, 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 1240#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0))]) [2024-11-19 09:54:22,948 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:22,949 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:22,949 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:22,949 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:23,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][2184], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 1149#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i2~0 ~N2~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 20#L64true, 806#(= ~counter~0 0), 251#true, 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 999#(<= ~M1~0 ~j1~0), 366#(< ~j1~0 ~M1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, 15#L98-4true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 7#L56true, 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), Black: 618#(= ~counter~0 0), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 259#true, 1243#(<= (+ ~j1~0 1) ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:23,029 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:23,029 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:23,029 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:23,029 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:23,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][2185], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 1149#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i2~0 ~N2~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 1362#(< ~i2~0 ~N2~0), 164#(< ~i2~0 ~N2~0), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, 15#L98-4true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 242#true, Black: 63#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), 9#L67true, 8#L52true, Black: 618#(= ~counter~0 0), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:23,032 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:23,032 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:23,032 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:23,033 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:23,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1920], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 1130#(< ~M1~0 (+ 2 ~j1~0)), 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, 15#L98-4true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), 9#L67true, Black: 618#(= ~counter~0 0), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 1238#true, Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), 11#thread2EXITtrue, Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:23,060 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:23,060 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:23,060 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:23,060 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:23,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][2188], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 1130#(< ~M1~0 (+ 2 ~j1~0)), 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, 15#L98-4true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), 9#L67true, Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 618#(= ~counter~0 0), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), 11#thread2EXITtrue, Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 1240#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0))]) [2024-11-19 09:54:23,065 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:23,065 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:23,065 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:23,065 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:23,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][913], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 999#(<= ~M1~0 ~j1~0), 806#(= ~counter~0 0), 251#true, 63#true, 1515#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, 15#L98-4true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 7#L56true, 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), Black: 618#(= ~counter~0 0), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 38#thread3EXITtrue, Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:23,066 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:23,066 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:23,066 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:23,066 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:23,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][2415], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 1149#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i2~0 ~N2~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 164#(< ~i2~0 ~N2~0), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, 15#L98-4true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 1557#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 242#true, Black: 63#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), 8#L52true, Black: 619#(= ~counter~0 1), 9#L67true, Black: 618#(= ~counter~0 0), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:23,067 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:23,067 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:23,067 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:23,067 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:24,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][719], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 999#(<= ~M1~0 ~j1~0), 806#(= ~counter~0 0), 251#true, 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), 54#true, Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 618#(= ~counter~0 0), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, 15#L98-4true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 242#true, 7#L56true, Black: 164#(< ~i2~0 ~N2~0), Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 1238#true, Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, 38#thread3EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:24,122 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:24,122 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:24,122 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:24,122 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:24,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][911], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 1515#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 618#(= ~counter~0 0), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 63#true, 23#L79true, Black: 808#(= ~counter~0 2), 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 29#L100true, Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 38#thread3EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:24,939 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:24,940 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:24,940 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:24,940 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:24,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1242], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 20#L64true, 806#(= ~counter~0 0), 251#true, 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 366#(< ~j1~0 ~M1~0), Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 618#(= ~counter~0 0), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 1535#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~j1~0 1) ~M1~0) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 63#true, 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 29#L100true, Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 259#true, Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 434#true, 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:24,949 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:24,949 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:24,949 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:24,949 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:25,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1919], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 251#true, 164#(< ~i2~0 ~N2~0), 366#(< ~j1~0 ~M1~0), 54#true, Black: 619#(= ~counter~0 1), Black: 618#(= ~counter~0 0), Black: 259#true, 10#thread1EXITtrue, Black: 52#(= ~counter~0 0), 12#L99true, 616#true, Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 20#L64true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), 807#(= ~counter~0 1), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 242#true, Black: 63#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, 1541#(and (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~j1~0 1) ~M1~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 808#(= ~counter~0 2), Black: 806#(= ~counter~0 0), 8#L52true, Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 434#true, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 1222#(and (<= 0 ~j1~0) (<= ~i2~0 1) (or (< ~M1~0 (+ 2 ~j1~0)) (< (+ ~i2~0 1) ~N2~0)) (= ~M1~0 ~N2~0)), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 09:54:25,032 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:25,032 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:25,032 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:25,032 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:25,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1609], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 251#true, 164#(< ~i2~0 ~N2~0), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 999#(<= ~M1~0 ~j1~0), 259#true, Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), 54#true, Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), 807#(= ~counter~0 1), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 242#true, Black: 63#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 19#L99-1true, 23#L79true, Black: 808#(= ~counter~0 2), Black: 806#(= ~counter~0 0), 8#L52true, Black: 619#(= ~counter~0 1), 9#L67true, Black: 618#(= ~counter~0 0), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 1222#(and (<= 0 ~j1~0) (<= ~i2~0 1) (or (< ~M1~0 (+ 2 ~j1~0)) (< (+ ~i2~0 1) ~N2~0)) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), 1521#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), 616#true, Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:25,033 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:25,033 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:25,033 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:25,034 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:25,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1609], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 251#true, 164#(< ~i2~0 ~N2~0), 54#true, Black: 619#(= ~counter~0 1), Black: 618#(= ~counter~0 0), Black: 366#(< ~j1~0 ~M1~0), 10#thread1EXITtrue, Black: 52#(= ~counter~0 0), 12#L99true, 616#true, Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 1218#(and (<= 0 ~j1~0) (<= ~i2~0 1) (<= ~M1~0 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 807#(= ~counter~0 1), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 242#true, Black: 63#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 806#(= ~counter~0 0), 8#L52true, Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 434#true, 38#thread3EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 1521#(and (<= (+ ~i2~0 1) ~N2~0) (or (< ~N1~0 (+ 2 ~i1~0)) (< (+ ~i2~0 1) ~N2~0))), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 09:54:25,034 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:25,034 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:25,035 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:25,035 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:25,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1018], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 999#(<= ~M1~0 ~j1~0), 806#(= ~counter~0 0), 251#true, 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 618#(= ~counter~0 0), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 15#L98-4true, Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 242#true, Black: 164#(< ~i2~0 ~N2~0), 7#L56true, Black: 63#true, 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 38#thread3EXITtrue, Black: 52#(= ~counter~0 0), 1397#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:25,800 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:54:25,800 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:54:25,800 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:25,800 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:54:26,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][2184], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 1149#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i2~0 ~N2~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 20#L64true, 806#(= ~counter~0 0), 251#true, 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 366#(< ~j1~0 ~M1~0), Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 7#L56true, 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), Black: 618#(= ~counter~0 0), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 259#true, Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 434#true, 1243#(<= (+ ~j1~0 1) ~M1~0), 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 12#L99true, 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:26,966 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:26,966 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:26,966 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:26,967 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:54:26,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][2185], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 1149#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i2~0 ~N2~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 1362#(< ~i2~0 ~N2~0), 164#(< ~i2~0 ~N2~0), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 242#true, Black: 63#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), 9#L67true, 8#L52true, Black: 618#(= ~counter~0 0), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 12#L99true, 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:26,970 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:26,970 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:26,970 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:54:26,971 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1920], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 1130#(< ~M1~0 (+ 2 ~j1~0)), 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), 9#L67true, Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 618#(= ~counter~0 0), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 1238#true, Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 12#L99true, 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), 11#thread2EXITtrue, Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:27,018 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,018 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,018 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,019 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1920], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 1149#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i2~0 ~N2~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 7#L56true, Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 19#L99-1true, 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), 9#L67true, Black: 618#(= ~counter~0 0), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 1238#true, Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:27,021 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,021 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,021 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,021 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][2188], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 1130#(< ~M1~0 (+ 2 ~j1~0)), 251#true, 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 999#(<= ~M1~0 ~j1~0), 259#true, Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), 54#true, Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), 9#L67true, Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 618#(= ~counter~0 0), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 12#L99true, 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), 11#thread2EXITtrue, Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 1240#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0))]) [2024-11-19 09:54:27,032 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,032 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,032 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,032 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][913], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 999#(<= ~M1~0 ~j1~0), 806#(= ~counter~0 0), 251#true, 63#true, 1515#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), 54#true, Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 7#L56true, Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 618#(= ~counter~0 0), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, 38#thread3EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 12#L99true, 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:27,033 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,033 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,033 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,033 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][2415], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), 1149#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i2~0 ~N2~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 164#(< ~i2~0 ~N2~0), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 999#(<= ~M1~0 ~j1~0), 259#true, Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), 54#true, Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 1557#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 242#true, Black: 63#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), 9#L67true, 8#L52true, Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 618#(= ~counter~0 0), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 12#L99true, 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:27,034 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,034 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,034 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,034 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][2188], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 1149#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i2~0 ~N2~0)), 806#(= ~counter~0 0), 251#true, 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 999#(<= ~M1~0 ~j1~0), 259#true, Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), 54#true, Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 7#L56true, Black: 164#(< ~i2~0 ~N2~0), 242#true, 19#L99-1true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), 9#L67true, Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 618#(= ~counter~0 0), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 1240#(<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0))]) [2024-11-19 09:54:27,043 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,043 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,043 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,043 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][2184], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 20#L64true, 806#(= ~counter~0 0), 251#true, 1130#(< ~M1~0 (+ 2 ~j1~0)), 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 366#(< ~j1~0 ~M1~0), Black: 999#(<= ~M1~0 ~j1~0), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, 15#L98-4true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 618#(= ~counter~0 0), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 259#true, Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 1243#(<= (+ ~j1~0 1) ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), 11#thread2EXITtrue, Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:27,593 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,593 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,593 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,593 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][913], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 999#(<= ~M1~0 ~j1~0), 806#(= ~counter~0 0), 251#true, 63#true, 1515#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, 15#L98-4true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), Black: 618#(= ~counter~0 0), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 38#thread3EXITtrue, Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 616#true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), 11#thread2EXITtrue, Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:27,643 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,643 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,643 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,643 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,894 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][719], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 999#(<= ~M1~0 ~j1~0), 806#(= ~counter~0 0), 251#true, 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 618#(= ~counter~0 0), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 7#L56true, 242#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 1238#true, Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 38#thread3EXITtrue, Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), 12#L99true, Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:27,894 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,894 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:27,894 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:54:27,894 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:28,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1352], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 1149#(or (< ~M1~0 (+ 2 ~j1~0)) (< ~i2~0 ~N2~0)), 20#L64true, 806#(= ~counter~0 0), 251#true, 1503#(and (<= (+ ~i2~0 1) ~N2~0) (<= (+ ~j1~0 1) ~M1~0)), 164#(< ~i2~0 ~N2~0), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 366#(< ~j1~0 ~M1~0), Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), 54#true, Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 618#(= ~counter~0 0), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, 15#L98-4true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 242#true, Black: 63#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), 8#L52true, Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 259#true, Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:28,357 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:28,357 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:54:28,357 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:28,357 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:28,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1017], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 999#(<= ~M1~0 ~j1~0), 806#(= ~counter~0 0), 251#true, 1362#(< ~i2~0 ~N2~0), 164#(< ~i2~0 ~N2~0), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), 54#true, Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 618#(= ~counter~0 0), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, 15#L98-4true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 242#true, Black: 63#true, Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), 8#L52true, Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, 38#thread3EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:28,376 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:28,376 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:28,376 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:54:28,376 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:28,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][719], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 999#(<= ~M1~0 ~j1~0), 806#(= ~counter~0 0), 251#true, 63#true, Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), 54#true, Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 618#(= ~counter~0 0), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, 15#L98-4true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 242#true, Black: 164#(< ~i2~0 ~N2~0), Black: 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 1238#true, Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 38#thread3EXITtrue, Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), 11#thread2EXITtrue, Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:28,409 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:28,409 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:28,409 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:28,410 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:54:28,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][1018], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 999#(<= ~M1~0 ~j1~0), 806#(= ~counter~0 0), 251#true, 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), Black: 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), 259#true, Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), 54#true, Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 618#(= ~counter~0 0), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 7#L56true, 242#true, Black: 63#true, 23#L79true, Black: 808#(= ~counter~0 2), Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, 10#thread1EXITtrue, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 38#thread3EXITtrue, Black: 52#(= ~counter~0 0), 1397#(or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0)), 12#L99true, Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:28,997 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:28,997 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:54:28,997 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:28,997 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:29,144 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L75-->L79: Formula: (and (= v_~counter~0_150 (+ v_~counter~0_149 1)) (not (= (ite (< 0 v_~counter~0_150) 1 0) 0)) (= v_~j2~0_62 (+ v_~j2~0_63 1))) InVars {~counter~0=v_~counter~0_150, ~j2~0=v_~j2~0_63} OutVars{~counter~0=v_~counter~0_149, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_62, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][911], [Black: 253#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0)), Black: 256#(and (= ~i1~0 0) (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~M2~0 ~M1~0) (<= ~M1~0 0)), 806#(= ~counter~0 0), 251#true, 1515#(and (<= (+ ~N1~0 ~j1~0) (+ ~M1~0 ~i1~0)) (or (< ~N1~0 (+ ~i1~0 1)) (< (+ ~i2~0 1) ~N2~0))), 210#(or (< ~N1~0 (+ ~i1~0 1)) (< ~i2~0 ~N2~0)), 259#true, Black: 999#(<= ~M1~0 ~j1~0), Black: 1130#(< ~M1~0 (+ 2 ~j1~0)), Black: 1204#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 54#true, Black: 1212#(and (<= ~i2~0 0) (<= ~M1~0 1) (<= 1 ~j1~0) (= ~M1~0 ~N2~0)), Black: 1202#(and (<= ~i2~0 0) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1216#(and (<= ~M1~0 1) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), 618#(= ~counter~0 0), Black: 1210#(and (<= ~M1~0 1) (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 1075#(and (<= ~M1~0 1) (<= 1 ~j1~0)), Black: 1214#(and (<= ~M1~0 1) (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 994#true, Black: 1052#(and (<= 0 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 1206#(and (<= ~i1~0 1) (= ~M1~0 ~N1~0) (<= ~i2~0 1) (= ~j1~0 0) (= ~M1~0 ~N2~0)), Black: 164#(< ~i2~0 ~N2~0), 242#true, Black: 63#true, 23#L79true, Black: 808#(= ~counter~0 2), 1224#(and (<= ~M1~0 1) (<= 1 ~j1~0) (<= ~i2~0 1) (= ~M1~0 ~N2~0)), Black: 619#(= ~counter~0 1), Black: 222#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 606#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 548#(< ~j2~0 ~M2~0), Black: 231#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 230#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), Black: 366#(< ~j1~0 ~M1~0), 434#true, Black: 236#(and (= ~j1~0 0) (= ~i2~0 0) (= ~M1~0 ~N2~0)), 25#L101true, Black: 52#(= ~counter~0 0), Black: 247#(and (<= (+ ~i1~0 1) ~N1~0) (<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0))), Black: 244#(<= (+ ~M1~0 ~i1~0) (+ ~N1~0 ~j1~0)), Black: 245#(<= (+ ~i1~0 1) ~N1~0), Black: 60#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (<= ~M1~0 0) (= ~M1~0 ~N2~0)), Black: 56#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~i2~0 0) (= ~M1~0 ~N2~0))]) [2024-11-19 09:54:29,144 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:54:29,144 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:29,144 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:54:29,145 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event