./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-parray-copy.wvr.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 48c9605d
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-parray-copy.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7aea5f8d9182df5a5d01671c1aa4ef829b038428d2f68272ec4ea6e120e3973d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-08 05:40:36,258 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-08 05:40:36,313 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2025-02-08 05:40:36,322 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-08 05:40:36,322 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-08 05:40:36,345 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-08 05:40:36,345 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-08 05:40:36,345 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-08 05:40:36,345 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-08 05:40:36,345 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-08 05:40:36,346 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-08 05:40:36,346 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-08 05:40:36,346 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-08 05:40:36,346 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-08 05:40:36,346 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-08 05:40:36,346 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-08 05:40:36,346 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-08 05:40:36,346 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-08 05:40:36,346 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-08 05:40:36,346 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-08 05:40:36,346 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-08 05:40:36,346 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-08 05:40:36,346 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2025-02-08 05:40:36,346 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-02-08 05:40:36,346 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-08 05:40:36,346 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-08 05:40:36,348 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-08 05:40:36,348 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-08 05:40:36,348 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-08 05:40:36,349 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-08 05:40:36,349 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-08 05:40:36,349 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-08 05:40:36,349 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-08 05:40:36,349 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-08 05:40:36,349 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-08 05:40:36,349 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-08 05:40:36,349 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-08 05:40:36,349 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-08 05:40:36,349 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-08 05:40:36,349 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-08 05:40:36,349 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-08 05:40:36,349 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-08 05:40:36,350 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


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 -> 7aea5f8d9182df5a5d01671c1aa4ef829b038428d2f68272ec4ea6e120e3973d
[2025-02-08 05:40:36,570 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-08 05:40:36,581 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-08 05:40:36,582 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-08 05:40:36,584 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-08 05:40:36,584 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-08 05:40:36,585 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-parray-copy.wvr.c
[2025-02-08 05:40:37,876 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1286bfee4/87d58fe92c0f4a50835bdbc251bc4c87/FLAG1b586caf3
[2025-02-08 05:40:38,163 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-08 05:40:38,163 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-parray-copy.wvr.c
[2025-02-08 05:40:38,172 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1286bfee4/87d58fe92c0f4a50835bdbc251bc4c87/FLAG1b586caf3
[2025-02-08 05:40:38,481 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1286bfee4/87d58fe92c0f4a50835bdbc251bc4c87
[2025-02-08 05:40:38,484 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-08 05:40:38,485 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-08 05:40:38,486 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-08 05:40:38,487 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-08 05:40:38,490 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-08 05:40:38,490 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:38" (1/1) ...
[2025-02-08 05:40:38,492 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3831e00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:38, skipping insertion in model container
[2025-02-08 05:40:38,492 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:38" (1/1) ...
[2025-02-08 05:40:38,505 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-08 05:40:38,642 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 05:40:38,649 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-08 05:40:38,675 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 05:40:38,692 INFO  L204         MainTranslator]: Completed translation
[2025-02-08 05:40:38,693 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:38 WrapperNode
[2025-02-08 05:40:38,693 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-08 05:40:38,693 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-08 05:40:38,694 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-08 05:40:38,694 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-08 05:40:38,697 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:38" (1/1) ...
[2025-02-08 05:40:38,704 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:38" (1/1) ...
[2025-02-08 05:40:38,718 INFO  L138                Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 187
[2025-02-08 05:40:38,719 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-08 05:40:38,719 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-08 05:40:38,719 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-08 05:40:38,719 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-08 05:40:38,724 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:38" (1/1) ...
[2025-02-08 05:40:38,724 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:38" (1/1) ...
[2025-02-08 05:40:38,727 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:38" (1/1) ...
[2025-02-08 05:40:38,728 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:38" (1/1) ...
[2025-02-08 05:40:38,741 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:38" (1/1) ...
[2025-02-08 05:40:38,743 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:38" (1/1) ...
[2025-02-08 05:40:38,744 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:38" (1/1) ...
[2025-02-08 05:40:38,745 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:38" (1/1) ...
[2025-02-08 05:40:38,747 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-08 05:40:38,747 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-08 05:40:38,747 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-08 05:40:38,747 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-08 05:40:38,748 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:38" (1/1) ...
[2025-02-08 05:40:38,751 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-08 05:40:38,759 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 05:40:38,768 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-08 05:40:38,776 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-08 05:40:38,788 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-08 05:40:38,788 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2025-02-08 05:40:38,788 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2025-02-08 05:40:38,788 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2025-02-08 05:40:38,788 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2025-02-08 05:40:38,788 INFO  L130     BoogieDeclarations]: Found specification of procedure thread3
[2025-02-08 05:40:38,789 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread3
[2025-02-08 05:40:38,789 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-02-08 05:40:38,789 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2025-02-08 05:40:38,789 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2025-02-08 05:40:38,789 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-08 05:40:38,789 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-08 05:40:38,789 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2025-02-08 05:40:38,790 WARN  L227             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-02-08 05:40:38,864 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-08 05:40:38,870 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-08 05:40:39,551 INFO  L304             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-02-08 05:40:39,552 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-08 05:40:39,578 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-08 05:40:39,580 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-08 05:40:39,580 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:39 BoogieIcfgContainer
[2025-02-08 05:40:39,584 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-08 05:40:39,586 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-08 05:40:39,586 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-08 05:40:39,593 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-08 05:40:39,593 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:40:38" (1/3) ...
[2025-02-08 05:40:39,593 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ac7784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:39, skipping insertion in model container
[2025-02-08 05:40:39,593 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:38" (2/3) ...
[2025-02-08 05:40:39,594 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ac7784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:39, skipping insertion in model container
[2025-02-08 05:40:39,594 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:39" (3/3) ...
[2025-02-08 05:40:39,594 INFO  L128   eAbstractionObserver]: Analyzing ICFG popl20-more-parray-copy.wvr.c
[2025-02-08 05:40:39,617 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-08 05:40:39,621 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-parray-copy.wvr.c that has 4 procedures, 347 locations, 1 initial locations, 5 loop locations, and 32 error locations.
[2025-02-08 05:40:39,622 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-02-08 05:40:39,792 INFO  L143    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2025-02-08 05:40:39,842 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 356 places, 363 transitions, 747 flow
[2025-02-08 05:40:40,005 INFO  L124   PetriNetUnfolderBase]: 17/360 cut-off events.
[2025-02-08 05:40:40,006 INFO  L125   PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2025-02-08 05:40:40,015 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 373 conditions, 360 events. 17/360 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 536 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 260. Up to 2 conditions per place. 
[2025-02-08 05:40:40,015 INFO  L82        GeneralOperation]: Start removeDead. Operand has 356 places, 363 transitions, 747 flow
[2025-02-08 05:40:40,030 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 335 places, 341 transitions, 700 flow
[2025-02-08 05:40:40,040 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-08 05:40:40,055 INFO  L333      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e85165f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-08 05:40:40,056 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 51 error locations.
[2025-02-08 05:40:40,064 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-02-08 05:40:40,064 INFO  L124   PetriNetUnfolderBase]: 0/21 cut-off events.
[2025-02-08 05:40:40,064 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-02-08 05:40:40,065 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:40:40,065 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:40:40,065 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:40:40,078 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:40:40,078 INFO  L85        PathProgramCache]: Analyzing trace with hash -1149443587, now seen corresponding path program 1 times
[2025-02-08 05:40:40,091 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:40:40,091 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516158089]
[2025-02-08 05:40:40,091 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:40:40,092 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:40:40,173 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-02-08 05:40:40,192 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-02-08 05:40:40,192 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:40:40,192 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:40:40,296 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:40:40,297 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:40:40,297 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516158089]
[2025-02-08 05:40:40,297 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516158089] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:40:40,306 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:40:40,306 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:40:40,307 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248361194]
[2025-02-08 05:40:40,307 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:40:40,315 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:40:40,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:40:40,353 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:40:40,354 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:40:40,412 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 335 out of 363
[2025-02-08 05:40:40,415 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 341 transitions, 700 flow. Second operand  has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:40,415 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:40:40,415 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 363
[2025-02-08 05:40:40,426 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:40:40,563 INFO  L124   PetriNetUnfolderBase]: 21/558 cut-off events.
[2025-02-08 05:40:40,564 INFO  L125   PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES.
[2025-02-08 05:40:40,567 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 610 conditions, 558 events. 21/558 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1900 event pairs, 7 based on Foata normal form. 18/491 useless extension candidates. Maximal degree in co-relation 335. Up to 31 conditions per place. 
[2025-02-08 05:40:40,571 INFO  L140   encePairwiseOnDemand]: 351/363 looper letters, 13 selfloop transitions, 2 changer transitions 6/331 dead transitions.
[2025-02-08 05:40:40,571 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 331 transitions, 710 flow
[2025-02-08 05:40:40,572 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:40:40,574 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:40:40,582 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1030 transitions.
[2025-02-08 05:40:40,588 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.945821854912764
[2025-02-08 05:40:40,592 INFO  L175             Difference]: Start difference. First operand has 335 places, 341 transitions, 700 flow. Second operand 3 states and 1030 transitions.
[2025-02-08 05:40:40,593 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 331 transitions, 710 flow
[2025-02-08 05:40:40,605 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 331 transitions, 698 flow, removed 0 selfloop flow, removed 6 redundant places.
[2025-02-08 05:40:40,613 INFO  L231             Difference]: Finished difference. Result has 330 places, 325 transitions, 660 flow
[2025-02-08 05:40:40,619 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=330, PETRI_TRANSITIONS=325}
[2025-02-08 05:40:40,629 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, -5 predicate places.
[2025-02-08 05:40:40,629 INFO  L471      AbstractCegarLoop]: Abstraction has has 330 places, 325 transitions, 660 flow
[2025-02-08 05:40:40,630 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:40,630 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:40:40,630 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:40:40,630 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-08 05:40:40,631 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:40:40,631 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:40:40,635 INFO  L85        PathProgramCache]: Analyzing trace with hash -606750713, now seen corresponding path program 1 times
[2025-02-08 05:40:40,636 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:40:40,636 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409941836]
[2025-02-08 05:40:40,636 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:40:40,636 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:40:40,645 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-02-08 05:40:40,653 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-02-08 05:40:40,654 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:40:40,654 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:40:40,690 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:40:40,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:40:40,691 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409941836]
[2025-02-08 05:40:40,691 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409941836] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:40:40,691 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:40:40,691 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:40:40,691 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459126620]
[2025-02-08 05:40:40,691 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:40:40,692 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:40:40,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:40:40,693 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:40:40,693 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:40:40,742 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 333 out of 363
[2025-02-08 05:40:40,743 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 325 transitions, 660 flow. Second operand  has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:40,743 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:40:40,744 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 363
[2025-02-08 05:40:40,744 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:40:40,816 INFO  L124   PetriNetUnfolderBase]: 15/436 cut-off events.
[2025-02-08 05:40:40,817 INFO  L125   PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2025-02-08 05:40:40,819 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 476 conditions, 436 events. 15/436 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1202 event pairs, 5 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 447. Up to 29 conditions per place. 
[2025-02-08 05:40:40,820 INFO  L140   encePairwiseOnDemand]: 360/363 looper letters, 15 selfloop transitions, 2 changer transitions 0/324 dead transitions.
[2025-02-08 05:40:40,820 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 324 transitions, 692 flow
[2025-02-08 05:40:40,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:40:40,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:40:40,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1017 transitions.
[2025-02-08 05:40:40,823 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9338842975206612
[2025-02-08 05:40:40,824 INFO  L175             Difference]: Start difference. First operand has 330 places, 325 transitions, 660 flow. Second operand 3 states and 1017 transitions.
[2025-02-08 05:40:40,824 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 324 transitions, 692 flow
[2025-02-08 05:40:40,825 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 324 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-08 05:40:40,828 INFO  L231             Difference]: Finished difference. Result has 323 places, 324 transitions, 658 flow
[2025-02-08 05:40:40,829 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=323, PETRI_TRANSITIONS=324}
[2025-02-08 05:40:40,829 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, -12 predicate places.
[2025-02-08 05:40:40,829 INFO  L471      AbstractCegarLoop]: Abstraction has has 323 places, 324 transitions, 658 flow
[2025-02-08 05:40:40,830 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:40,830 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:40:40,830 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:40:40,830 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-08 05:40:40,830 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:40:40,831 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:40:40,831 INFO  L85        PathProgramCache]: Analyzing trace with hash 192958197, now seen corresponding path program 1 times
[2025-02-08 05:40:40,831 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:40:40,831 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487216104]
[2025-02-08 05:40:40,831 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:40:40,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:40:40,836 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-02-08 05:40:40,838 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-02-08 05:40:40,839 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:40:40,839 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:40:40,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:40:40,854 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:40:40,854 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487216104]
[2025-02-08 05:40:40,855 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487216104] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:40:40,855 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:40:40,855 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:40:40,855 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722729160]
[2025-02-08 05:40:40,855 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:40:40,855 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:40:40,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:40:40,856 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:40:40,856 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:40:40,880 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 327 out of 363
[2025-02-08 05:40:40,881 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 324 transitions, 658 flow. Second operand  has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:40,881 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:40:40,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 363
[2025-02-08 05:40:40,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:40:40,950 INFO  L124   PetriNetUnfolderBase]: 27/536 cut-off events.
[2025-02-08 05:40:40,950 INFO  L125   PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES.
[2025-02-08 05:40:40,977 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 599 conditions, 536 events. 27/536 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1894 event pairs, 12 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 562. Up to 50 conditions per place. 
[2025-02-08 05:40:40,979 INFO  L140   encePairwiseOnDemand]: 356/363 looper letters, 18 selfloop transitions, 1 changer transitions 0/318 dead transitions.
[2025-02-08 05:40:40,979 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 318 transitions, 684 flow
[2025-02-08 05:40:40,982 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:40:40,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:40:40,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1006 transitions.
[2025-02-08 05:40:40,984 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9237832874196511
[2025-02-08 05:40:40,984 INFO  L175             Difference]: Start difference. First operand has 323 places, 324 transitions, 658 flow. Second operand 3 states and 1006 transitions.
[2025-02-08 05:40:40,984 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 318 transitions, 684 flow
[2025-02-08 05:40:40,991 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 318 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-08 05:40:40,994 INFO  L231             Difference]: Finished difference. Result has 317 places, 318 transitions, 644 flow
[2025-02-08 05:40:40,995 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=317, PETRI_TRANSITIONS=318}
[2025-02-08 05:40:40,999 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, -18 predicate places.
[2025-02-08 05:40:40,999 INFO  L471      AbstractCegarLoop]: Abstraction has has 317 places, 318 transitions, 644 flow
[2025-02-08 05:40:40,999 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:40,999 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:40:41,000 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:40:41,000 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-08 05:40:41,000 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:40:41,000 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:40:41,000 INFO  L85        PathProgramCache]: Analyzing trace with hash 730719381, now seen corresponding path program 1 times
[2025-02-08 05:40:41,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:40:41,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439927084]
[2025-02-08 05:40:41,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:40:41,001 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:40:41,019 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes.
[2025-02-08 05:40:41,070 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements.
[2025-02-08 05:40:41,070 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:40:41,070 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:40:41,673 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:40:41,673 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:40:41,673 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439927084]
[2025-02-08 05:40:41,673 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439927084] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:40:41,673 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:40:41,673 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 05:40:41,673 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398326693]
[2025-02-08 05:40:41,673 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:40:41,673 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 05:40:41,674 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:40:41,674 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 05:40:41,674 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-08 05:40:41,925 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 286 out of 363
[2025-02-08 05:40:41,926 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 318 transitions, 644 flow. Second operand  has 6 states, 6 states have (on average 287.5) internal successors, (1725), 6 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:41,927 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:40:41,927 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 363
[2025-02-08 05:40:41,927 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:40:42,810 INFO  L124   PetriNetUnfolderBase]: 1896/6685 cut-off events.
[2025-02-08 05:40:42,811 INFO  L125   PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES.
[2025-02-08 05:40:42,825 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9609 conditions, 6685 events. 1896/6685 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 64277 event pairs, 1520 based on Foata normal form. 0/5596 useless extension candidates. Maximal degree in co-relation 9573. Up to 2820 conditions per place. 
[2025-02-08 05:40:42,847 INFO  L140   encePairwiseOnDemand]: 351/363 looper letters, 54 selfloop transitions, 10 changer transitions 0/316 dead transitions.
[2025-02-08 05:40:42,848 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 316 transitions, 768 flow
[2025-02-08 05:40:42,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 05:40:42,848 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-08 05:40:42,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1782 transitions.
[2025-02-08 05:40:42,851 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8181818181818182
[2025-02-08 05:40:42,851 INFO  L175             Difference]: Start difference. First operand has 317 places, 318 transitions, 644 flow. Second operand 6 states and 1782 transitions.
[2025-02-08 05:40:42,852 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 316 transitions, 768 flow
[2025-02-08 05:40:42,853 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 316 transitions, 767 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-02-08 05:40:42,856 INFO  L231             Difference]: Finished difference. Result has 319 places, 316 transitions, 659 flow
[2025-02-08 05:40:42,856 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=659, PETRI_PLACES=319, PETRI_TRANSITIONS=316}
[2025-02-08 05:40:42,857 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, -16 predicate places.
[2025-02-08 05:40:42,857 INFO  L471      AbstractCegarLoop]: Abstraction has has 319 places, 316 transitions, 659 flow
[2025-02-08 05:40:42,858 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 287.5) internal successors, (1725), 6 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:42,858 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:40:42,858 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:40:42,858 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-08 05:40:42,859 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:40:42,859 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:40:42,860 INFO  L85        PathProgramCache]: Analyzing trace with hash 2004252551, now seen corresponding path program 1 times
[2025-02-08 05:40:42,860 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:40:42,860 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621545403]
[2025-02-08 05:40:42,860 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:40:42,860 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:40:42,871 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes.
[2025-02-08 05:40:42,877 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements.
[2025-02-08 05:40:42,877 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:40:42,877 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:40:42,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:40:42,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:40:42,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621545403]
[2025-02-08 05:40:42,904 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621545403] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:40:42,904 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:40:42,904 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:40:42,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802098836]
[2025-02-08 05:40:42,904 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:40:42,905 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:40:42,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:40:42,905 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:40:42,905 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:40:42,927 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 335 out of 363
[2025-02-08 05:40:42,928 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 316 transitions, 659 flow. Second operand  has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:42,928 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:40:42,928 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 363
[2025-02-08 05:40:42,928 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:40:43,003 INFO  L124   PetriNetUnfolderBase]: 26/499 cut-off events.
[2025-02-08 05:40:43,007 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2025-02-08 05:40:43,009 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 562 conditions, 499 events. 26/499 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1713 event pairs, 15 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 529. Up to 41 conditions per place. 
[2025-02-08 05:40:43,010 INFO  L140   encePairwiseOnDemand]: 360/363 looper letters, 13 selfloop transitions, 2 changer transitions 0/315 dead transitions.
[2025-02-08 05:40:43,010 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 315 transitions, 687 flow
[2025-02-08 05:40:43,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:40:43,011 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:40:43,012 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1021 transitions.
[2025-02-08 05:40:43,012 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9375573921028466
[2025-02-08 05:40:43,013 INFO  L175             Difference]: Start difference. First operand has 319 places, 316 transitions, 659 flow. Second operand 3 states and 1021 transitions.
[2025-02-08 05:40:43,013 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 315 transitions, 687 flow
[2025-02-08 05:40:43,014 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 315 transitions, 667 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-02-08 05:40:43,020 INFO  L231             Difference]: Finished difference. Result has 315 places, 315 transitions, 641 flow
[2025-02-08 05:40:43,025 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=315, PETRI_TRANSITIONS=315}
[2025-02-08 05:40:43,025 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, -20 predicate places.
[2025-02-08 05:40:43,026 INFO  L471      AbstractCegarLoop]: Abstraction has has 315 places, 315 transitions, 641 flow
[2025-02-08 05:40:43,026 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:43,026 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:40:43,027 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:40:43,027 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-08 05:40:43,029 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:40:43,030 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:40:43,030 INFO  L85        PathProgramCache]: Analyzing trace with hash -1485966833, now seen corresponding path program 1 times
[2025-02-08 05:40:43,030 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:40:43,030 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190776764]
[2025-02-08 05:40:43,030 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:40:43,030 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:40:43,047 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes.
[2025-02-08 05:40:43,054 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements.
[2025-02-08 05:40:43,055 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:40:43,055 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:40:43,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:40:43,147 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:40:43,147 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190776764]
[2025-02-08 05:40:43,147 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190776764] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:40:43,147 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:40:43,147 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:40:43,148 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84422764]
[2025-02-08 05:40:43,148 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:40:43,149 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:40:43,153 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:40:43,153 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:40:43,153 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:40:43,193 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 335 out of 363
[2025-02-08 05:40:43,195 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 315 transitions, 641 flow. Second operand  has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:43,195 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:40:43,195 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 363
[2025-02-08 05:40:43,195 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:40:43,254 INFO  L124   PetriNetUnfolderBase]: 34/557 cut-off events.
[2025-02-08 05:40:43,254 INFO  L125   PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES.
[2025-02-08 05:40:43,256 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 622 conditions, 557 events. 34/557 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2079 event pairs, 15 based on Foata normal form. 0/495 useless extension candidates. Maximal degree in co-relation 585. Up to 51 conditions per place. 
[2025-02-08 05:40:43,258 INFO  L140   encePairwiseOnDemand]: 360/363 looper letters, 13 selfloop transitions, 2 changer transitions 0/314 dead transitions.
[2025-02-08 05:40:43,258 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 314 transitions, 669 flow
[2025-02-08 05:40:43,258 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:40:43,258 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:40:43,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1021 transitions.
[2025-02-08 05:40:43,260 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9375573921028466
[2025-02-08 05:40:43,260 INFO  L175             Difference]: Start difference. First operand has 315 places, 315 transitions, 641 flow. Second operand 3 states and 1021 transitions.
[2025-02-08 05:40:43,260 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 314 transitions, 669 flow
[2025-02-08 05:40:43,262 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 314 transitions, 665 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-08 05:40:43,265 INFO  L231             Difference]: Finished difference. Result has 314 places, 314 transitions, 639 flow
[2025-02-08 05:40:43,265 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=314, PETRI_TRANSITIONS=314}
[2025-02-08 05:40:43,265 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, -21 predicate places.
[2025-02-08 05:40:43,266 INFO  L471      AbstractCegarLoop]: Abstraction has has 314 places, 314 transitions, 639 flow
[2025-02-08 05:40:43,266 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:43,266 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:40:43,266 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:40:43,267 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-08 05:40:43,267 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:40:43,267 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:40:43,267 INFO  L85        PathProgramCache]: Analyzing trace with hash 2097306690, now seen corresponding path program 1 times
[2025-02-08 05:40:43,267 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:40:43,267 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598389781]
[2025-02-08 05:40:43,268 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:40:43,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:40:43,276 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes.
[2025-02-08 05:40:43,280 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements.
[2025-02-08 05:40:43,281 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:40:43,281 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:40:43,308 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:40:43,309 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:40:43,309 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598389781]
[2025-02-08 05:40:43,309 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598389781] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:40:43,309 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:40:43,309 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:40:43,309 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671120274]
[2025-02-08 05:40:43,309 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:40:43,309 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:40:43,310 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:40:43,310 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:40:43,310 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:40:43,324 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 333 out of 363
[2025-02-08 05:40:43,326 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 314 transitions, 639 flow. Second operand  has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:43,326 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:40:43,326 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 363
[2025-02-08 05:40:43,326 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:40:43,390 INFO  L124   PetriNetUnfolderBase]: 39/649 cut-off events.
[2025-02-08 05:40:43,390 INFO  L125   PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES.
[2025-02-08 05:40:43,393 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 717 conditions, 649 events. 39/649 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2776 event pairs, 20 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 680. Up to 56 conditions per place. 
[2025-02-08 05:40:43,395 INFO  L140   encePairwiseOnDemand]: 358/363 looper letters, 14 selfloop transitions, 1 changer transitions 0/310 dead transitions.
[2025-02-08 05:40:43,395 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 310 transitions, 661 flow
[2025-02-08 05:40:43,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:40:43,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:40:43,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions.
[2025-02-08 05:40:43,397 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9348025711662076
[2025-02-08 05:40:43,398 INFO  L175             Difference]: Start difference. First operand has 314 places, 314 transitions, 639 flow. Second operand 3 states and 1018 transitions.
[2025-02-08 05:40:43,398 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 310 transitions, 661 flow
[2025-02-08 05:40:43,399 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 310 transitions, 657 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-08 05:40:43,402 INFO  L231             Difference]: Finished difference. Result has 310 places, 310 transitions, 629 flow
[2025-02-08 05:40:43,402 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=310, PETRI_TRANSITIONS=310}
[2025-02-08 05:40:43,402 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, -25 predicate places.
[2025-02-08 05:40:43,402 INFO  L471      AbstractCegarLoop]: Abstraction has has 310 places, 310 transitions, 629 flow
[2025-02-08 05:40:43,403 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:43,403 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:40:43,403 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:40:43,403 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-08 05:40:43,404 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:40:43,404 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:40:43,404 INFO  L85        PathProgramCache]: Analyzing trace with hash -944483605, now seen corresponding path program 1 times
[2025-02-08 05:40:43,404 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:40:43,404 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513158081]
[2025-02-08 05:40:43,404 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:40:43,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:40:43,413 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes.
[2025-02-08 05:40:43,422 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements.
[2025-02-08 05:40:43,423 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:40:43,423 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:40:43,453 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:40:43,453 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:40:43,454 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513158081]
[2025-02-08 05:40:43,454 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513158081] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:40:43,454 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:40:43,454 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:40:43,454 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134905215]
[2025-02-08 05:40:43,454 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:40:43,455 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:40:43,455 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:40:43,455 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:40:43,455 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:40:43,470 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 333 out of 363
[2025-02-08 05:40:43,471 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 310 transitions, 629 flow. Second operand  has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:43,472 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:40:43,472 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 363
[2025-02-08 05:40:43,472 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:40:43,603 INFO  L124   PetriNetUnfolderBase]: 118/1290 cut-off events.
[2025-02-08 05:40:43,603 INFO  L125   PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES.
[2025-02-08 05:40:43,607 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 1290 events. 118/1290 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 8412 event pairs, 22 based on Foata normal form. 0/1139 useless extension candidates. Maximal degree in co-relation 1443. Up to 164 conditions per place. 
[2025-02-08 05:40:43,613 INFO  L140   encePairwiseOnDemand]: 355/363 looper letters, 20 selfloop transitions, 4 changer transitions 0/315 dead transitions.
[2025-02-08 05:40:43,613 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 315 transitions, 692 flow
[2025-02-08 05:40:43,614 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:40:43,614 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:40:43,615 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1027 transitions.
[2025-02-08 05:40:43,616 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9430670339761249
[2025-02-08 05:40:43,616 INFO  L175             Difference]: Start difference. First operand has 310 places, 310 transitions, 629 flow. Second operand 3 states and 1027 transitions.
[2025-02-08 05:40:43,616 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 315 transitions, 692 flow
[2025-02-08 05:40:43,619 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 315 transitions, 691 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-02-08 05:40:43,624 INFO  L231             Difference]: Finished difference. Result has 308 places, 310 transitions, 648 flow
[2025-02-08 05:40:43,625 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=308, PETRI_TRANSITIONS=310}
[2025-02-08 05:40:43,625 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, -27 predicate places.
[2025-02-08 05:40:43,626 INFO  L471      AbstractCegarLoop]: Abstraction has has 308 places, 310 transitions, 648 flow
[2025-02-08 05:40:43,627 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:43,627 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:40:43,627 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:40:43,627 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-08 05:40:43,627 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:40:43,628 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:40:43,628 INFO  L85        PathProgramCache]: Analyzing trace with hash -1410622420, now seen corresponding path program 1 times
[2025-02-08 05:40:43,628 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:40:43,629 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484316747]
[2025-02-08 05:40:43,629 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:40:43,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:40:43,645 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-02-08 05:40:43,650 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-02-08 05:40:43,650 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:40:43,651 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:40:43,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:40:43,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:40:43,676 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484316747]
[2025-02-08 05:40:43,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484316747] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:40:43,676 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:40:43,676 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:40:43,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912494705]
[2025-02-08 05:40:43,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:40:43,676 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:40:43,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:40:43,677 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:40:43,677 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:40:43,691 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 333 out of 363
[2025-02-08 05:40:43,693 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 310 transitions, 648 flow. Second operand  has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:43,693 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:40:43,693 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 363
[2025-02-08 05:40:43,693 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:40:43,822 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([807] L64-18-->L64-16: Formula: (= |v_#race~B~0_9| 0)  InVars {}  OutVars{#race~B~0=|v_#race~B~0_9|}  AuxVars[]  AssignedVars[#race~B~0][221], [Black: 383#true, 156#L84-1true, 382#(= |#race~M~0| 0), 389#(= |#race~A~0| 0), 302#L48-15true, 385#(= |#race~B~0| 0), 186#L56-16true, 367#(= |#race~N~0| 0), 331#L64-16true])
[2025-02-08 05:40:43,822 INFO  L294   olderBase$Statistics]: this new event has 198 ancestors and is cut-off event
[2025-02-08 05:40:43,822 INFO  L297   olderBase$Statistics]:   existing Event has 173 ancestors and is cut-off event
[2025-02-08 05:40:43,822 INFO  L297   olderBase$Statistics]:   existing Event has 198 ancestors and is cut-off event
[2025-02-08 05:40:43,822 INFO  L297   olderBase$Statistics]:   existing Event has 173 ancestors and is cut-off event
[2025-02-08 05:40:43,823 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([807] L64-18-->L64-16: Formula: (= |v_#race~B~0_9| 0)  InVars {}  OutVars{#race~B~0=|v_#race~B~0_9|}  AuxVars[]  AssignedVars[#race~B~0][221], [Black: 383#true, 156#L84-1true, 382#(= |#race~M~0| 0), 303#L48-14true, 389#(= |#race~A~0| 0), 385#(= |#race~B~0| 0), 186#L56-16true, 367#(= |#race~N~0| 0), 331#L64-16true])
[2025-02-08 05:40:43,823 INFO  L294   olderBase$Statistics]: this new event has 199 ancestors and is cut-off event
[2025-02-08 05:40:43,823 INFO  L297   olderBase$Statistics]:   existing Event has 199 ancestors and is cut-off event
[2025-02-08 05:40:43,823 INFO  L297   olderBase$Statistics]:   existing Event has 174 ancestors and is cut-off event
[2025-02-08 05:40:43,823 INFO  L297   olderBase$Statistics]:   existing Event has 174 ancestors and is cut-off event
[2025-02-08 05:40:43,827 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([807] L64-18-->L64-16: Formula: (= |v_#race~B~0_9| 0)  InVars {}  OutVars{#race~B~0=|v_#race~B~0_9|}  AuxVars[]  AssignedVars[#race~B~0][221], [Black: 383#true, 382#(= |#race~M~0| 0), 389#(= |#race~A~0| 0), 385#(= |#race~B~0| 0), 166#L86true, 186#L56-16true, 367#(= |#race~N~0| 0), 331#L64-16true])
[2025-02-08 05:40:43,827 INFO  L294   olderBase$Statistics]: this new event has 226 ancestors and is cut-off event
[2025-02-08 05:40:43,827 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2025-02-08 05:40:43,827 INFO  L297   olderBase$Statistics]:   existing Event has 201 ancestors and is cut-off event
[2025-02-08 05:40:43,827 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2025-02-08 05:40:43,827 INFO  L124   PetriNetUnfolderBase]: 190/1657 cut-off events.
[2025-02-08 05:40:43,827 INFO  L125   PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES.
[2025-02-08 05:40:43,833 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1984 conditions, 1657 events. 190/1657 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 11328 event pairs, 38 based on Foata normal form. 0/1476 useless extension candidates. Maximal degree in co-relation 1948. Up to 206 conditions per place. 
[2025-02-08 05:40:43,838 INFO  L140   encePairwiseOnDemand]: 355/363 looper letters, 20 selfloop transitions, 4 changer transitions 0/315 dead transitions.
[2025-02-08 05:40:43,839 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 315 transitions, 711 flow
[2025-02-08 05:40:43,839 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:40:43,839 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:40:43,840 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1027 transitions.
[2025-02-08 05:40:43,841 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9430670339761249
[2025-02-08 05:40:43,841 INFO  L175             Difference]: Start difference. First operand has 308 places, 310 transitions, 648 flow. Second operand 3 states and 1027 transitions.
[2025-02-08 05:40:43,841 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 315 transitions, 711 flow
[2025-02-08 05:40:43,843 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 315 transitions, 711 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-02-08 05:40:43,845 INFO  L231             Difference]: Finished difference. Result has 307 places, 310 transitions, 668 flow
[2025-02-08 05:40:43,845 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=307, PETRI_TRANSITIONS=310}
[2025-02-08 05:40:43,846 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, -28 predicate places.
[2025-02-08 05:40:43,846 INFO  L471      AbstractCegarLoop]: Abstraction has has 307 places, 310 transitions, 668 flow
[2025-02-08 05:40:43,847 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:43,847 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:40:43,847 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:40:43,847 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-08 05:40:43,847 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:40:43,847 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:40:43,847 INFO  L85        PathProgramCache]: Analyzing trace with hash 303110223, now seen corresponding path program 1 times
[2025-02-08 05:40:43,847 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:40:43,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487972333]
[2025-02-08 05:40:43,848 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:40:43,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:40:43,856 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-08 05:40:43,868 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-08 05:40:43,871 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:40:43,871 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:40:43,994 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:40:43,995 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:40:43,995 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487972333]
[2025-02-08 05:40:43,995 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487972333] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:40:43,995 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:40:43,995 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-08 05:40:43,995 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739841500]
[2025-02-08 05:40:43,995 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:40:43,995 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-08 05:40:43,996 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:40:43,996 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-08 05:40:43,996 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-02-08 05:40:44,194 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 322 out of 363
[2025-02-08 05:40:44,197 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 310 transitions, 668 flow. Second operand  has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:44,197 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:40:44,197 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 363
[2025-02-08 05:40:44,197 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:40:44,397 INFO  L124   PetriNetUnfolderBase]: 131/1586 cut-off events.
[2025-02-08 05:40:44,397 INFO  L125   PetriNetUnfolderBase]: For 15/36 co-relation queries the response was YES.
[2025-02-08 05:40:44,403 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1968 conditions, 1586 events. 131/1586 cut-off events. For 15/36 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9672 event pairs, 27 based on Foata normal form. 4/1481 useless extension candidates. Maximal degree in co-relation 1929. Up to 99 conditions per place. 
[2025-02-08 05:40:44,406 INFO  L140   encePairwiseOnDemand]: 342/363 looper letters, 31 selfloop transitions, 28 changer transitions 0/339 dead transitions.
[2025-02-08 05:40:44,406 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 339 transitions, 852 flow
[2025-02-08 05:40:44,407 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-08 05:40:44,407 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2025-02-08 05:40:44,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3280 transitions.
[2025-02-08 05:40:44,411 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9035812672176309
[2025-02-08 05:40:44,411 INFO  L175             Difference]: Start difference. First operand has 307 places, 310 transitions, 668 flow. Second operand 10 states and 3280 transitions.
[2025-02-08 05:40:44,411 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 339 transitions, 852 flow
[2025-02-08 05:40:44,413 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 339 transitions, 852 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-02-08 05:40:44,415 INFO  L231             Difference]: Finished difference. Result has 320 places, 326 transitions, 797 flow
[2025-02-08 05:40:44,416 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=797, PETRI_PLACES=320, PETRI_TRANSITIONS=326}
[2025-02-08 05:40:44,416 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, -15 predicate places.
[2025-02-08 05:40:44,416 INFO  L471      AbstractCegarLoop]: Abstraction has has 320 places, 326 transitions, 797 flow
[2025-02-08 05:40:44,417 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:44,418 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:40:44,418 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:40:44,418 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-08 05:40:44,418 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:40:44,418 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:40:44,418 INFO  L85        PathProgramCache]: Analyzing trace with hash 1571943133, now seen corresponding path program 1 times
[2025-02-08 05:40:44,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:40:44,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615395389]
[2025-02-08 05:40:44,419 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:40:44,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:40:44,426 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes.
[2025-02-08 05:40:44,438 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements.
[2025-02-08 05:40:44,439 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:40:44,439 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:40:44,567 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:40:44,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:40:44,568 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615395389]
[2025-02-08 05:40:44,568 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615395389] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:40:44,568 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:40:44,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 05:40:44,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069789111]
[2025-02-08 05:40:44,568 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:40:44,568 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-08 05:40:44,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:40:44,568 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-08 05:40:44,568 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-08 05:40:44,622 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 333 out of 363
[2025-02-08 05:40:44,624 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 326 transitions, 797 flow. Second operand  has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:44,624 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:40:44,624 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 363
[2025-02-08 05:40:44,624 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:40:44,819 INFO  L124   PetriNetUnfolderBase]: 188/2163 cut-off events.
[2025-02-08 05:40:44,820 INFO  L125   PetriNetUnfolderBase]: For 73/117 co-relation queries the response was YES.
[2025-02-08 05:40:44,828 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 2163 events. 188/2163 cut-off events. For 73/117 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 15616 event pairs, 39 based on Foata normal form. 11/2021 useless extension candidates. Maximal degree in co-relation 2690. Up to 126 conditions per place. 
[2025-02-08 05:40:44,833 INFO  L140   encePairwiseOnDemand]: 357/363 looper letters, 24 selfloop transitions, 5 changer transitions 0/337 dead transitions.
[2025-02-08 05:40:44,833 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 337 transitions, 885 flow
[2025-02-08 05:40:44,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-08 05:40:44,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2025-02-08 05:40:44,835 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1695 transitions.
[2025-02-08 05:40:44,836 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9338842975206612
[2025-02-08 05:40:44,836 INFO  L175             Difference]: Start difference. First operand has 320 places, 326 transitions, 797 flow. Second operand 5 states and 1695 transitions.
[2025-02-08 05:40:44,836 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 337 transitions, 885 flow
[2025-02-08 05:40:44,839 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 337 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-02-08 05:40:44,842 INFO  L231             Difference]: Finished difference. Result has 326 places, 328 transitions, 822 flow
[2025-02-08 05:40:44,842 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=822, PETRI_PLACES=326, PETRI_TRANSITIONS=328}
[2025-02-08 05:40:44,844 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, -9 predicate places.
[2025-02-08 05:40:44,844 INFO  L471      AbstractCegarLoop]: Abstraction has has 326 places, 328 transitions, 822 flow
[2025-02-08 05:40:44,845 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:44,845 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:40:44,845 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:40:44,845 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-08 05:40:44,845 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:40:44,846 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:40:44,846 INFO  L85        PathProgramCache]: Analyzing trace with hash -1884294512, now seen corresponding path program 1 times
[2025-02-08 05:40:44,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:40:44,846 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417197116]
[2025-02-08 05:40:44,846 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:40:44,846 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:40:44,859 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes.
[2025-02-08 05:40:44,866 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements.
[2025-02-08 05:40:44,866 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:40:44,866 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:40:45,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:40:45,206 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:40:45,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417197116]
[2025-02-08 05:40:45,207 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417197116] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:40:45,207 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:40:45,207 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 05:40:45,207 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016614882]
[2025-02-08 05:40:45,207 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:40:45,207 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 05:40:45,207 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:40:45,208 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 05:40:45,208 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-08 05:40:45,510 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 315 out of 363
[2025-02-08 05:40:45,512 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 328 transitions, 822 flow. Second operand  has 6 states, 6 states have (on average 316.6666666666667) internal successors, (1900), 6 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:45,512 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:40:45,512 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 363
[2025-02-08 05:40:45,512 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:40:46,727 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([807] L64-18-->L64-16: Formula: (= |v_#race~B~0_9| 0)  InVars {}  OutVars{#race~B~0=|v_#race~B~0_9|}  AuxVars[]  AssignedVars[#race~B~0][227], [Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), Black: 383#true, Black: 387#true, 385#(= |#race~B~0| 0), 186#L56-16true, 419#true, 331#L64-16true, 382#(= |#race~M~0| 0), 156#L84-1true, 391#true, 389#(= |#race~A~0| 0), Black: 396#(<= ~N~0 0), 412#true, Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 367#(= |#race~N~0| 0), 333#L48-16true])
[2025-02-08 05:40:46,727 INFO  L294   olderBase$Statistics]: this new event has 231 ancestors and is cut-off event
[2025-02-08 05:40:46,727 INFO  L297   olderBase$Statistics]:   existing Event has 206 ancestors and is cut-off event
[2025-02-08 05:40:46,727 INFO  L297   olderBase$Statistics]:   existing Event has 206 ancestors and is cut-off event
[2025-02-08 05:40:46,727 INFO  L297   olderBase$Statistics]:   existing Event has 206 ancestors and is cut-off event
[2025-02-08 05:40:46,885 INFO  L124   PetriNetUnfolderBase]: 2314/10297 cut-off events.
[2025-02-08 05:40:46,885 INFO  L125   PetriNetUnfolderBase]: For 869/902 co-relation queries the response was YES.
[2025-02-08 05:40:46,919 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15276 conditions, 10297 events. 2314/10297 cut-off events. For 869/902 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 110823 event pairs, 1091 based on Foata normal form. 0/9452 useless extension candidates. Maximal degree in co-relation 15227. Up to 2999 conditions per place. 
[2025-02-08 05:40:46,947 INFO  L140   encePairwiseOnDemand]: 348/363 looper letters, 46 selfloop transitions, 38 changer transitions 0/373 dead transitions.
[2025-02-08 05:40:46,947 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 373 transitions, 1088 flow
[2025-02-08 05:40:46,948 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 05:40:46,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-08 05:40:46,951 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1973 transitions.
[2025-02-08 05:40:46,952 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9058769513314968
[2025-02-08 05:40:46,952 INFO  L175             Difference]: Start difference. First operand has 326 places, 328 transitions, 822 flow. Second operand 6 states and 1973 transitions.
[2025-02-08 05:40:46,952 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 373 transitions, 1088 flow
[2025-02-08 05:40:46,962 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 373 transitions, 1083 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-08 05:40:46,966 INFO  L231             Difference]: Finished difference. Result has 334 places, 365 transitions, 1071 flow
[2025-02-08 05:40:46,966 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1071, PETRI_PLACES=334, PETRI_TRANSITIONS=365}
[2025-02-08 05:40:46,968 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, -1 predicate places.
[2025-02-08 05:40:46,968 INFO  L471      AbstractCegarLoop]: Abstraction has has 334 places, 365 transitions, 1071 flow
[2025-02-08 05:40:46,969 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 316.6666666666667) internal successors, (1900), 6 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:46,969 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:40:46,969 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:40:46,969 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-08 05:40:46,970 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:40:46,970 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:40:46,970 INFO  L85        PathProgramCache]: Analyzing trace with hash 573690799, now seen corresponding path program 1 times
[2025-02-08 05:40:46,970 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:40:46,970 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275913775]
[2025-02-08 05:40:46,970 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:40:46,970 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:40:46,982 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes.
[2025-02-08 05:40:46,990 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements.
[2025-02-08 05:40:46,991 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:40:46,991 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:40:47,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:40:47,362 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:40:47,362 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275913775]
[2025-02-08 05:40:47,362 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275913775] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:40:47,362 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:40:47,362 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 05:40:47,362 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091535815]
[2025-02-08 05:40:47,362 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:40:47,363 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 05:40:47,363 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:40:47,363 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 05:40:47,363 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-08 05:40:47,645 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 315 out of 363
[2025-02-08 05:40:47,647 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 365 transitions, 1071 flow. Second operand  has 6 states, 6 states have (on average 316.8333333333333) internal successors, (1901), 6 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:47,648 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:40:47,648 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 363
[2025-02-08 05:40:47,648 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:40:49,805 INFO  L124   PetriNetUnfolderBase]: 3904/14408 cut-off events.
[2025-02-08 05:40:49,805 INFO  L125   PetriNetUnfolderBase]: For 4374/4967 co-relation queries the response was YES.
[2025-02-08 05:40:49,908 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26215 conditions, 14408 events. 3904/14408 cut-off events. For 4374/4967 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 159469 event pairs, 1169 based on Foata normal form. 82/13519 useless extension candidates. Maximal degree in co-relation 26162. Up to 4519 conditions per place. 
[2025-02-08 05:40:49,994 INFO  L140   encePairwiseOnDemand]: 348/363 looper letters, 77 selfloop transitions, 110 changer transitions 0/482 dead transitions.
[2025-02-08 05:40:49,998 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 482 transitions, 2017 flow
[2025-02-08 05:40:49,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 05:40:49,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-08 05:40:50,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1973 transitions.
[2025-02-08 05:40:50,002 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9058769513314968
[2025-02-08 05:40:50,002 INFO  L175             Difference]: Start difference. First operand has 334 places, 365 transitions, 1071 flow. Second operand 6 states and 1973 transitions.
[2025-02-08 05:40:50,002 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 482 transitions, 2017 flow
[2025-02-08 05:40:50,027 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 482 transitions, 2017 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-02-08 05:40:50,030 INFO  L231             Difference]: Finished difference. Result has 344 places, 474 transitions, 2129 flow
[2025-02-08 05:40:50,031 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2129, PETRI_PLACES=344, PETRI_TRANSITIONS=474}
[2025-02-08 05:40:50,032 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, 9 predicate places.
[2025-02-08 05:40:50,032 INFO  L471      AbstractCegarLoop]: Abstraction has has 344 places, 474 transitions, 2129 flow
[2025-02-08 05:40:50,033 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 316.8333333333333) internal successors, (1901), 6 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:50,033 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:40:50,033 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:40:50,033 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-08 05:40:50,033 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:40:50,034 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:40:50,034 INFO  L85        PathProgramCache]: Analyzing trace with hash -436304606, now seen corresponding path program 1 times
[2025-02-08 05:40:50,034 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:40:50,034 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110042090]
[2025-02-08 05:40:50,034 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:40:50,034 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:40:50,044 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-02-08 05:40:50,050 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-02-08 05:40:50,050 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:40:50,050 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:40:50,396 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:40:50,396 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:40:50,396 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110042090]
[2025-02-08 05:40:50,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110042090] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:40:50,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:40:50,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 05:40:50,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301308591]
[2025-02-08 05:40:50,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:40:50,397 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 05:40:50,397 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:40:50,397 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 05:40:50,397 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-08 05:40:50,596 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 297 out of 363
[2025-02-08 05:40:50,598 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 474 transitions, 2129 flow. Second operand  has 6 states, 6 states have (on average 299.5) internal successors, (1797), 6 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:50,598 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:40:50,598 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 363
[2025-02-08 05:40:50,598 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:40:54,465 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([807] L64-18-->L64-16: Formula: (= |v_#race~B~0_9| 0)  InVars {}  OutVars{#race~B~0=|v_#race~B~0_9|}  AuxVars[]  AssignedVars[#race~B~0][224], [Black: 383#true, Black: 387#true, 385#(= |#race~B~0| 0), 186#L56-16true, 419#true, 331#L64-16true, 156#L84-1true, Black: 396#(<= ~N~0 0), Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 430#true, Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 333#L48-16true, Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 382#(= |#race~M~0| 0), Black: 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 391#true, 389#(= |#race~A~0| 0), Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), 441#true])
[2025-02-08 05:40:54,466 INFO  L294   olderBase$Statistics]: this new event has 231 ancestors and is cut-off event
[2025-02-08 05:40:54,466 INFO  L297   olderBase$Statistics]:   existing Event has 206 ancestors and is cut-off event
[2025-02-08 05:40:54,466 INFO  L297   olderBase$Statistics]:   existing Event has 206 ancestors and is cut-off event
[2025-02-08 05:40:54,466 INFO  L297   olderBase$Statistics]:   existing Event has 206 ancestors and is cut-off event
[2025-02-08 05:40:55,542 INFO  L124   PetriNetUnfolderBase]: 12006/34819 cut-off events.
[2025-02-08 05:40:55,542 INFO  L125   PetriNetUnfolderBase]: For 22055/23532 co-relation queries the response was YES.
[2025-02-08 05:40:55,839 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 78125 conditions, 34819 events. 12006/34819 cut-off events. For 22055/23532 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 407548 event pairs, 3837 based on Foata normal form. 190/32621 useless extension candidates. Maximal degree in co-relation 78067. Up to 14980 conditions per place. 
[2025-02-08 05:40:55,974 INFO  L140   encePairwiseOnDemand]: 340/363 looper letters, 226 selfloop transitions, 105 changer transitions 0/604 dead transitions.
[2025-02-08 05:40:55,974 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 604 transitions, 3443 flow
[2025-02-08 05:40:56,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 05:40:56,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-08 05:40:56,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1927 transitions.
[2025-02-08 05:40:56,103 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8847566574839302
[2025-02-08 05:40:56,103 INFO  L175             Difference]: Start difference. First operand has 344 places, 474 transitions, 2129 flow. Second operand 6 states and 1927 transitions.
[2025-02-08 05:40:56,103 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 604 transitions, 3443 flow
[2025-02-08 05:40:56,196 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 604 transitions, 3443 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-02-08 05:40:56,201 INFO  L231             Difference]: Finished difference. Result has 353 places, 572 transitions, 3084 flow
[2025-02-08 05:40:56,202 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3084, PETRI_PLACES=353, PETRI_TRANSITIONS=572}
[2025-02-08 05:40:56,202 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, 18 predicate places.
[2025-02-08 05:40:56,202 INFO  L471      AbstractCegarLoop]: Abstraction has has 353 places, 572 transitions, 3084 flow
[2025-02-08 05:40:56,203 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 299.5) internal successors, (1797), 6 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:56,203 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:40:56,203 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:40:56,203 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-08 05:40:56,203 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:40:56,204 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:40:56,204 INFO  L85        PathProgramCache]: Analyzing trace with hash -1215069109, now seen corresponding path program 1 times
[2025-02-08 05:40:56,204 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:40:56,204 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826106996]
[2025-02-08 05:40:56,204 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:40:56,204 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:40:56,216 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-02-08 05:40:56,221 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-02-08 05:40:56,222 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:40:56,222 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:40:56,431 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:40:56,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:40:56,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826106996]
[2025-02-08 05:40:56,431 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826106996] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:40:56,432 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:40:56,432 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 05:40:56,432 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161648888]
[2025-02-08 05:40:56,432 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:40:56,432 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 05:40:56,432 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:40:56,432 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 05:40:56,433 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-08 05:40:56,628 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 297 out of 363
[2025-02-08 05:40:56,629 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 572 transitions, 3084 flow. Second operand  has 6 states, 6 states have (on average 299.6666666666667) internal successors, (1798), 6 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:40:56,629 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:40:56,629 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 363
[2025-02-08 05:40:56,629 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:41:03,499 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] L48-13-->L48-12: Formula: (= (store |v_#race_20| v_~A~0.base_6 (store (select |v_#race_20| v_~A~0.base_6) (+ (* v_thread1Thread1of1ForFork2_~i~0_11 4) v_~A~0.offset_6) 0)) |v_#race_19|)  InVars {#race=|v_#race_20|, ~A~0.base=v_~A~0.base_6, ~A~0.offset=v_~A~0.offset_6, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11}  OutVars{#race=|v_#race_19|, ~A~0.base=v_~A~0.base_6, ~A~0.offset=v_~A~0.offset_6, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11}  AuxVars[]  AssignedVars[#race][269], [Black: 445#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 443#(= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), 451#true, Black: 383#true, Black: 446#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 387#true, 385#(= |#race~B~0| 0), 419#true, 156#L84-1true, Black: 396#(<= ~N~0 0), Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 382#(= |#race~M~0| 0), 200#L55-4true, 347#L64-6true, Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 391#true, Black: 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 430#true, 389#(= |#race~A~0| 0), 35#L48-12true, Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), 441#true, Black: 444#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))))])
[2025-02-08 05:41:03,500 INFO  L294   olderBase$Statistics]: this new event has 240 ancestors and is cut-off event
[2025-02-08 05:41:03,500 INFO  L297   olderBase$Statistics]:   existing Event has 215 ancestors and is cut-off event
[2025-02-08 05:41:03,500 INFO  L297   olderBase$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2025-02-08 05:41:03,500 INFO  L297   olderBase$Statistics]:   existing Event has 215 ancestors and is cut-off event
[2025-02-08 05:41:04,091 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([815] L64-13-->L64-12: Formula: (= (store |v_#race_60| v_~A~0.base_20 (store (select |v_#race_60| v_~A~0.base_20) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_11) v_~A~0.offset_20) 0)) |v_#race_59|)  InVars {#race=|v_#race_60|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20}  OutVars{#race=|v_#race_59|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20}  AuxVars[]  AssignedVars[#race][223], [Black: 445#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 443#(= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), 451#true, Black: 446#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 383#true, Black: 387#true, 385#(= |#race~B~0| 0), 419#true, 208#L48-3true, 156#L84-1true, Black: 396#(<= ~N~0 0), Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), 14#L64-12true, Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 382#(= |#race~M~0| 0), 200#L55-4true, Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 391#true, Black: 430#true, 389#(= |#race~A~0| 0), Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), 441#true, Black: 444#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))))])
[2025-02-08 05:41:04,091 INFO  L294   olderBase$Statistics]: this new event has 243 ancestors and is cut-off event
[2025-02-08 05:41:04,091 INFO  L297   olderBase$Statistics]:   existing Event has 218 ancestors and is cut-off event
[2025-02-08 05:41:04,091 INFO  L297   olderBase$Statistics]:   existing Event has 243 ancestors and is cut-off event
[2025-02-08 05:41:04,091 INFO  L297   olderBase$Statistics]:   existing Event has 218 ancestors and is cut-off event
[2025-02-08 05:41:04,123 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([815] L64-13-->L64-12: Formula: (= (store |v_#race_60| v_~A~0.base_20 (store (select |v_#race_60| v_~A~0.base_20) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_11) v_~A~0.offset_20) 0)) |v_#race_59|)  InVars {#race=|v_#race_60|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20}  OutVars{#race=|v_#race_59|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20}  AuxVars[]  AssignedVars[#race][223], [Black: 445#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 443#(= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 446#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 451#true, Black: 383#true, Black: 387#true, 385#(= |#race~B~0| 0), 419#true, 156#L84-1true, Black: 396#(<= ~N~0 0), Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), 14#L64-12true, Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 71#L48-1true, Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 200#L55-4true, 382#(= |#race~M~0| 0), Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 391#true, Black: 430#true, 389#(= |#race~A~0| 0), Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), Black: 444#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 441#true])
[2025-02-08 05:41:04,123 INFO  L294   olderBase$Statistics]: this new event has 244 ancestors and is cut-off event
[2025-02-08 05:41:04,123 INFO  L297   olderBase$Statistics]:   existing Event has 219 ancestors and is cut-off event
[2025-02-08 05:41:04,123 INFO  L297   olderBase$Statistics]:   existing Event has 244 ancestors and is cut-off event
[2025-02-08 05:41:04,123 INFO  L297   olderBase$Statistics]:   existing Event has 219 ancestors and is cut-off event
[2025-02-08 05:41:04,208 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([815] L64-13-->L64-12: Formula: (= (store |v_#race_60| v_~A~0.base_20 (store (select |v_#race_60| v_~A~0.base_20) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_11) v_~A~0.offset_20) 0)) |v_#race_59|)  InVars {#race=|v_#race_60|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20}  OutVars{#race=|v_#race_59|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20}  AuxVars[]  AssignedVars[#race][277], [Black: 445#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 443#(= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 446#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 451#true, Black: 383#true, Black: 387#true, 385#(= |#race~B~0| 0), 166#L86true, 419#true, Black: 396#(<= ~N~0 0), Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), 205#L56-2true, 14#L64-12true, Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 382#(= |#race~M~0| 0), 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 391#true, Black: 430#true, 389#(= |#race~A~0| 0), Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), 441#true, Black: 444#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))))])
[2025-02-08 05:41:04,209 INFO  L294   olderBase$Statistics]: this new event has 257 ancestors and is cut-off event
[2025-02-08 05:41:04,209 INFO  L297   olderBase$Statistics]:   existing Event has 232 ancestors and is cut-off event
[2025-02-08 05:41:04,209 INFO  L297   olderBase$Statistics]:   existing Event has 232 ancestors and is cut-off event
[2025-02-08 05:41:04,209 INFO  L297   olderBase$Statistics]:   existing Event has 207 ancestors and is cut-off event
[2025-02-08 05:41:04,211 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([815] L64-13-->L64-12: Formula: (= (store |v_#race_60| v_~A~0.base_20 (store (select |v_#race_60| v_~A~0.base_20) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_11) v_~A~0.offset_20) 0)) |v_#race_59|)  InVars {#race=|v_#race_60|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20}  OutVars{#race=|v_#race_59|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20}  AuxVars[]  AssignedVars[#race][223], [Black: 445#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 443#(= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 446#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 451#true, Black: 383#true, Black: 387#true, 385#(= |#race~B~0| 0), 166#L86true, 419#true, Black: 396#(<= ~N~0 0), Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), 14#L64-12true, Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 382#(= |#race~M~0| 0), 200#L55-4true, Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 391#true, Black: 430#true, 389#(= |#race~A~0| 0), Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), Black: 444#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 441#true])
[2025-02-08 05:41:04,212 INFO  L294   olderBase$Statistics]: this new event has 259 ancestors and is cut-off event
[2025-02-08 05:41:04,212 INFO  L297   olderBase$Statistics]:   existing Event has 209 ancestors and is cut-off event
[2025-02-08 05:41:04,212 INFO  L297   olderBase$Statistics]:   existing Event has 259 ancestors and is cut-off event
[2025-02-08 05:41:04,212 INFO  L297   olderBase$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2025-02-08 05:41:04,213 INFO  L292   olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([815] L64-13-->L64-12: Formula: (= (store |v_#race_60| v_~A~0.base_20 (store (select |v_#race_60| v_~A~0.base_20) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_11) v_~A~0.offset_20) 0)) |v_#race_59|)  InVars {#race=|v_#race_60|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20}  OutVars{#race=|v_#race_59|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20}  AuxVars[]  AssignedVars[#race][277], [Black: 445#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 443#(= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 383#true, Black: 446#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 451#true, Black: 387#true, 385#(= |#race~B~0| 0), 166#L86true, 419#true, Black: 396#(<= ~N~0 0), Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), 205#L56-2true, 14#L64-12true, Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 382#(= |#race~M~0| 0), Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 391#true, 389#(= |#race~A~0| 0), Black: 430#true, Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), Black: 444#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 441#true])
[2025-02-08 05:41:04,217 INFO  L294   olderBase$Statistics]: this new event has 257 ancestors and is cut-off event
[2025-02-08 05:41:04,217 INFO  L297   olderBase$Statistics]:   existing Event has 232 ancestors and is cut-off event
[2025-02-08 05:41:04,217 INFO  L297   olderBase$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2025-02-08 05:41:04,217 INFO  L297   olderBase$Statistics]:   existing Event has 232 ancestors and is cut-off event
[2025-02-08 05:41:04,217 INFO  L297   olderBase$Statistics]:   existing Event has 207 ancestors and is cut-off event
[2025-02-08 05:41:04,218 INFO  L292   olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([815] L64-13-->L64-12: Formula: (= (store |v_#race_60| v_~A~0.base_20 (store (select |v_#race_60| v_~A~0.base_20) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_11) v_~A~0.offset_20) 0)) |v_#race_59|)  InVars {#race=|v_#race_60|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20}  OutVars{#race=|v_#race_59|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20}  AuxVars[]  AssignedVars[#race][223], [Black: 445#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 443#(= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 383#true, Black: 446#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 451#true, Black: 387#true, 385#(= |#race~B~0| 0), 166#L86true, 419#true, Black: 396#(<= ~N~0 0), Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), 14#L64-12true, Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 382#(= |#race~M~0| 0), 200#L55-4true, Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 391#true, 389#(= |#race~A~0| 0), Black: 430#true, Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), Black: 444#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 441#true])
[2025-02-08 05:41:04,219 INFO  L294   olderBase$Statistics]: this new event has 259 ancestors and is cut-off event
[2025-02-08 05:41:04,219 INFO  L297   olderBase$Statistics]:   existing Event has 209 ancestors and is cut-off event
[2025-02-08 05:41:04,219 INFO  L297   olderBase$Statistics]:   existing Event has 259 ancestors and is cut-off event
[2025-02-08 05:41:04,219 INFO  L297   olderBase$Statistics]:   existing Event has 259 ancestors and is cut-off event
[2025-02-08 05:41:04,219 INFO  L297   olderBase$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2025-02-08 05:41:04,221 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] thread2EXIT-->L87: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4))  InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4}  AuxVars[]  AssignedVars[][220], [Black: 445#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 443#(= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), 451#true, Black: 383#true, Black: 446#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 387#true, 385#(= |#race~B~0| 0), 63#L87true, 419#true, 211#L64-15true, Black: 396#(<= ~N~0 0), Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 430#true, Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 382#(= |#race~M~0| 0), Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 391#true, Black: 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 389#(= |#race~A~0| 0), Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), Black: 444#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 441#true])
[2025-02-08 05:41:04,223 INFO  L294   olderBase$Statistics]: this new event has 266 ancestors and is cut-off event
[2025-02-08 05:41:04,223 INFO  L297   olderBase$Statistics]:   existing Event has 266 ancestors and is cut-off event
[2025-02-08 05:41:04,223 INFO  L297   olderBase$Statistics]:   existing Event has 266 ancestors and is cut-off event
[2025-02-08 05:41:04,223 INFO  L297   olderBase$Statistics]:   existing Event has 216 ancestors and is cut-off event
[2025-02-08 05:41:04,223 INFO  L124   PetriNetUnfolderBase]: 18668/52915 cut-off events.
[2025-02-08 05:41:04,223 INFO  L125   PetriNetUnfolderBase]: For 55561/57975 co-relation queries the response was YES.
[2025-02-08 05:41:04,700 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 138260 conditions, 52915 events. 18668/52915 cut-off events. For 55561/57975 co-relation queries the response was YES. Maximal size of possible extension queue 1267. Compared 648444 event pairs, 3875 based on Foata normal form. 152/50252 useless extension candidates. Maximal degree in co-relation 138197. Up to 21678 conditions per place. 
[2025-02-08 05:41:04,912 INFO  L140   encePairwiseOnDemand]: 340/363 looper letters, 326 selfloop transitions, 208 changer transitions 0/817 dead transitions.
[2025-02-08 05:41:04,912 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 817 transitions, 5748 flow
[2025-02-08 05:41:04,913 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 05:41:04,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-08 05:41:04,915 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1927 transitions.
[2025-02-08 05:41:04,916 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8847566574839302
[2025-02-08 05:41:04,916 INFO  L175             Difference]: Start difference. First operand has 353 places, 572 transitions, 3084 flow. Second operand 6 states and 1927 transitions.
[2025-02-08 05:41:04,916 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 817 transitions, 5748 flow
[2025-02-08 05:41:05,456 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 817 transitions, 5636 flow, removed 56 selfloop flow, removed 0 redundant places.
[2025-02-08 05:41:05,477 INFO  L231             Difference]: Finished difference. Result has 362 places, 767 transitions, 5115 flow
[2025-02-08 05:41:05,482 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=3016, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5115, PETRI_PLACES=362, PETRI_TRANSITIONS=767}
[2025-02-08 05:41:05,482 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, 27 predicate places.
[2025-02-08 05:41:05,483 INFO  L471      AbstractCegarLoop]: Abstraction has has 362 places, 767 transitions, 5115 flow
[2025-02-08 05:41:05,483 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 299.6666666666667) internal successors, (1798), 6 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:41:05,483 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:41:05,484 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:41:05,484 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-08 05:41:05,484 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:41:05,485 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:41:05,485 INFO  L85        PathProgramCache]: Analyzing trace with hash -409675805, now seen corresponding path program 1 times
[2025-02-08 05:41:05,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:41:05,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122190636]
[2025-02-08 05:41:05,489 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:41:05,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:41:05,513 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-02-08 05:41:05,531 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-02-08 05:41:05,531 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:41:05,531 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:41:05,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-08 05:41:05,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:41:05,967 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122190636]
[2025-02-08 05:41:05,967 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122190636] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:41:05,967 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:41:05,967 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 05:41:05,967 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443454144]
[2025-02-08 05:41:05,967 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:41:05,967 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 05:41:05,969 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:41:05,969 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 05:41:05,969 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-08 05:41:06,323 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 315 out of 363
[2025-02-08 05:41:06,325 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 767 transitions, 5115 flow. Second operand  has 6 states, 6 states have (on average 317.8333333333333) internal successors, (1907), 6 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:41:06,325 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:41:06,325 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 363
[2025-02-08 05:41:06,325 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:41:07,517 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L56-6-->L56-5: Formula: (= (store |v_#race_30| v_~B~0.base_13 (store (select |v_#race_30| v_~B~0.base_13) (+ v_~B~0.offset_13 (* v_thread2Thread1of1ForFork1_~i~1_25 4)) |v_thread2Thread1of1ForFork1_#t~nondet5_3|)) |v_#race_29|)  InVars {#race=|v_#race_30|, thread2Thread1of1ForFork1_#t~nondet5=|v_thread2Thread1of1ForFork1_#t~nondet5_3|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_25, ~B~0.base=v_~B~0.base_13, ~B~0.offset=v_~B~0.offset_13}  OutVars{#race=|v_#race_29|, thread2Thread1of1ForFork1_#t~nondet5=|v_thread2Thread1of1ForFork1_#t~nondet5_3|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_25, ~B~0.base=v_~B~0.base_13, ~B~0.offset=v_~B~0.offset_13}  AuxVars[]  AssignedVars[#race][273], [Black: 445#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 446#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 451#true, Black: 383#true, 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 387#true, 385#(= |#race~B~0| 0), Black: 455#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), Black: 456#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), 133#L47-1true, Black: 454#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), Black: 453#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|), 419#true, 174#L64-8true, 156#L84-1true, Black: 396#(<= ~N~0 0), 430#true, Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 286#L56-5true, Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), 443#(= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 461#true, Black: 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 382#(= |#race~M~0| 0), Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 389#(= |#race~A~0| 0), Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), Black: 444#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))))])
[2025-02-08 05:41:07,518 INFO  L294   olderBase$Statistics]: this new event has 193 ancestors and is cut-off event
[2025-02-08 05:41:07,518 INFO  L297   olderBase$Statistics]:   existing Event has 168 ancestors and is cut-off event
[2025-02-08 05:41:07,518 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is cut-off event
[2025-02-08 05:41:07,518 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is cut-off event
[2025-02-08 05:41:07,520 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([823] L64-6-->L64-5: Formula: (= (store |v_#race_50| v_~B~0.base_20 (store (select |v_#race_50| v_~B~0.base_20) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_25) v_~B~0.offset_20) |v_thread3Thread1of1ForFork0_#t~nondet8_3|)) |v_#race_49|)  InVars {#race=|v_#race_50|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_20, ~B~0.offset=v_~B~0.offset_20, thread3Thread1of1ForFork0_#t~nondet8=|v_thread3Thread1of1ForFork0_#t~nondet8_3|}  OutVars{#race=|v_#race_49|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_20, ~B~0.offset=v_~B~0.offset_20, thread3Thread1of1ForFork0_#t~nondet8=|v_thread3Thread1of1ForFork0_#t~nondet8_3|}  AuxVars[]  AssignedVars[#race][283], [Black: 445#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 443#(= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 446#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 220#L56-8true, Black: 383#true, 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 387#true, 385#(= |#race~B~0| 0), 243#L64-5true, Black: 455#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), 133#L47-1true, Black: 456#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), Black: 454#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), 419#true, 156#L84-1true, Black: 396#(<= ~N~0 0), 430#true, Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 461#true, Black: 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 382#(= |#race~M~0| 0), Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 389#(= |#race~A~0| 0), Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), Black: 444#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 441#true, 453#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|)])
[2025-02-08 05:41:07,520 INFO  L294   olderBase$Statistics]: this new event has 193 ancestors and is cut-off event
[2025-02-08 05:41:07,520 INFO  L297   olderBase$Statistics]:   existing Event has 168 ancestors and is cut-off event
[2025-02-08 05:41:07,520 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is cut-off event
[2025-02-08 05:41:07,520 INFO  L297   olderBase$Statistics]:   existing Event has 193 ancestors and is cut-off event
[2025-02-08 05:41:07,693 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([823] L64-6-->L64-5: Formula: (= (store |v_#race_50| v_~B~0.base_20 (store (select |v_#race_50| v_~B~0.base_20) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_25) v_~B~0.offset_20) |v_thread3Thread1of1ForFork0_#t~nondet8_3|)) |v_#race_49|)  InVars {#race=|v_#race_50|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_20, ~B~0.offset=v_~B~0.offset_20, thread3Thread1of1ForFork0_#t~nondet8=|v_thread3Thread1of1ForFork0_#t~nondet8_3|}  OutVars{#race=|v_#race_49|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_20, ~B~0.offset=v_~B~0.offset_20, thread3Thread1of1ForFork0_#t~nondet8=|v_thread3Thread1of1ForFork0_#t~nondet8_3|}  AuxVars[]  AssignedVars[#race][240], [Black: 445#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 443#(= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 383#true, Black: 446#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 387#true, 385#(= |#race~B~0| 0), 243#L64-5true, 63#L87true, Black: 455#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), Black: 456#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), Black: 454#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), 419#true, Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 430#true, Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 461#true, 396#(<= ~N~0 0), Black: 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 382#(= |#race~M~0| 0), Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 389#(= |#race~A~0| 0), Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), 453#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|), 441#true, Black: 444#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))))])
[2025-02-08 05:41:07,693 INFO  L294   olderBase$Statistics]: this new event has 196 ancestors and is cut-off event
[2025-02-08 05:41:07,693 INFO  L297   olderBase$Statistics]:   existing Event has 196 ancestors and is cut-off event
[2025-02-08 05:41:07,693 INFO  L297   olderBase$Statistics]:   existing Event has 196 ancestors and is cut-off event
[2025-02-08 05:41:07,693 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2025-02-08 05:41:07,697 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L56-6-->L56-5: Formula: (= (store |v_#race_30| v_~B~0.base_13 (store (select |v_#race_30| v_~B~0.base_13) (+ v_~B~0.offset_13 (* v_thread2Thread1of1ForFork1_~i~1_25 4)) |v_thread2Thread1of1ForFork1_#t~nondet5_3|)) |v_#race_29|)  InVars {#race=|v_#race_30|, thread2Thread1of1ForFork1_#t~nondet5=|v_thread2Thread1of1ForFork1_#t~nondet5_3|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_25, ~B~0.base=v_~B~0.base_13, ~B~0.offset=v_~B~0.offset_13}  OutVars{#race=|v_#race_29|, thread2Thread1of1ForFork1_#t~nondet5=|v_thread2Thread1of1ForFork1_#t~nondet5_3|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_25, ~B~0.base=v_~B~0.base_13, ~B~0.offset=v_~B~0.offset_13}  AuxVars[]  AssignedVars[#race][273], [Black: 445#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 446#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 451#true, Black: 383#true, Black: 387#true, 385#(= |#race~B~0| 0), Black: 455#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), Black: 456#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), 91#L51true, Black: 454#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), Black: 453#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|), 419#true, 174#L64-8true, 156#L84-1true, Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 430#true, Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 286#L56-5true, Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), 443#(= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 461#true, 396#(<= ~N~0 0), Black: 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 382#(= |#race~M~0| 0), Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 389#(= |#race~A~0| 0), Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), Black: 444#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))))])
[2025-02-08 05:41:07,697 INFO  L294   olderBase$Statistics]: this new event has 197 ancestors and is cut-off event
[2025-02-08 05:41:07,697 INFO  L297   olderBase$Statistics]:   existing Event has 197 ancestors and is cut-off event
[2025-02-08 05:41:07,697 INFO  L297   olderBase$Statistics]:   existing Event has 197 ancestors and is cut-off event
[2025-02-08 05:41:07,697 INFO  L297   olderBase$Statistics]:   existing Event has 172 ancestors and is cut-off event
[2025-02-08 05:41:07,699 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([823] L64-6-->L64-5: Formula: (= (store |v_#race_50| v_~B~0.base_20 (store (select |v_#race_50| v_~B~0.base_20) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_25) v_~B~0.offset_20) |v_thread3Thread1of1ForFork0_#t~nondet8_3|)) |v_#race_49|)  InVars {#race=|v_#race_50|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_20, ~B~0.offset=v_~B~0.offset_20, thread3Thread1of1ForFork0_#t~nondet8=|v_thread3Thread1of1ForFork0_#t~nondet8_3|}  OutVars{#race=|v_#race_49|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_20, ~B~0.offset=v_~B~0.offset_20, thread3Thread1of1ForFork0_#t~nondet8=|v_thread3Thread1of1ForFork0_#t~nondet8_3|}  AuxVars[]  AssignedVars[#race][283], [Black: 445#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 443#(= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), 220#L56-8true, Black: 383#true, Black: 446#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 387#true, 385#(= |#race~B~0| 0), 243#L64-5true, Black: 455#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), Black: 456#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), 91#L51true, Black: 454#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), 419#true, 156#L84-1true, Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 430#true, Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 461#true, 396#(<= ~N~0 0), Black: 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 382#(= |#race~M~0| 0), Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 389#(= |#race~A~0| 0), Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), 453#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|), Black: 444#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 441#true])
[2025-02-08 05:41:07,700 INFO  L294   olderBase$Statistics]: this new event has 197 ancestors and is cut-off event
[2025-02-08 05:41:07,700 INFO  L297   olderBase$Statistics]:   existing Event has 197 ancestors and is cut-off event
[2025-02-08 05:41:07,700 INFO  L297   olderBase$Statistics]:   existing Event has 197 ancestors and is cut-off event
[2025-02-08 05:41:07,700 INFO  L297   olderBase$Statistics]:   existing Event has 172 ancestors and is cut-off event
[2025-02-08 05:41:08,011 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L56-6-->L56-5: Formula: (= (store |v_#race_30| v_~B~0.base_13 (store (select |v_#race_30| v_~B~0.base_13) (+ v_~B~0.offset_13 (* v_thread2Thread1of1ForFork1_~i~1_25 4)) |v_thread2Thread1of1ForFork1_#t~nondet5_3|)) |v_#race_29|)  InVars {#race=|v_#race_30|, thread2Thread1of1ForFork1_#t~nondet5=|v_thread2Thread1of1ForFork1_#t~nondet5_3|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_25, ~B~0.base=v_~B~0.base_13, ~B~0.offset=v_~B~0.offset_13}  OutVars{#race=|v_#race_29|, thread2Thread1of1ForFork1_#t~nondet5=|v_thread2Thread1of1ForFork1_#t~nondet5_3|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_25, ~B~0.base=v_~B~0.base_13, ~B~0.offset=v_~B~0.offset_13}  AuxVars[]  AssignedVars[#race][273], [Black: 445#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 446#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 383#true, 451#true, Black: 387#true, 385#(= |#race~B~0| 0), Black: 455#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), 166#L86true, Black: 456#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), Black: 454#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), Black: 453#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|), 419#true, 174#L64-8true, Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 430#true, Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 286#L56-5true, 443#(= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 461#true, 396#(<= ~N~0 0), Black: 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 382#(= |#race~M~0| 0), Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 389#(= |#race~A~0| 0), Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), Black: 444#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))))])
[2025-02-08 05:41:08,012 INFO  L294   olderBase$Statistics]: this new event has 202 ancestors and is cut-off event
[2025-02-08 05:41:08,012 INFO  L297   olderBase$Statistics]:   existing Event has 202 ancestors and is cut-off event
[2025-02-08 05:41:08,012 INFO  L297   olderBase$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2025-02-08 05:41:08,012 INFO  L297   olderBase$Statistics]:   existing Event has 202 ancestors and is cut-off event
[2025-02-08 05:41:08,015 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([823] L64-6-->L64-5: Formula: (= (store |v_#race_50| v_~B~0.base_20 (store (select |v_#race_50| v_~B~0.base_20) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_25) v_~B~0.offset_20) |v_thread3Thread1of1ForFork0_#t~nondet8_3|)) |v_#race_49|)  InVars {#race=|v_#race_50|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_20, ~B~0.offset=v_~B~0.offset_20, thread3Thread1of1ForFork0_#t~nondet8=|v_thread3Thread1of1ForFork0_#t~nondet8_3|}  OutVars{#race=|v_#race_49|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~B~0.base=v_~B~0.base_20, ~B~0.offset=v_~B~0.offset_20, thread3Thread1of1ForFork0_#t~nondet8=|v_thread3Thread1of1ForFork0_#t~nondet8_3|}  AuxVars[]  AssignedVars[#race][283], [Black: 445#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 443#(= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 446#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 220#L56-8true, Black: 383#true, Black: 387#true, 385#(= |#race~B~0| 0), 243#L64-5true, Black: 455#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), 166#L86true, Black: 456#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), Black: 454#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) |thread3Thread1of1ForFork0_#t~nondet8|)), 419#true, Black: 397#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 430#true, Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 416#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 415#(<= (+ ~M~0 1) 0), Black: 424#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 421#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 423#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 422#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 461#true, 396#(<= ~N~0 0), Black: 435#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 382#(= |#race~M~0| 0), Black: 433#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 432#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 389#(= |#race~A~0| 0), Black: 434#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 367#(= |#race~N~0| 0), 453#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) |thread3Thread1of1ForFork0_#t~nondet8|), Black: 444#(and (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet5| (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), 441#true])
[2025-02-08 05:41:08,015 INFO  L294   olderBase$Statistics]: this new event has 202 ancestors and is cut-off event
[2025-02-08 05:41:08,015 INFO  L297   olderBase$Statistics]:   existing Event has 202 ancestors and is cut-off event
[2025-02-08 05:41:08,015 INFO  L297   olderBase$Statistics]:   existing Event has 202 ancestors and is cut-off event
[2025-02-08 05:41:08,015 INFO  L297   olderBase$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2025-02-08 05:41:14,650 INFO  L124   PetriNetUnfolderBase]: 18656/56273 cut-off events.
[2025-02-08 05:41:14,650 INFO  L125   PetriNetUnfolderBase]: For 134648/146358 co-relation queries the response was YES.
[2025-02-08 05:41:15,219 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172093 conditions, 56273 events. 18656/56273 cut-off events. For 134648/146358 co-relation queries the response was YES. Maximal size of possible extension queue 1386. Compared 699741 event pairs, 2841 based on Foata normal form. 958/54559 useless extension candidates. Maximal degree in co-relation 172025. Up to 19002 conditions per place. 
[2025-02-08 05:41:15,421 INFO  L140   encePairwiseOnDemand]: 348/363 looper letters, 399 selfloop transitions, 376 changer transitions 0/1126 dead transitions.
[2025-02-08 05:41:15,421 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 1126 transitions, 10027 flow
[2025-02-08 05:41:15,422 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 05:41:15,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-08 05:41:15,424 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1973 transitions.
[2025-02-08 05:41:15,424 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9058769513314968
[2025-02-08 05:41:15,424 INFO  L175             Difference]: Start difference. First operand has 362 places, 767 transitions, 5115 flow. Second operand 6 states and 1973 transitions.
[2025-02-08 05:41:15,424 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 1126 transitions, 10027 flow
[2025-02-08 05:41:16,064 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 1126 transitions, 9867 flow, removed 80 selfloop flow, removed 0 redundant places.
[2025-02-08 05:41:16,073 INFO  L231             Difference]: Finished difference. Result has 372 places, 1118 transitions, 10141 flow
[2025-02-08 05:41:16,074 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=5019, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=767, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10141, PETRI_PLACES=372, PETRI_TRANSITIONS=1118}
[2025-02-08 05:41:16,074 INFO  L279   CegarLoopForPetriNet]: 335 programPoint places, 37 predicate places.
[2025-02-08 05:41:16,074 INFO  L471      AbstractCegarLoop]: Abstraction has has 372 places, 1118 transitions, 10141 flow
[2025-02-08 05:41:16,075 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 317.8333333333333) internal successors, (1907), 6 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:41:16,075 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:41:16,075 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:41:16,075 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-08 05:41:16,075 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:41:16,075 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:41:16,075 INFO  L85        PathProgramCache]: Analyzing trace with hash -633674198, now seen corresponding path program 1 times
[2025-02-08 05:41:16,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:41:16,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350294731]
[2025-02-08 05:41:16,075 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:41:16,076 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:41:16,089 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes.
[2025-02-08 05:41:16,095 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements.
[2025-02-08 05:41:16,095 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:41:16,096 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:41:16,539 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-08 05:41:16,539 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:41:16,539 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350294731]
[2025-02-08 05:41:16,539 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350294731] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:41:16,539 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:41:16,539 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-08 05:41:16,539 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829790586]
[2025-02-08 05:41:16,540 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:41:16,540 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-08 05:41:16,540 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:41:16,540 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-08 05:41:16,541 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-08 05:41:16,765 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 297 out of 363
[2025-02-08 05:41:16,766 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 1118 transitions, 10141 flow. Second operand  has 6 states, 6 states have (on average 300.6666666666667) internal successors, (1804), 6 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:41:16,766 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:41:16,766 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 363
[2025-02-08 05:41:16,767 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand