./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:46:20,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:46:20,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:46:20,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:46:20,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:46:20,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:46:20,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:46:20,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:46:20,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:46:20,634 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:46:20,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:46:20,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:46:20,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:46:20,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:46:20,640 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:46:20,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:46:20,640 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:46:20,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:46:20,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:46:20,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:46:20,641 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:46:20,642 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:46:20,642 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:46:20,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:46:20,642 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:46:20,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:46:20,643 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:46:20,643 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:46:20,643 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:46:20,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:46:20,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:46:20,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:46:20,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:46:20,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:46:20,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:46:20,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:46:20,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:46:20,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:46:20,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:46:20,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:46:20,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:46:20,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:46:20,647 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-clean/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-clean/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 -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2024-10-11 19:46:20,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:46:20,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:46:20,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:46:20,953 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:46:20,953 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:46:20,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2024-10-11 19:46:22,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:46:22,669 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:46:22,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2024-10-11 19:46:22,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/554ab43bc/c325d6dd3bf9440a9c35e4c3325d8753/FLAGe3ecce036 [2024-10-11 19:46:22,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/554ab43bc/c325d6dd3bf9440a9c35e4c3325d8753 [2024-10-11 19:46:22,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:46:22,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:46:22,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:46:22,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:46:22,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:46:22,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:46:22" (1/1) ... [2024-10-11 19:46:22,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f42500a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:22, skipping insertion in model container [2024-10-11 19:46:22,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:46:22" (1/1) ... [2024-10-11 19:46:22,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:46:23,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:46:23,182 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:46:23,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:46:23,292 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:46:23,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:23 WrapperNode [2024-10-11 19:46:23,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:46:23,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:46:23,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:46:23,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:46:23,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:23" (1/1) ... [2024-10-11 19:46:23,312 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:23" (1/1) ... [2024-10-11 19:46:23,353 INFO L138 Inliner]: procedures = 165, calls = 35, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 123 [2024-10-11 19:46:23,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:46:23,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:46:23,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:46:23,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:46:23,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:23" (1/1) ... [2024-10-11 19:46:23,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:23" (1/1) ... [2024-10-11 19:46:23,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:23" (1/1) ... [2024-10-11 19:46:23,386 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 3 writes are split as follows [0, 3]. [2024-10-11 19:46:23,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:23" (1/1) ... [2024-10-11 19:46:23,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:23" (1/1) ... [2024-10-11 19:46:23,395 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:23" (1/1) ... [2024-10-11 19:46:23,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:23" (1/1) ... [2024-10-11 19:46:23,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:23" (1/1) ... [2024-10-11 19:46:23,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:23" (1/1) ... [2024-10-11 19:46:23,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:46:23,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:46:23,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:46:23,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:46:23,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:23" (1/1) ... [2024-10-11 19:46:23,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:46:23,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:46:23,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:46:23,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:46:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 19:46:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 19:46:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2024-10-11 19:46:23,539 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2024-10-11 19:46:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 19:46:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 19:46:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 19:46:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:46:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 19:46:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 19:46:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 19:46:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:46:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:46:23,543 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:46:23,739 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:46:23,741 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:46:24,038 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:46:24,039 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:46:24,191 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:46:24,192 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 19:46:24,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:46:24 BoogieIcfgContainer [2024-10-11 19:46:24,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:46:24,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:46:24,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:46:24,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:46:24,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:46:22" (1/3) ... [2024-10-11 19:46:24,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591fc775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:46:24, skipping insertion in model container [2024-10-11 19:46:24,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:46:23" (2/3) ... [2024-10-11 19:46:24,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591fc775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:46:24, skipping insertion in model container [2024-10-11 19:46:24,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:46:24" (3/3) ... [2024-10-11 19:46:24,200 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2024-10-11 19:46:24,213 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:46:24,214 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-10-11 19:46:24,214 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:46:24,257 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:46:24,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 75 transitions, 154 flow [2024-10-11 19:46:24,329 INFO L124 PetriNetUnfolderBase]: 10/74 cut-off events. [2024-10-11 19:46:24,331 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:46:24,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 74 events. 10/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 218 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2024-10-11 19:46:24,337 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 75 transitions, 154 flow [2024-10-11 19:46:24,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 74 transitions, 151 flow [2024-10-11 19:46:24,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:46:24,363 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;@3da6bf68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:46:24,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2024-10-11 19:46:24,367 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:46:24,368 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-10-11 19:46:24,368 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:46:24,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:24,369 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-10-11 19:46:24,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:24,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:24,376 INFO L85 PathProgramCache]: Analyzing trace with hash 13222, now seen corresponding path program 1 times [2024-10-11 19:46:24,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:24,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090930197] [2024-10-11 19:46:24,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:24,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:24,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:24,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090930197] [2024-10-11 19:46:24,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090930197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:24,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:24,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:46:24,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989489107] [2024-10-11 19:46:24,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:24,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:46:24,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:24,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:46:24,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:46:24,784 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 75 [2024-10-11 19:46:24,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-10-11 19:46:24,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:24,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 75 [2024-10-11 19:46:24,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:25,071 INFO L124 PetriNetUnfolderBase]: 212/615 cut-off events. [2024-10-11 19:46:25,071 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:46:25,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 615 events. 212/615 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3842 event pairs, 147 based on Foata normal form. 54/503 useless extension candidates. Maximal degree in co-relation 976. Up to 368 conditions per place. [2024-10-11 19:46:25,080 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 28 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-10-11 19:46:25,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 193 flow [2024-10-11 19:46:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:46:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:46:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2024-10-11 19:46:25,095 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-10-11 19:46:25,097 INFO L175 Difference]: Start difference. First operand has 68 places, 74 transitions, 151 flow. Second operand 3 states and 145 transitions. [2024-10-11 19:46:25,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 193 flow [2024-10-11 19:46:25,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:46:25,105 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 136 flow [2024-10-11 19:46:25,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2024-10-11 19:46:25,110 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -3 predicate places. [2024-10-11 19:46:25,111 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 136 flow [2024-10-11 19:46:25,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-10-11 19:46:25,111 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:25,112 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-10-11 19:46:25,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 19:46:25,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:25,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:25,114 INFO L85 PathProgramCache]: Analyzing trace with hash 13223, now seen corresponding path program 1 times [2024-10-11 19:46:25,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:25,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588846765] [2024-10-11 19:46:25,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:25,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:25,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:25,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588846765] [2024-10-11 19:46:25,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588846765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:25,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:25,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:46:25,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218211078] [2024-10-11 19:46:25,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:25,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:46:25,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:25,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:46:25,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:46:25,276 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 75 [2024-10-11 19:46:25,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-10-11 19:46:25,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:25,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 75 [2024-10-11 19:46:25,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:25,455 INFO L124 PetriNetUnfolderBase]: 212/614 cut-off events. [2024-10-11 19:46:25,455 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:46:25,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 614 events. 212/614 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3836 event pairs, 147 based on Foata normal form. 1/449 useless extension candidates. Maximal degree in co-relation 980. Up to 368 conditions per place. [2024-10-11 19:46:25,464 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 28 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-10-11 19:46:25,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 194 flow [2024-10-11 19:46:25,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:46:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:46:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2024-10-11 19:46:25,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6177777777777778 [2024-10-11 19:46:25,467 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 136 flow. Second operand 3 states and 139 transitions. [2024-10-11 19:46:25,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 194 flow [2024-10-11 19:46:25,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 64 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:46:25,470 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 134 flow [2024-10-11 19:46:25,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2024-10-11 19:46:25,471 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2024-10-11 19:46:25,471 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 134 flow [2024-10-11 19:46:25,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-10-11 19:46:25,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:25,472 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:46:25,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 19:46:25,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:25,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:25,473 INFO L85 PathProgramCache]: Analyzing trace with hash -658033413, now seen corresponding path program 1 times [2024-10-11 19:46:25,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:25,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616640186] [2024-10-11 19:46:25,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:25,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:25,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:25,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616640186] [2024-10-11 19:46:25,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616640186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:25,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:25,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:46:25,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075486830] [2024-10-11 19:46:25,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:25,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:46:25,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:25,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:46:25,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:46:25,586 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 75 [2024-10-11 19:46:25,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-10-11 19:46:25,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:25,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 75 [2024-10-11 19:46:25,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:25,716 INFO L124 PetriNetUnfolderBase]: 212/612 cut-off events. [2024-10-11 19:46:25,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:46:25,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 612 events. 212/612 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3811 event pairs, 147 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 978. Up to 368 conditions per place. [2024-10-11 19:46:25,722 INFO L140 encePairwiseOnDemand]: 73/75 looper letters, 29 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2024-10-11 19:46:25,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 192 flow [2024-10-11 19:46:25,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:46:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:46:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2024-10-11 19:46:25,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6177777777777778 [2024-10-11 19:46:25,725 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 134 flow. Second operand 3 states and 139 transitions. [2024-10-11 19:46:25,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 192 flow [2024-10-11 19:46:25,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:46:25,727 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 130 flow [2024-10-11 19:46:25,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2024-10-11 19:46:25,728 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2024-10-11 19:46:25,728 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 130 flow [2024-10-11 19:46:25,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-10-11 19:46:25,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:25,729 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:46:25,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 19:46:25,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:25,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:25,730 INFO L85 PathProgramCache]: Analyzing trace with hash -943636261, now seen corresponding path program 1 times [2024-10-11 19:46:25,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:25,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818296929] [2024-10-11 19:46:25,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:25,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:26,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:26,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818296929] [2024-10-11 19:46:26,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818296929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:26,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:26,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:46:26,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131362607] [2024-10-11 19:46:26,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:26,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:46:26,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:26,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:46:26,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:46:26,087 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2024-10-11 19:46:26,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-10-11 19:46:26,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:26,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2024-10-11 19:46:26,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:26,280 INFO L124 PetriNetUnfolderBase]: 212/560 cut-off events. [2024-10-11 19:46:26,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:46:26,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 560 events. 212/560 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3172 event pairs, 8 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 951. Up to 359 conditions per place. [2024-10-11 19:46:26,284 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 38 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2024-10-11 19:46:26,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 67 transitions, 222 flow [2024-10-11 19:46:26,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:46:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:46:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2024-10-11 19:46:26,287 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5146666666666667 [2024-10-11 19:46:26,288 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 130 flow. Second operand 5 states and 193 transitions. [2024-10-11 19:46:26,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 67 transitions, 222 flow [2024-10-11 19:46:26,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 67 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:46:26,291 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 125 flow [2024-10-11 19:46:26,291 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2024-10-11 19:46:26,292 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2024-10-11 19:46:26,292 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 125 flow [2024-10-11 19:46:26,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-10-11 19:46:26,292 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:26,292 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:46:26,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 19:46:26,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:26,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash -943636262, now seen corresponding path program 1 times [2024-10-11 19:46:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:26,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593200900] [2024-10-11 19:46:26,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:26,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:26,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593200900] [2024-10-11 19:46:26,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593200900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:26,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:26,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:46:26,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22988278] [2024-10-11 19:46:26,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:26,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:46:26,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:26,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:46:26,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:46:26,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2024-10-11 19:46:26,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-10-11 19:46:26,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:26,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2024-10-11 19:46:26,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:26,650 INFO L124 PetriNetUnfolderBase]: 223/519 cut-off events. [2024-10-11 19:46:26,651 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-11 19:46:26,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 519 events. 223/519 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2622 event pairs, 68 based on Foata normal form. 0/431 useless extension candidates. Maximal degree in co-relation 943. Up to 362 conditions per place. [2024-10-11 19:46:26,654 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 38 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2024-10-11 19:46:26,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 217 flow [2024-10-11 19:46:26,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:46:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:46:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2024-10-11 19:46:26,657 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5146666666666667 [2024-10-11 19:46:26,657 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 125 flow. Second operand 5 states and 193 transitions. [2024-10-11 19:46:26,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 217 flow [2024-10-11 19:46:26,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 209 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:46:26,659 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 113 flow [2024-10-11 19:46:26,660 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2024-10-11 19:46:26,660 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -14 predicate places. [2024-10-11 19:46:26,662 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 113 flow [2024-10-11 19:46:26,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-10-11 19:46:26,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:26,663 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:46:26,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 19:46:26,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:26,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:26,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1009954102, now seen corresponding path program 1 times [2024-10-11 19:46:26,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:26,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521186954] [2024-10-11 19:46:26,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:26,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:26,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:26,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521186954] [2024-10-11 19:46:26,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521186954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:26,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:26,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:46:26,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879941833] [2024-10-11 19:46:26,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:26,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:46:26,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:26,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:46:26,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:46:26,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 75 [2024-10-11 19:46:26,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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-10-11 19:46:26,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:26,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 75 [2024-10-11 19:46:26,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:26,959 INFO L124 PetriNetUnfolderBase]: 235/546 cut-off events. [2024-10-11 19:46:26,959 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-10-11 19:46:26,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 546 events. 235/546 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2907 event pairs, 53 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 1006. Up to 283 conditions per place. [2024-10-11 19:46:26,962 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 45 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2024-10-11 19:46:26,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 243 flow [2024-10-11 19:46:26,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:46:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:46:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2024-10-11 19:46:26,964 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5653333333333334 [2024-10-11 19:46:26,964 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 113 flow. Second operand 5 states and 212 transitions. [2024-10-11 19:46:26,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 243 flow [2024-10-11 19:46:26,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 231 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:46:26,967 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 107 flow [2024-10-11 19:46:26,968 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2024-10-11 19:46:26,968 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -17 predicate places. [2024-10-11 19:46:26,969 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 107 flow [2024-10-11 19:46:26,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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-10-11 19:46:26,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:26,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:46:26,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 19:46:26,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:26,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:26,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1009954101, now seen corresponding path program 1 times [2024-10-11 19:46:26,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:26,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409152848] [2024-10-11 19:46:26,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:26,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:27,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:27,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409152848] [2024-10-11 19:46:27,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409152848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:27,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:27,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:46:27,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35858527] [2024-10-11 19:46:27,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:27,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:46:27,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:27,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:46:27,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:46:27,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 75 [2024-10-11 19:46:27,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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-10-11 19:46:27,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:27,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 75 [2024-10-11 19:46:27,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:27,346 INFO L124 PetriNetUnfolderBase]: 235/495 cut-off events. [2024-10-11 19:46:27,347 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-11 19:46:27,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 495 events. 235/495 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2428 event pairs, 53 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 958. Up to 283 conditions per place. [2024-10-11 19:46:27,350 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 45 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2024-10-11 19:46:27,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 233 flow [2024-10-11 19:46:27,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:46:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:46:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2024-10-11 19:46:27,352 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5653333333333334 [2024-10-11 19:46:27,352 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 107 flow. Second operand 5 states and 212 transitions. [2024-10-11 19:46:27,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 233 flow [2024-10-11 19:46:27,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 225 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:46:27,354 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 101 flow [2024-10-11 19:46:27,354 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2024-10-11 19:46:27,355 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -20 predicate places. [2024-10-11 19:46:27,355 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 101 flow [2024-10-11 19:46:27,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 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-10-11 19:46:27,355 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:27,356 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:46:27,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 19:46:27,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:27,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1451164867, now seen corresponding path program 1 times [2024-10-11 19:46:27,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:27,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111500125] [2024-10-11 19:46:27,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:27,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:27,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:27,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111500125] [2024-10-11 19:46:27,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111500125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:27,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:27,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:46:27,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907454178] [2024-10-11 19:46:27,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:27,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:46:27,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:27,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:46:27,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:46:27,628 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2024-10-11 19:46:27,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 101 flow. Second operand has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 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-10-11 19:46:27,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:27,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2024-10-11 19:46:27,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:27,880 INFO L124 PetriNetUnfolderBase]: 296/648 cut-off events. [2024-10-11 19:46:27,881 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-10-11 19:46:27,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 648 events. 296/648 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2931 event pairs, 104 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 1242. Up to 386 conditions per place. [2024-10-11 19:46:27,884 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 73 selfloop transitions, 9 changer transitions 0/95 dead transitions. [2024-10-11 19:46:27,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 95 transitions, 381 flow [2024-10-11 19:46:27,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:46:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:46:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 329 transitions. [2024-10-11 19:46:27,887 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2024-10-11 19:46:27,887 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 101 flow. Second operand 7 states and 329 transitions. [2024-10-11 19:46:27,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 95 transitions, 381 flow [2024-10-11 19:46:27,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 95 transitions, 357 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:46:27,893 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 153 flow [2024-10-11 19:46:27,893 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=153, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2024-10-11 19:46:27,895 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -14 predicate places. [2024-10-11 19:46:27,896 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 153 flow [2024-10-11 19:46:27,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 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-10-11 19:46:27,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:27,900 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:46:27,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 19:46:27,901 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:27,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1450149955, now seen corresponding path program 1 times [2024-10-11 19:46:27,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:27,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178391435] [2024-10-11 19:46:27,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:27,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:28,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:28,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178391435] [2024-10-11 19:46:28,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178391435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:28,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:28,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:46:28,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143065647] [2024-10-11 19:46:28,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:28,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:46:28,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:28,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:46:28,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:46:28,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2024-10-11 19:46:28,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 35.333333333333336) internal successors, (212), 6 states have internal predecessors, (212), 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-10-11 19:46:28,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:28,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2024-10-11 19:46:28,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:28,423 INFO L124 PetriNetUnfolderBase]: 298/649 cut-off events. [2024-10-11 19:46:28,423 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-10-11 19:46:28,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 649 events. 298/649 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2987 event pairs, 104 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 1359. Up to 367 conditions per place. [2024-10-11 19:46:28,427 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 66 selfloop transitions, 13 changer transitions 6/98 dead transitions. [2024-10-11 19:46:28,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 98 transitions, 418 flow [2024-10-11 19:46:28,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:46:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:46:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 322 transitions. [2024-10-11 19:46:28,429 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2024-10-11 19:46:28,430 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 153 flow. Second operand 7 states and 322 transitions. [2024-10-11 19:46:28,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 98 transitions, 418 flow [2024-10-11 19:46:28,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 416 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:46:28,433 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 217 flow [2024-10-11 19:46:28,434 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2024-10-11 19:46:28,435 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2024-10-11 19:46:28,435 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 217 flow [2024-10-11 19:46:28,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.333333333333336) internal successors, (212), 6 states have internal predecessors, (212), 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-10-11 19:46:28,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:28,436 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] [2024-10-11 19:46:28,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 19:46:28,436 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:28,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:28,437 INFO L85 PathProgramCache]: Analyzing trace with hash 266376415, now seen corresponding path program 1 times [2024-10-11 19:46:28,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:28,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112552506] [2024-10-11 19:46:28,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:28,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:29,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:29,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112552506] [2024-10-11 19:46:29,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112552506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:29,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:29,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 19:46:29,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647638990] [2024-10-11 19:46:29,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:29,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:46:29,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:29,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:46:29,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:46:29,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2024-10-11 19:46:29,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 217 flow. Second operand has 10 states, 10 states have (on average 35.4) internal successors, (354), 10 states have internal predecessors, (354), 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-10-11 19:46:29,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:29,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2024-10-11 19:46:29,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:30,070 INFO L124 PetriNetUnfolderBase]: 326/694 cut-off events. [2024-10-11 19:46:30,071 INFO L125 PetriNetUnfolderBase]: For 352/359 co-relation queries the response was YES. [2024-10-11 19:46:30,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 694 events. 326/694 cut-off events. For 352/359 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3266 event pairs, 86 based on Foata normal form. 9/636 useless extension candidates. Maximal degree in co-relation 1675. Up to 381 conditions per place. [2024-10-11 19:46:30,076 INFO L140 encePairwiseOnDemand]: 58/75 looper letters, 73 selfloop transitions, 48 changer transitions 6/140 dead transitions. [2024-10-11 19:46:30,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 140 transitions, 746 flow [2024-10-11 19:46:30,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 19:46:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-10-11 19:46:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 805 transitions. [2024-10-11 19:46:30,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5366666666666666 [2024-10-11 19:46:30,079 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 217 flow. Second operand 20 states and 805 transitions. [2024-10-11 19:46:30,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 140 transitions, 746 flow [2024-10-11 19:46:30,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 140 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:46:30,085 INFO L231 Difference]: Finished difference. Result has 83 places, 97 transitions, 501 flow [2024-10-11 19:46:30,085 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=501, PETRI_PLACES=83, PETRI_TRANSITIONS=97} [2024-10-11 19:46:30,086 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 15 predicate places. [2024-10-11 19:46:30,086 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 97 transitions, 501 flow [2024-10-11 19:46:30,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.4) internal successors, (354), 10 states have internal predecessors, (354), 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-10-11 19:46:30,087 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:30,087 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] [2024-10-11 19:46:30,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 19:46:30,089 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:30,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:30,089 INFO L85 PathProgramCache]: Analyzing trace with hash 512789855, now seen corresponding path program 2 times [2024-10-11 19:46:30,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:30,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423130014] [2024-10-11 19:46:30,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:30,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:30,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:30,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:30,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423130014] [2024-10-11 19:46:30,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423130014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:30,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:30,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 19:46:30,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484725163] [2024-10-11 19:46:30,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:30,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 19:46:30,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:30,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 19:46:30,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:46:31,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2024-10-11 19:46:31,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 97 transitions, 501 flow. Second operand has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 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-10-11 19:46:31,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:31,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2024-10-11 19:46:31,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:31,653 INFO L124 PetriNetUnfolderBase]: 469/965 cut-off events. [2024-10-11 19:46:31,653 INFO L125 PetriNetUnfolderBase]: For 925/925 co-relation queries the response was YES. [2024-10-11 19:46:31,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2892 conditions, 965 events. 469/965 cut-off events. For 925/925 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4663 event pairs, 145 based on Foata normal form. 6/922 useless extension candidates. Maximal degree in co-relation 2872. Up to 502 conditions per place. [2024-10-11 19:46:31,686 INFO L140 encePairwiseOnDemand]: 61/75 looper letters, 91 selfloop transitions, 39 changer transitions 30/169 dead transitions. [2024-10-11 19:46:31,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 169 transitions, 1129 flow [2024-10-11 19:46:31,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 19:46:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-11 19:46:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 535 transitions. [2024-10-11 19:46:31,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5487179487179488 [2024-10-11 19:46:31,690 INFO L175 Difference]: Start difference. First operand has 83 places, 97 transitions, 501 flow. Second operand 13 states and 535 transitions. [2024-10-11 19:46:31,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 169 transitions, 1129 flow [2024-10-11 19:46:31,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 169 transitions, 1043 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-10-11 19:46:31,699 INFO L231 Difference]: Finished difference. Result has 96 places, 109 transitions, 656 flow [2024-10-11 19:46:31,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=656, PETRI_PLACES=96, PETRI_TRANSITIONS=109} [2024-10-11 19:46:31,700 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 28 predicate places. [2024-10-11 19:46:31,701 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 109 transitions, 656 flow [2024-10-11 19:46:31,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 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-10-11 19:46:31,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:31,701 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] [2024-10-11 19:46:31,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 19:46:31,702 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:31,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1921422159, now seen corresponding path program 3 times [2024-10-11 19:46:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:31,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843391487] [2024-10-11 19:46:31,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:31,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:32,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:32,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843391487] [2024-10-11 19:46:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843391487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:32,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:32,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 19:46:32,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916111039] [2024-10-11 19:46:32,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:32,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 19:46:32,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:32,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 19:46:32,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:46:32,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2024-10-11 19:46:32,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 109 transitions, 656 flow. Second operand has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 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-10-11 19:46:32,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:32,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2024-10-11 19:46:32,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:33,169 INFO L124 PetriNetUnfolderBase]: 486/1024 cut-off events. [2024-10-11 19:46:33,170 INFO L125 PetriNetUnfolderBase]: For 1413/1413 co-relation queries the response was YES. [2024-10-11 19:46:33,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3316 conditions, 1024 events. 486/1024 cut-off events. For 1413/1413 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5126 event pairs, 178 based on Foata normal form. 16/986 useless extension candidates. Maximal degree in co-relation 3289. Up to 496 conditions per place. [2024-10-11 19:46:33,179 INFO L140 encePairwiseOnDemand]: 59/75 looper letters, 99 selfloop transitions, 54 changer transitions 17/179 dead transitions. [2024-10-11 19:46:33,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 179 transitions, 1344 flow [2024-10-11 19:46:33,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 19:46:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-11 19:46:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 543 transitions. [2024-10-11 19:46:33,181 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.556923076923077 [2024-10-11 19:46:33,181 INFO L175 Difference]: Start difference. First operand has 96 places, 109 transitions, 656 flow. Second operand 13 states and 543 transitions. [2024-10-11 19:46:33,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 179 transitions, 1344 flow [2024-10-11 19:46:33,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 179 transitions, 1262 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-10-11 19:46:33,194 INFO L231 Difference]: Finished difference. Result has 102 places, 124 transitions, 890 flow [2024-10-11 19:46:33,195 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=890, PETRI_PLACES=102, PETRI_TRANSITIONS=124} [2024-10-11 19:46:33,197 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 34 predicate places. [2024-10-11 19:46:33,197 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 124 transitions, 890 flow [2024-10-11 19:46:33,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 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-10-11 19:46:33,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:33,198 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] [2024-10-11 19:46:33,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 19:46:33,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:33,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:33,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1532111107, now seen corresponding path program 1 times [2024-10-11 19:46:33,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:33,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615210651] [2024-10-11 19:46:33,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:33,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:33,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:33,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615210651] [2024-10-11 19:46:33,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615210651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:33,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:33,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 19:46:33,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406828734] [2024-10-11 19:46:33,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:33,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:46:33,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:33,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:46:33,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:46:33,905 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2024-10-11 19:46:33,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 124 transitions, 890 flow. Second operand has 10 states, 10 states have (on average 34.5) internal successors, (345), 10 states have internal predecessors, (345), 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-10-11 19:46:33,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:33,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2024-10-11 19:46:33,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:34,868 INFO L124 PetriNetUnfolderBase]: 759/1584 cut-off events. [2024-10-11 19:46:34,868 INFO L125 PetriNetUnfolderBase]: For 2669/2714 co-relation queries the response was YES. [2024-10-11 19:46:34,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5325 conditions, 1584 events. 759/1584 cut-off events. For 2669/2714 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9606 event pairs, 139 based on Foata normal form. 67/1553 useless extension candidates. Maximal degree in co-relation 5296. Up to 495 conditions per place. [2024-10-11 19:46:34,885 INFO L140 encePairwiseOnDemand]: 57/75 looper letters, 192 selfloop transitions, 112 changer transitions 16/332 dead transitions. [2024-10-11 19:46:34,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 332 transitions, 2723 flow [2024-10-11 19:46:34,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 19:46:34,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-10-11 19:46:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1078 transitions. [2024-10-11 19:46:34,888 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5528205128205128 [2024-10-11 19:46:34,889 INFO L175 Difference]: Start difference. First operand has 102 places, 124 transitions, 890 flow. Second operand 26 states and 1078 transitions. [2024-10-11 19:46:34,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 332 transitions, 2723 flow [2024-10-11 19:46:34,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 332 transitions, 2613 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-10-11 19:46:34,907 INFO L231 Difference]: Finished difference. Result has 137 places, 199 transitions, 1745 flow [2024-10-11 19:46:34,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1745, PETRI_PLACES=137, PETRI_TRANSITIONS=199} [2024-10-11 19:46:34,908 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 69 predicate places. [2024-10-11 19:46:34,908 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 199 transitions, 1745 flow [2024-10-11 19:46:34,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.5) internal successors, (345), 10 states have internal predecessors, (345), 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-10-11 19:46:34,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:34,909 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] [2024-10-11 19:46:34,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 19:46:34,909 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:34,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:34,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1531096195, now seen corresponding path program 4 times [2024-10-11 19:46:34,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:34,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723925634] [2024-10-11 19:46:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:34,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:35,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:35,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723925634] [2024-10-11 19:46:35,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723925634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:35,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:35,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 19:46:35,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291748605] [2024-10-11 19:46:35,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:35,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:46:35,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:35,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:46:35,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:46:35,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2024-10-11 19:46:35,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 199 transitions, 1745 flow. Second operand has 10 states, 10 states have (on average 35.6) internal successors, (356), 10 states have internal predecessors, (356), 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-10-11 19:46:35,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:35,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2024-10-11 19:46:35,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:36,778 INFO L124 PetriNetUnfolderBase]: 1325/2843 cut-off events. [2024-10-11 19:46:36,779 INFO L125 PetriNetUnfolderBase]: For 7856/7874 co-relation queries the response was YES. [2024-10-11 19:46:36,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11150 conditions, 2843 events. 1325/2843 cut-off events. For 7856/7874 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 18045 event pairs, 201 based on Foata normal form. 69/2746 useless extension candidates. Maximal degree in co-relation 11107. Up to 591 conditions per place. [2024-10-11 19:46:36,813 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 319 selfloop transitions, 124 changer transitions 22/495 dead transitions. [2024-10-11 19:46:36,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 495 transitions, 4475 flow [2024-10-11 19:46:36,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:46:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-11 19:46:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 893 transitions. [2024-10-11 19:46:36,816 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2024-10-11 19:46:36,816 INFO L175 Difference]: Start difference. First operand has 137 places, 199 transitions, 1745 flow. Second operand 19 states and 893 transitions. [2024-10-11 19:46:36,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 495 transitions, 4475 flow [2024-10-11 19:46:36,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 495 transitions, 4441 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-10-11 19:46:36,868 INFO L231 Difference]: Finished difference. Result has 165 places, 270 transitions, 2712 flow [2024-10-11 19:46:36,870 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1693, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2712, PETRI_PLACES=165, PETRI_TRANSITIONS=270} [2024-10-11 19:46:36,870 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 97 predicate places. [2024-10-11 19:46:36,870 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 270 transitions, 2712 flow [2024-10-11 19:46:36,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.6) internal successors, (356), 10 states have internal predecessors, (356), 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-10-11 19:46:36,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:36,872 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] [2024-10-11 19:46:36,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 19:46:36,872 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:36,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:36,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1884506337, now seen corresponding path program 5 times [2024-10-11 19:46:36,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:36,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209036445] [2024-10-11 19:46:36,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:36,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:37,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:37,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209036445] [2024-10-11 19:46:37,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209036445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:37,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:37,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:46:37,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474432651] [2024-10-11 19:46:37,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:37,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:46:37,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:37,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:46:37,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:46:37,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2024-10-11 19:46:37,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 270 transitions, 2712 flow. Second operand has 9 states, 9 states have (on average 35.55555555555556) internal successors, (320), 9 states have internal predecessors, (320), 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-10-11 19:46:37,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:37,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2024-10-11 19:46:37,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:38,378 INFO L124 PetriNetUnfolderBase]: 1270/2740 cut-off events. [2024-10-11 19:46:38,379 INFO L125 PetriNetUnfolderBase]: For 14982/15036 co-relation queries the response was YES. [2024-10-11 19:46:38,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13509 conditions, 2740 events. 1270/2740 cut-off events. For 14982/15036 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 17100 event pairs, 483 based on Foata normal form. 36/2603 useless extension candidates. Maximal degree in co-relation 13453. Up to 1688 conditions per place. [2024-10-11 19:46:38,430 INFO L140 encePairwiseOnDemand]: 61/75 looper letters, 193 selfloop transitions, 87 changer transitions 11/315 dead transitions. [2024-10-11 19:46:38,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 315 transitions, 3742 flow [2024-10-11 19:46:38,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 19:46:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-11 19:46:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 595 transitions. [2024-10-11 19:46:38,433 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-10-11 19:46:38,433 INFO L175 Difference]: Start difference. First operand has 165 places, 270 transitions, 2712 flow. Second operand 14 states and 595 transitions. [2024-10-11 19:46:38,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 315 transitions, 3742 flow [2024-10-11 19:46:38,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 315 transitions, 3547 flow, removed 91 selfloop flow, removed 2 redundant places. [2024-10-11 19:46:38,528 INFO L231 Difference]: Finished difference. Result has 178 places, 271 transitions, 2757 flow [2024-10-11 19:46:38,529 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2543, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2757, PETRI_PLACES=178, PETRI_TRANSITIONS=271} [2024-10-11 19:46:38,529 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 110 predicate places. [2024-10-11 19:46:38,530 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 271 transitions, 2757 flow [2024-10-11 19:46:38,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.55555555555556) internal successors, (320), 9 states have internal predecessors, (320), 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-10-11 19:46:38,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:38,530 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] [2024-10-11 19:46:38,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 19:46:38,530 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:38,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:38,531 INFO L85 PathProgramCache]: Analyzing trace with hash -888022835, now seen corresponding path program 2 times [2024-10-11 19:46:38,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:38,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218860018] [2024-10-11 19:46:38,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:38,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:38,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:38,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218860018] [2024-10-11 19:46:38,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218860018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:38,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:38,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 19:46:38,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667393925] [2024-10-11 19:46:38,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:38,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:46:38,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:38,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:46:38,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:46:39,247 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2024-10-11 19:46:39,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 271 transitions, 2757 flow. Second operand has 10 states, 10 states have (on average 34.5) internal successors, (345), 10 states have internal predecessors, (345), 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-10-11 19:46:39,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:39,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2024-10-11 19:46:39,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:40,529 INFO L124 PetriNetUnfolderBase]: 1722/3639 cut-off events. [2024-10-11 19:46:40,529 INFO L125 PetriNetUnfolderBase]: For 20907/20957 co-relation queries the response was YES. [2024-10-11 19:46:40,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18309 conditions, 3639 events. 1722/3639 cut-off events. For 20907/20957 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 24196 event pairs, 568 based on Foata normal form. 47/3470 useless extension candidates. Maximal degree in co-relation 18251. Up to 1880 conditions per place. [2024-10-11 19:46:40,566 INFO L140 encePairwiseOnDemand]: 57/75 looper letters, 330 selfloop transitions, 166 changer transitions 4/516 dead transitions. [2024-10-11 19:46:40,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 516 transitions, 6263 flow [2024-10-11 19:46:40,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 19:46:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-10-11 19:46:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1044 transitions. [2024-10-11 19:46:40,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5568 [2024-10-11 19:46:40,570 INFO L175 Difference]: Start difference. First operand has 178 places, 271 transitions, 2757 flow. Second operand 25 states and 1044 transitions. [2024-10-11 19:46:40,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 516 transitions, 6263 flow [2024-10-11 19:46:40,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 516 transitions, 5620 flow, removed 120 selfloop flow, removed 14 redundant places. [2024-10-11 19:46:40,680 INFO L231 Difference]: Finished difference. Result has 199 places, 353 transitions, 3851 flow [2024-10-11 19:46:40,680 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2491, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3851, PETRI_PLACES=199, PETRI_TRANSITIONS=353} [2024-10-11 19:46:40,681 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 131 predicate places. [2024-10-11 19:46:40,681 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 353 transitions, 3851 flow [2024-10-11 19:46:40,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.5) internal successors, (345), 10 states have internal predecessors, (345), 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-10-11 19:46:40,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:40,682 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] [2024-10-11 19:46:40,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 19:46:40,682 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:40,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:40,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1806089651, now seen corresponding path program 6 times [2024-10-11 19:46:40,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:40,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849730875] [2024-10-11 19:46:40,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:40,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:41,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:41,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849730875] [2024-10-11 19:46:41,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849730875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:41,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:41,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 19:46:41,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52556657] [2024-10-11 19:46:41,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:41,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 19:46:41,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:41,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 19:46:41,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:46:41,370 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2024-10-11 19:46:41,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 353 transitions, 3851 flow. Second operand has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 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-10-11 19:46:41,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:41,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2024-10-11 19:46:41,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:42,377 INFO L124 PetriNetUnfolderBase]: 1763/3678 cut-off events. [2024-10-11 19:46:42,378 INFO L125 PetriNetUnfolderBase]: For 20736/20736 co-relation queries the response was YES. [2024-10-11 19:46:42,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18575 conditions, 3678 events. 1763/3678 cut-off events. For 20736/20736 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 23751 event pairs, 699 based on Foata normal form. 4/3498 useless extension candidates. Maximal degree in co-relation 18508. Up to 2425 conditions per place. [2024-10-11 19:46:42,420 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 239 selfloop transitions, 148 changer transitions 11/407 dead transitions. [2024-10-11 19:46:42,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 407 transitions, 5164 flow [2024-10-11 19:46:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 19:46:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-10-11 19:46:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 642 transitions. [2024-10-11 19:46:42,422 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5035294117647059 [2024-10-11 19:46:42,423 INFO L175 Difference]: Start difference. First operand has 199 places, 353 transitions, 3851 flow. Second operand 17 states and 642 transitions. [2024-10-11 19:46:42,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 407 transitions, 5164 flow [2024-10-11 19:46:42,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 407 transitions, 5032 flow, removed 65 selfloop flow, removed 1 redundant places. [2024-10-11 19:46:42,550 INFO L231 Difference]: Finished difference. Result has 216 places, 350 transitions, 4031 flow [2024-10-11 19:46:42,551 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=3532, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4031, PETRI_PLACES=216, PETRI_TRANSITIONS=350} [2024-10-11 19:46:42,551 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 148 predicate places. [2024-10-11 19:46:42,551 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 350 transitions, 4031 flow [2024-10-11 19:46:42,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.45454545454545) internal successors, (357), 11 states have internal predecessors, (357), 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-10-11 19:46:42,552 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:42,552 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] [2024-10-11 19:46:42,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 19:46:42,552 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:42,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:42,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1153789535, now seen corresponding path program 7 times [2024-10-11 19:46:42,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:42,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327329441] [2024-10-11 19:46:42,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:42,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:42,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:42,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327329441] [2024-10-11 19:46:42,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327329441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:42,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:42,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:46:42,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274539244] [2024-10-11 19:46:42,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:42,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:46:42,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:42,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:46:42,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:46:43,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2024-10-11 19:46:43,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 350 transitions, 4031 flow. Second operand has 9 states, 9 states have (on average 35.55555555555556) internal successors, (320), 9 states have internal predecessors, (320), 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-10-11 19:46:43,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:43,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2024-10-11 19:46:43,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:43,938 INFO L124 PetriNetUnfolderBase]: 1426/3112 cut-off events. [2024-10-11 19:46:43,938 INFO L125 PetriNetUnfolderBase]: For 16776/16815 co-relation queries the response was YES. [2024-10-11 19:46:43,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15469 conditions, 3112 events. 1426/3112 cut-off events. For 16776/16815 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 20631 event pairs, 582 based on Foata normal form. 22/2930 useless extension candidates. Maximal degree in co-relation 15399. Up to 1971 conditions per place. [2024-10-11 19:46:43,971 INFO L140 encePairwiseOnDemand]: 61/75 looper letters, 193 selfloop transitions, 109 changer transitions 10/338 dead transitions. [2024-10-11 19:46:43,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 338 transitions, 4250 flow [2024-10-11 19:46:43,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 19:46:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-11 19:46:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 574 transitions. [2024-10-11 19:46:43,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2024-10-11 19:46:43,973 INFO L175 Difference]: Start difference. First operand has 216 places, 350 transitions, 4031 flow. Second operand 14 states and 574 transitions. [2024-10-11 19:46:43,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 338 transitions, 4250 flow [2024-10-11 19:46:44,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 338 transitions, 3981 flow, removed 51 selfloop flow, removed 15 redundant places. [2024-10-11 19:46:44,068 INFO L231 Difference]: Finished difference. Result has 206 places, 298 transitions, 3280 flow [2024-10-11 19:46:44,069 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=3091, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3280, PETRI_PLACES=206, PETRI_TRANSITIONS=298} [2024-10-11 19:46:44,069 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 138 predicate places. [2024-10-11 19:46:44,069 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 298 transitions, 3280 flow [2024-10-11 19:46:44,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.55555555555556) internal successors, (320), 9 states have internal predecessors, (320), 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-10-11 19:46:44,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:44,070 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] [2024-10-11 19:46:44,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 19:46:44,070 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:44,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1676413199, now seen corresponding path program 8 times [2024-10-11 19:46:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:44,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008154920] [2024-10-11 19:46:44,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:44,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:44,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008154920] [2024-10-11 19:46:44,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008154920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:44,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:44,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 19:46:44,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800888100] [2024-10-11 19:46:44,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:44,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:46:44,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:44,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:46:44,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:46:44,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2024-10-11 19:46:44,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 298 transitions, 3280 flow. Second operand has 10 states, 10 states have (on average 35.6) internal successors, (356), 10 states have internal predecessors, (356), 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-10-11 19:46:44,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:44,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2024-10-11 19:46:44,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:45,944 INFO L124 PetriNetUnfolderBase]: 2030/4344 cut-off events. [2024-10-11 19:46:45,944 INFO L125 PetriNetUnfolderBase]: For 24010/24025 co-relation queries the response was YES. [2024-10-11 19:46:45,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21124 conditions, 4344 events. 2030/4344 cut-off events. For 24010/24025 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 29612 event pairs, 638 based on Foata normal form. 79/4160 useless extension candidates. Maximal degree in co-relation 21059. Up to 2067 conditions per place. [2024-10-11 19:46:45,994 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 405 selfloop transitions, 116 changer transitions 25/573 dead transitions. [2024-10-11 19:46:45,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 573 transitions, 6576 flow [2024-10-11 19:46:45,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 19:46:45,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-10-11 19:46:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 954 transitions. [2024-10-11 19:46:45,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.636 [2024-10-11 19:46:45,998 INFO L175 Difference]: Start difference. First operand has 206 places, 298 transitions, 3280 flow. Second operand 20 states and 954 transitions. [2024-10-11 19:46:45,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 573 transitions, 6576 flow [2024-10-11 19:46:46,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 573 transitions, 6246 flow, removed 12 selfloop flow, removed 18 redundant places. [2024-10-11 19:46:46,114 INFO L231 Difference]: Finished difference. Result has 217 places, 339 transitions, 3817 flow [2024-10-11 19:46:46,115 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=2578, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3817, PETRI_PLACES=217, PETRI_TRANSITIONS=339} [2024-10-11 19:46:46,116 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 149 predicate places. [2024-10-11 19:46:46,116 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 339 transitions, 3817 flow [2024-10-11 19:46:46,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.6) internal successors, (356), 10 states have internal predecessors, (356), 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-10-11 19:46:46,117 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:46,117 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] [2024-10-11 19:46:46,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 19:46:46,117 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting workerErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:46,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:46,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1446857862, now seen corresponding path program 1 times [2024-10-11 19:46:46,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:46,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63228610] [2024-10-11 19:46:46,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:46,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:46,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:46,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63228610] [2024-10-11 19:46:46,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63228610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:46,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:46,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 19:46:46,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886629837] [2024-10-11 19:46:46,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:46,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 19:46:46,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:46,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 19:46:46,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:46:46,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2024-10-11 19:46:46,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 339 transitions, 3817 flow. Second operand has 11 states, 11 states have (on average 34.45454545454545) internal successors, (379), 11 states have internal predecessors, (379), 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-10-11 19:46:46,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:46,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2024-10-11 19:46:46,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:48,707 INFO L124 PetriNetUnfolderBase]: 3352/6952 cut-off events. [2024-10-11 19:46:48,707 INFO L125 PetriNetUnfolderBase]: For 59163/59212 co-relation queries the response was YES. [2024-10-11 19:46:48,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37390 conditions, 6952 events. 3352/6952 cut-off events. For 59163/59212 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 51130 event pairs, 1220 based on Foata normal form. 87/6625 useless extension candidates. Maximal degree in co-relation 37316. Up to 3309 conditions per place. [2024-10-11 19:46:48,779 INFO L140 encePairwiseOnDemand]: 57/75 looper letters, 448 selfloop transitions, 263 changer transitions 14/745 dead transitions. [2024-10-11 19:46:48,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 745 transitions, 9380 flow [2024-10-11 19:46:48,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 19:46:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-10-11 19:46:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 1426 transitions. [2024-10-11 19:46:48,782 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5432380952380952 [2024-10-11 19:46:48,782 INFO L175 Difference]: Start difference. First operand has 217 places, 339 transitions, 3817 flow. Second operand 35 states and 1426 transitions. [2024-10-11 19:46:48,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 745 transitions, 9380 flow [2024-10-11 19:46:49,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 745 transitions, 8904 flow, removed 237 selfloop flow, removed 1 redundant places. [2024-10-11 19:46:49,044 INFO L231 Difference]: Finished difference. Result has 261 places, 503 transitions, 6467 flow [2024-10-11 19:46:49,045 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=3505, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=6467, PETRI_PLACES=261, PETRI_TRANSITIONS=503} [2024-10-11 19:46:49,046 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 193 predicate places. [2024-10-11 19:46:49,046 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 503 transitions, 6467 flow [2024-10-11 19:46:49,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 34.45454545454545) internal successors, (379), 11 states have internal predecessors, (379), 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-10-11 19:46:49,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:49,046 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] [2024-10-11 19:46:49,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 19:46:49,047 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:49,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:49,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1445842950, now seen corresponding path program 1 times [2024-10-11 19:46:49,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:49,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800006949] [2024-10-11 19:46:49,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:49,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:49,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:49,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800006949] [2024-10-11 19:46:49,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800006949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:49,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:49,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 19:46:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917060705] [2024-10-11 19:46:49,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:49,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 19:46:49,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:49,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 19:46:49,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:46:49,644 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2024-10-11 19:46:49,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 503 transitions, 6467 flow. Second operand has 11 states, 11 states have (on average 35.54545454545455) internal successors, (391), 11 states have internal predecessors, (391), 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-10-11 19:46:49,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:49,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2024-10-11 19:46:49,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:51,906 INFO L124 PetriNetUnfolderBase]: 3905/8171 cut-off events. [2024-10-11 19:46:51,907 INFO L125 PetriNetUnfolderBase]: For 84307/84346 co-relation queries the response was YES. [2024-10-11 19:46:51,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45900 conditions, 8171 events. 3905/8171 cut-off events. For 84307/84346 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 63621 event pairs, 397 based on Foata normal form. 157/7865 useless extension candidates. Maximal degree in co-relation 45814. Up to 2097 conditions per place. [2024-10-11 19:46:51,996 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 480 selfloop transitions, 503 changer transitions 26/1046 dead transitions. [2024-10-11 19:46:51,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 1046 transitions, 14262 flow [2024-10-11 19:46:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 19:46:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-10-11 19:46:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1197 transitions. [2024-10-11 19:46:51,999 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6138461538461538 [2024-10-11 19:46:51,999 INFO L175 Difference]: Start difference. First operand has 261 places, 503 transitions, 6467 flow. Second operand 26 states and 1197 transitions. [2024-10-11 19:46:52,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 1046 transitions, 14262 flow [2024-10-11 19:46:52,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 1046 transitions, 14028 flow, removed 99 selfloop flow, removed 5 redundant places. [2024-10-11 19:46:52,436 INFO L231 Difference]: Finished difference. Result has 294 places, 700 transitions, 10410 flow [2024-10-11 19:46:52,437 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=5574, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=271, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=10410, PETRI_PLACES=294, PETRI_TRANSITIONS=700} [2024-10-11 19:46:52,437 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 226 predicate places. [2024-10-11 19:46:52,437 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 700 transitions, 10410 flow [2024-10-11 19:46:52,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.54545454545455) internal successors, (391), 11 states have internal predecessors, (391), 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-10-11 19:46:52,437 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:52,438 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] [2024-10-11 19:46:52,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 19:46:52,438 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:52,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:52,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1729381604, now seen corresponding path program 2 times [2024-10-11 19:46:52,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:52,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319272407] [2024-10-11 19:46:52,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:52,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:52,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:52,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319272407] [2024-10-11 19:46:52,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319272407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:52,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:52,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 19:46:52,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860429962] [2024-10-11 19:46:52,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:52,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 19:46:52,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:52,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 19:46:52,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:46:53,037 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2024-10-11 19:46:53,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 700 transitions, 10410 flow. Second operand has 11 states, 11 states have (on average 35.54545454545455) internal successors, (391), 11 states have internal predecessors, (391), 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-10-11 19:46:53,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:53,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2024-10-11 19:46:53,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:46:56,159 INFO L124 PetriNetUnfolderBase]: 4245/8942 cut-off events. [2024-10-11 19:46:56,160 INFO L125 PetriNetUnfolderBase]: For 158839/158888 co-relation queries the response was YES. [2024-10-11 19:46:56,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58756 conditions, 8942 events. 4245/8942 cut-off events. For 158839/158888 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 70768 event pairs, 599 based on Foata normal form. 45/8725 useless extension candidates. Maximal degree in co-relation 58651. Up to 2730 conditions per place. [2024-10-11 19:46:56,246 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 562 selfloop transitions, 424 changer transitions 3/1025 dead transitions. [2024-10-11 19:46:56,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 1025 transitions, 17037 flow [2024-10-11 19:46:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 19:46:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-10-11 19:46:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 968 transitions. [2024-10-11 19:46:56,247 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6453333333333333 [2024-10-11 19:46:56,248 INFO L175 Difference]: Start difference. First operand has 294 places, 700 transitions, 10410 flow. Second operand 20 states and 968 transitions. [2024-10-11 19:46:56,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 1025 transitions, 17037 flow [2024-10-11 19:46:56,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 1025 transitions, 16283 flow, removed 376 selfloop flow, removed 1 redundant places. [2024-10-11 19:46:56,798 INFO L231 Difference]: Finished difference. Result has 325 places, 763 transitions, 12366 flow [2024-10-11 19:46:56,799 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=9712, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=365, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=12366, PETRI_PLACES=325, PETRI_TRANSITIONS=763} [2024-10-11 19:46:56,799 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 257 predicate places. [2024-10-11 19:46:56,799 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 763 transitions, 12366 flow [2024-10-11 19:46:56,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.54545454545455) internal successors, (391), 11 states have internal predecessors, (391), 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-10-11 19:46:56,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:46:56,799 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] [2024-10-11 19:46:56,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 19:46:56,800 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting workerErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:46:56,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:46:56,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1730396516, now seen corresponding path program 2 times [2024-10-11 19:46:56,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:46:56,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445026000] [2024-10-11 19:46:56,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:46:56,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:46:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:46:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:46:56,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:46:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445026000] [2024-10-11 19:46:56,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445026000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:46:56,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:46:56,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:46:56,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907614452] [2024-10-11 19:46:56,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:46:56,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:46:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:46:56,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:46:56,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:46:56,955 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2024-10-11 19:46:56,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 763 transitions, 12366 flow. Second operand has 6 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 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-10-11 19:46:56,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:46:56,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2024-10-11 19:46:56,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:47:00,208 INFO L124 PetriNetUnfolderBase]: 5156/10618 cut-off events. [2024-10-11 19:47:00,208 INFO L125 PetriNetUnfolderBase]: For 240666/240811 co-relation queries the response was YES. [2024-10-11 19:47:00,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73355 conditions, 10618 events. 5156/10618 cut-off events. For 240666/240811 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 84533 event pairs, 864 based on Foata normal form. 368/10635 useless extension candidates. Maximal degree in co-relation 73236. Up to 4642 conditions per place. [2024-10-11 19:47:00,363 INFO L140 encePairwiseOnDemand]: 61/75 looper letters, 822 selfloop transitions, 402 changer transitions 1/1258 dead transitions. [2024-10-11 19:47:00,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 1258 transitions, 22975 flow [2024-10-11 19:47:00,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:47:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:47:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 319 transitions. [2024-10-11 19:47:00,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6076190476190476 [2024-10-11 19:47:00,365 INFO L175 Difference]: Start difference. First operand has 325 places, 763 transitions, 12366 flow. Second operand 7 states and 319 transitions. [2024-10-11 19:47:00,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 1258 transitions, 22975 flow [2024-10-11 19:47:01,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 1258 transitions, 21321 flow, removed 826 selfloop flow, removed 1 redundant places. [2024-10-11 19:47:01,321 INFO L231 Difference]: Finished difference. Result has 335 places, 925 transitions, 15878 flow [2024-10-11 19:47:01,321 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=11492, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=267, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=15878, PETRI_PLACES=335, PETRI_TRANSITIONS=925} [2024-10-11 19:47:01,322 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 267 predicate places. [2024-10-11 19:47:01,322 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 925 transitions, 15878 flow [2024-10-11 19:47:01,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 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-10-11 19:47:01,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:47:01,322 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-10-11 19:47:01,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 19:47:01,323 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:47:01,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:47:01,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1316049234, now seen corresponding path program 1 times [2024-10-11 19:47:01,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:47:01,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344559311] [2024-10-11 19:47:01,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:47:01,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:47:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:47:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:47:01,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:47:01,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344559311] [2024-10-11 19:47:01,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344559311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:47:01,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:47:01,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 19:47:01,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638911545] [2024-10-11 19:47:01,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:47:01,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 19:47:01,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:47:01,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 19:47:01,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:47:01,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2024-10-11 19:47:01,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 925 transitions, 15878 flow. Second operand has 11 states, 11 states have (on average 35.63636363636363) internal successors, (392), 11 states have internal predecessors, (392), 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-10-11 19:47:01,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:47:01,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2024-10-11 19:47:01,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:47:05,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([437] L19-11-->L727: Formula: true InVars {} OutVars{workerThread1of1ForFork0_pqueue_get_#t~mem9#1=|v_workerThread1of1ForFork0_pqueue_get_#t~mem9#1_5|, workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1_5|, workerThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_workerThread1of1ForFork0___VERIFIER_assert_~cond#1_13|} AuxVars[] AssignedVars[workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1, workerThread1of1ForFork0_pqueue_get_#t~mem9#1, workerThread1of1ForFork0___VERIFIER_assert_~cond#1][701], [Black: 764#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 767#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 765#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 763#(or (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (< |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 1)), Black: 543#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 529#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 533#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 53#L727true, Black: 537#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 519#(<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)), Black: 525#(<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|), Black: 545#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 547#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 539#(and (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 278#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 541#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 288#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 531#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 549#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 298#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 292#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 520#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 274#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 286#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 300#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 290#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 266#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 265#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), 796#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 272#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 264#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 270#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 722#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 341#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 337#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 565#true, Black: 353#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 323#(<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)), Black: 324#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|))), Black: 347#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 70#true, Black: 351#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 349#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 335#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 345#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 343#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 333#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 516#true, Black: 570#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 579#(and (not (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 574#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 575#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 611#(and (not (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 585#(and (not (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 587#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 571#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 613#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 607#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 120#(<= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0), Black: 122#(<= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0), Black: 128#(and (<= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (<= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (<= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0)), Black: 126#(and (<= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (<= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0)), Black: 138#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 144#(and (= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0) (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 142#(and (= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0) (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), 80#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 117#true, Black: 673#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 681#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 687#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 655#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 675#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 671#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 661#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 665#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 683#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 679#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 155#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~post4#1| 0)), Black: 440#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 178#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~post4#1| 0) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0)), Black: 667#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 648#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 406#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 418#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 677#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 689#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 685#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 404#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 659#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 405#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 669#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 412#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 663#(and (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 397#true, Black: 434#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 410#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 257#true, Black: 202#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0)), Black: 472#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (or (< |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|)))), Black: 738#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 149#true, 760#true, Black: 740#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 714#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 726#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 742#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 34#L714-4true, Black: 744#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 734#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 736#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 730#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 732#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 728#(and (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 724#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 248#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1) 0)), Black: 242#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1) 0))]) [2024-10-11 19:47:05,938 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-10-11 19:47:05,938 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:47:05,938 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-11 19:47:05,938 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:47:05,938 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L714-4-->L716-2: Formula: (and (= |v_ULTIMATE.start_pqueue_put_#t~ret5#1_7| 0) (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_ULTIMATE.start_pqueue_put_~qp#1.base_23| (store (select |v_#pthreadsMutex_30| |v_ULTIMATE.start_pqueue_put_~qp#1.base_23|) (+ |v_ULTIMATE.start_pqueue_put_~qp#1.offset_20| 4) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ULTIMATE.start_pqueue_put_~qp#1.offset=|v_ULTIMATE.start_pqueue_put_~qp#1.offset_20|, ULTIMATE.start_pqueue_put_~qp#1.base=|v_ULTIMATE.start_pqueue_put_~qp#1.base_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ULTIMATE.start_pqueue_put_~qp#1.offset=|v_ULTIMATE.start_pqueue_put_~qp#1.offset_20|, ULTIMATE.start_pqueue_put_~qp#1.base=|v_ULTIMATE.start_pqueue_put_~qp#1.base_23|, ULTIMATE.start_pqueue_put_#t~ret5#1=|v_ULTIMATE.start_pqueue_put_#t~ret5#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_pqueue_put_#t~ret5#1][702], [Black: 764#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 767#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 760#true, Black: 763#(or (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (< |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 1)), Black: 543#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 529#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 533#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 537#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 519#(<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)), Black: 525#(<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|), Black: 545#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 547#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 539#(and (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 278#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 541#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 288#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 531#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 549#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 298#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 292#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 520#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 274#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 286#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 300#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 290#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 265#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 257#true, 796#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 272#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 264#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 270#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 722#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 341#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 337#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 353#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 323#(<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)), Black: 324#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|))), Black: 347#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 70#true, Black: 351#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 349#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 36#L716-2true, Black: 335#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 345#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 343#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 333#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 516#true, Black: 570#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 579#(and (not (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 574#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 565#true, Black: 611#(and (not (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 585#(and (not (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 587#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 571#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 613#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 607#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 120#(<= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0), Black: 122#(<= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0), Black: 128#(and (<= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (<= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (<= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0)), Black: 126#(and (<= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (<= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0)), 765#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 133#true, Black: 144#(and (= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0) (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 142#(and (= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0) (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), 575#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), 80#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 117#true, Black: 673#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 681#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 687#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 655#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 675#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 671#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 661#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 665#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 683#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 679#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 155#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~post4#1| 0)), Black: 440#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 178#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~post4#1| 0) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0)), Black: 667#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 648#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 418#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 397#true, Black: 677#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 689#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 685#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 404#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), 406#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 659#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 405#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 669#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 412#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 663#(and (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 434#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 410#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 158#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), 22#L19-11true, Black: 202#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0)), Black: 472#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (or (< |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|)))), 266#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 738#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 740#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 714#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 726#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 742#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 744#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 734#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 736#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 730#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 732#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 728#(and (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 724#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 248#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1) 0)), Black: 242#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1) 0))]) [2024-10-11 19:47:05,940 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-10-11 19:47:05,940 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:47:05,940 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:47:05,940 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-11 19:47:06,634 INFO L124 PetriNetUnfolderBase]: 6189/12815 cut-off events. [2024-10-11 19:47:06,635 INFO L125 PetriNetUnfolderBase]: For 295354/295490 co-relation queries the response was YES. [2024-10-11 19:47:06,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89062 conditions, 12815 events. 6189/12815 cut-off events. For 295354/295490 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 108149 event pairs, 691 based on Foata normal form. 204/12549 useless extension candidates. Maximal degree in co-relation 88937. Up to 3375 conditions per place. [2024-10-11 19:47:06,796 INFO L140 encePairwiseOnDemand]: 60/75 looper letters, 590 selfloop transitions, 881 changer transitions 32/1540 dead transitions. [2024-10-11 19:47:06,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 1540 transitions, 29406 flow [2024-10-11 19:47:06,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 19:47:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-10-11 19:47:06,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 921 transitions. [2024-10-11 19:47:06,797 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.614 [2024-10-11 19:47:06,797 INFO L175 Difference]: Start difference. First operand has 335 places, 925 transitions, 15878 flow. Second operand 20 states and 921 transitions. [2024-10-11 19:47:06,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 1540 transitions, 29406 flow [2024-10-11 19:47:08,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 1540 transitions, 28972 flow, removed 216 selfloop flow, removed 1 redundant places. [2024-10-11 19:47:08,043 INFO L231 Difference]: Finished difference. Result has 366 places, 1230 transitions, 24846 flow [2024-10-11 19:47:08,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=15569, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=570, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=24846, PETRI_PLACES=366, PETRI_TRANSITIONS=1230} [2024-10-11 19:47:08,044 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 298 predicate places. [2024-10-11 19:47:08,044 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 1230 transitions, 24846 flow [2024-10-11 19:47:08,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.63636363636363) internal successors, (392), 11 states have internal predecessors, (392), 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-10-11 19:47:08,045 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:47:08,045 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:47:08,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 19:47:08,045 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:47:08,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:47:08,046 INFO L85 PathProgramCache]: Analyzing trace with hash 521906886, now seen corresponding path program 1 times [2024-10-11 19:47:08,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:47:08,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242560891] [2024-10-11 19:47:08,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:47:08,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:47:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:47:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:47:08,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:47:08,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242560891] [2024-10-11 19:47:08,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242560891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:47:08,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:47:08,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 19:47:08,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739834101] [2024-10-11 19:47:08,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:47:08,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:47:08,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:47:08,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:47:08,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:47:08,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2024-10-11 19:47:08,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 1230 transitions, 24846 flow. Second operand has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 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-10-11 19:47:08,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:47:08,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2024-10-11 19:47:08,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:47:12,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L714-4-->L716-2: Formula: (and (= |v_ULTIMATE.start_pqueue_put_#t~ret5#1_7| 0) (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_ULTIMATE.start_pqueue_put_~qp#1.base_23| (store (select |v_#pthreadsMutex_30| |v_ULTIMATE.start_pqueue_put_~qp#1.base_23|) (+ |v_ULTIMATE.start_pqueue_put_~qp#1.offset_20| 4) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ULTIMATE.start_pqueue_put_~qp#1.offset=|v_ULTIMATE.start_pqueue_put_~qp#1.offset_20|, ULTIMATE.start_pqueue_put_~qp#1.base=|v_ULTIMATE.start_pqueue_put_~qp#1.base_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ULTIMATE.start_pqueue_put_~qp#1.offset=|v_ULTIMATE.start_pqueue_put_~qp#1.offset_20|, ULTIMATE.start_pqueue_put_~qp#1.base=|v_ULTIMATE.start_pqueue_put_~qp#1.base_23|, ULTIMATE.start_pqueue_put_#t~ret5#1=|v_ULTIMATE.start_pqueue_put_#t~ret5#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_pqueue_put_#t~ret5#1][493], [Black: 764#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 767#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 760#true, Black: 763#(or (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (< |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 1)), Black: 543#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 808#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 529#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 533#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 806#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 537#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 804#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (<= 1 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 798#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 519#(<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)), Black: 525#(<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|), Black: 781#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 545#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 788#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 547#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 790#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 539#(and (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 792#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 541#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 794#(and (<= 1 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 278#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 288#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 782#(<= 1 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)), Black: 531#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 549#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 800#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 298#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 520#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 292#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 802#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 274#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 286#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 300#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 290#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 265#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 257#true, Black: 272#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), 796#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 264#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 270#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 722#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 341#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 830#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 337#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 353#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 323#(<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)), Black: 324#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|))), Black: 347#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 70#true, Black: 351#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 349#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 335#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), 36#L716-2true, Black: 345#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 343#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 333#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 516#true, Black: 570#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 579#(and (not (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 574#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 565#true, Black: 611#(and (not (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 585#(and (not (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 587#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 571#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 613#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 607#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 120#(<= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0), Black: 122#(<= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0), Black: 128#(and (<= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (<= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (<= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0)), Black: 126#(and (<= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (<= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0)), 765#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 133#true, Black: 144#(and (= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0) (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 142#(and (= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0) (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), 575#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), 80#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 117#true, Black: 673#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 687#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 681#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 655#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 675#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 671#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 661#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 665#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 683#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 679#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 155#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~post4#1| 0)), Black: 440#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 667#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 178#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~post4#1| 0) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0)), Black: 648#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 418#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 397#true, Black: 677#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 689#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 685#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 404#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 659#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 405#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), 406#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 669#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 412#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 663#(and (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 434#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 410#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 158#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), 22#L19-11true, Black: 202#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0)), Black: 472#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (or (< |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|)))), Black: 738#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 266#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 740#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 714#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 726#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 742#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 744#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 734#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 736#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 730#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 732#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 728#(and (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 724#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 248#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1) 0)), Black: 242#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1) 0))]) [2024-10-11 19:47:12,929 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-10-11 19:47:12,929 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:47:12,929 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:47:12,929 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-11 19:47:12,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([437] L19-11-->L727: Formula: true InVars {} OutVars{workerThread1of1ForFork0_pqueue_get_#t~mem9#1=|v_workerThread1of1ForFork0_pqueue_get_#t~mem9#1_5|, workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1_5|, workerThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_workerThread1of1ForFork0___VERIFIER_assert_~cond#1_13|} AuxVars[] AssignedVars[workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1, workerThread1of1ForFork0_pqueue_get_#t~mem9#1, workerThread1of1ForFork0___VERIFIER_assert_~cond#1][611], [Black: 764#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 767#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 765#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 763#(or (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (< |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 1)), Black: 543#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 808#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 529#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 533#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 806#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 53#L727true, Black: 537#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 804#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (<= 1 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 798#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 519#(<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)), Black: 525#(<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|), Black: 781#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 545#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 788#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 547#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 790#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 539#(and (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 792#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 541#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 794#(and (<= 1 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 278#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 288#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 782#(<= 1 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)), Black: 531#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 549#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 800#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 298#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 520#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 292#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 802#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 274#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 286#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 300#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 290#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 266#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 265#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 272#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), 796#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 264#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 270#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 722#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 341#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 830#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 337#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 565#true, Black: 353#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 323#(<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)), Black: 324#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|))), Black: 347#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 70#true, Black: 351#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 349#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 335#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 345#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 343#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 333#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 516#true, Black: 570#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 579#(and (not (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 574#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 575#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 611#(and (not (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 585#(and (not (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 587#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 571#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 613#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 607#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 120#(<= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0), Black: 122#(<= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0), Black: 128#(and (<= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (<= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (<= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0)), Black: 126#(and (<= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (<= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0)), Black: 138#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 144#(and (= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0) (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 142#(and (= (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|) 0) (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), 80#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 117#true, Black: 673#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 687#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 681#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 655#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 675#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 671#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 661#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 665#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 683#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 679#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 155#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~post4#1| 0)), Black: 440#(and (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 667#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 178#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~post4#1| 0) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0)), Black: 648#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 406#(not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 418#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 677#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 689#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 685#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 404#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 659#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 405#(not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 669#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 412#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 663#(and (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 397#true, Black: 434#(and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 410#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 257#true, Black: 202#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0)), Black: 472#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (or (< |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|)))), Black: 738#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), 149#true, 760#true, Black: 740#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 714#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 726#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 742#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 744#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), 34#L714-4true, Black: 734#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 736#(and (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 730#(and (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 732#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (<= 1 |workerThread1of1ForFork0_pqueue_get_#t~mem7#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 728#(and (<= 0 (select (select |#memory_int#1| |~#pqb~0.base|) |~#pqb~0.offset|)) (<= 1 (select (select |#memory_int#1| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 724#(and (<= 0 |ULTIMATE.start_pqueue_put_#t~post4#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (<= 0 (select (select |#memory_int#1| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 248#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1) 0)), Black: 242#(and (= |~#pqb~0.offset| 0) (= (select (select |#memory_int#1| |~#pqb~0.base|) 0) 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (<= (+ |ULTIMATE.start_pqueue_put_~qp#1.offset| 1) 0))]) [2024-10-11 19:47:12,929 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-10-11 19:47:12,929 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:47:12,929 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-11 19:47:12,929 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-11 19:47:13,788 INFO L124 PetriNetUnfolderBase]: 6598/13688 cut-off events. [2024-10-11 19:47:13,788 INFO L125 PetriNetUnfolderBase]: For 339539/339640 co-relation queries the response was YES. [2024-10-11 19:47:13,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105161 conditions, 13688 events. 6598/13688 cut-off events. For 339539/339640 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 115491 event pairs, 2079 based on Foata normal form. 45/13221 useless extension candidates. Maximal degree in co-relation 105022. Up to 6001 conditions per place. [2024-10-11 19:47:13,997 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 828 selfloop transitions, 574 changer transitions 13/1451 dead transitions. [2024-10-11 19:47:13,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 1451 transitions, 32119 flow [2024-10-11 19:47:13,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:47:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:47:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 375 transitions. [2024-10-11 19:47:13,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-10-11 19:47:13,998 INFO L175 Difference]: Start difference. First operand has 366 places, 1230 transitions, 24846 flow. Second operand 8 states and 375 transitions. [2024-10-11 19:47:13,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 1451 transitions, 32119 flow [2024-10-11 19:47:16,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 1451 transitions, 30548 flow, removed 604 selfloop flow, removed 5 redundant places. [2024-10-11 19:47:16,320 INFO L231 Difference]: Finished difference. Result has 374 places, 1315 transitions, 27591 flow [2024-10-11 19:47:16,321 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=23662, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=492, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=27591, PETRI_PLACES=374, PETRI_TRANSITIONS=1315} [2024-10-11 19:47:16,321 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 306 predicate places. [2024-10-11 19:47:16,321 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 1315 transitions, 27591 flow [2024-10-11 19:47:16,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 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-10-11 19:47:16,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:47:16,322 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:47:16,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 19:47:16,322 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting workerErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:47:16,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:47:16,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1928611526, now seen corresponding path program 2 times [2024-10-11 19:47:16,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:47:16,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923830008] [2024-10-11 19:47:16,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:47:16,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:47:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:47:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:47:16,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:47:16,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923830008] [2024-10-11 19:47:16,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923830008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:47:16,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:47:16,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:47:16,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239069934] [2024-10-11 19:47:16,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:47:16,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:47:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:47:16,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:47:16,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:47:16,487 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2024-10-11 19:47:16,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 1315 transitions, 27591 flow. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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-10-11 19:47:16,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:47:16,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2024-10-11 19:47:16,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:47:20,972 INFO L124 PetriNetUnfolderBase]: 5732/11675 cut-off events. [2024-10-11 19:47:20,973 INFO L125 PetriNetUnfolderBase]: For 289664/289888 co-relation queries the response was YES. [2024-10-11 19:47:21,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91574 conditions, 11675 events. 5732/11675 cut-off events. For 289664/289888 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 95529 event pairs, 2533 based on Foata normal form. 68/11230 useless extension candidates. Maximal degree in co-relation 91440. Up to 10049 conditions per place. [2024-10-11 19:47:21,179 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 1018 selfloop transitions, 16 changer transitions 5/1112 dead transitions. [2024-10-11 19:47:21,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 1112 transitions, 24823 flow [2024-10-11 19:47:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:47:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:47:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 256 transitions. [2024-10-11 19:47:21,180 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5688888888888889 [2024-10-11 19:47:21,180 INFO L175 Difference]: Start difference. First operand has 374 places, 1315 transitions, 27591 flow. Second operand 6 states and 256 transitions. [2024-10-11 19:47:21,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 1112 transitions, 24823 flow [2024-10-11 19:47:22,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 1112 transitions, 23234 flow, removed 499 selfloop flow, removed 34 redundant places. [2024-10-11 19:47:22,970 INFO L231 Difference]: Finished difference. Result has 312 places, 1106 transitions, 21133 flow [2024-10-11 19:47:22,972 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=21124, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1092, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=21133, PETRI_PLACES=312, PETRI_TRANSITIONS=1106} [2024-10-11 19:47:22,972 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 244 predicate places. [2024-10-11 19:47:22,972 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 1106 transitions, 21133 flow [2024-10-11 19:47:22,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 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-10-11 19:47:22,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:47:22,973 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:47:22,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 19:47:22,973 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting workerErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2024-10-11 19:47:22,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:47:22,974 INFO L85 PathProgramCache]: Analyzing trace with hash 139231935, now seen corresponding path program 1 times [2024-10-11 19:47:22,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:47:22,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269213344] [2024-10-11 19:47:22,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:47:22,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:47:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:47:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:47:23,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:47:23,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269213344] [2024-10-11 19:47:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269213344] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:47:23,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199191913] [2024-10-11 19:47:23,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:47:23,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:47:23,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:47:23,440 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 19:47:23,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 19:47:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:47:23,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 19:47:23,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:47:23,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 19:47:23,949 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 19:47:23,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 11 [2024-10-11 19:47:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:47:23,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:47:24,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-10-11 19:47:24,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-11 19:47:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:47:24,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199191913] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:47:24,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:47:24,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 25 [2024-10-11 19:47:24,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936263909] [2024-10-11 19:47:24,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:47:24,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:47:24,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:47:24,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:47:24,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:47:25,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2024-10-11 19:47:25,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 1106 transitions, 21133 flow. Second operand has 26 states, 26 states have (on average 33.53846153846154) internal successors, (872), 26 states have internal predecessors, (872), 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-10-11 19:47:25,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:47:25,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2024-10-11 19:47:25,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:47:37,356 INFO L124 PetriNetUnfolderBase]: 10838/21802 cut-off events. [2024-10-11 19:47:37,356 INFO L125 PetriNetUnfolderBase]: For 452794/452826 co-relation queries the response was YES. [2024-10-11 19:47:37,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160865 conditions, 21802 events. 10838/21802 cut-off events. For 452794/452826 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 178267 event pairs, 732 based on Foata normal form. 442/21458 useless extension candidates. Maximal degree in co-relation 160753. Up to 5669 conditions per place.