./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c --full-output --architecture 32bit


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


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

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c69d99d457f457373aeec8cf091a3652593de03a43f690cddfeb4bfa1e12a5f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-17 11:13:33,546 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-17 11:13:33,592 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2025-03-17 11:13:33,597 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-17 11:13:33,597 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-17 11:13:33,613 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-17 11:13:33,613 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-17 11:13:33,613 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-17 11:13:33,614 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-17 11:13:33,614 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-17 11:13:33,614 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-17 11:13:33,614 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-17 11:13:33,614 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-17 11:13:33,614 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-17 11:13:33,614 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-17 11:13:33,614 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-17 11:13:33,614 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-17 11:13:33,614 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-17 11:13:33,614 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-17 11:13:33,614 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-17 11:13:33,614 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-17 11:13:33,614 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-17 11:13:33,614 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-17 11:13:33,615 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-17 11:13:33,615 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-17 11:13:33,615 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-17 11:13:33,616 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-17 11:13:33,616 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/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 -> 9c69d99d457f457373aeec8cf091a3652593de03a43f690cddfeb4bfa1e12a5f
[2025-03-17 11:13:33,847 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-17 11:13:33,854 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-17 11:13:33,855 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-17 11:13:33,856 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-17 11:13:33,856 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-17 11:13:33,859 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c
[2025-03-17 11:13:35,009 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834df52c4/d931533c500f48ceba82e85f21ca765c/FLAG5533ebe56
[2025-03-17 11:13:35,241 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-17 11:13:35,241 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c
[2025-03-17 11:13:35,253 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834df52c4/d931533c500f48ceba82e85f21ca765c/FLAG5533ebe56
[2025-03-17 11:13:35,580 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834df52c4/d931533c500f48ceba82e85f21ca765c
[2025-03-17 11:13:35,582 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-17 11:13:35,584 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-17 11:13:35,585 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-17 11:13:35,585 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-17 11:13:35,588 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-17 11:13:35,589 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:35" (1/1) ...
[2025-03-17 11:13:35,591 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5869e829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:35, skipping insertion in model container
[2025-03-17 11:13:35,591 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:35" (1/1) ...
[2025-03-17 11:13:35,606 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-17 11:13:35,748 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-17 11:13:35,760 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-17 11:13:35,783 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-17 11:13:35,800 INFO  L204         MainTranslator]: Completed translation
[2025-03-17 11:13:35,802 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:35 WrapperNode
[2025-03-17 11:13:35,802 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-17 11:13:35,803 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-17 11:13:35,803 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-17 11:13:35,804 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-17 11:13:35,810 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:35" (1/1) ...
[2025-03-17 11:13:35,815 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:35" (1/1) ...
[2025-03-17 11:13:35,838 INFO  L138                Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 256
[2025-03-17 11:13:35,841 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-17 11:13:35,842 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-17 11:13:35,842 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-17 11:13:35,842 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-17 11:13:35,847 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:35" (1/1) ...
[2025-03-17 11:13:35,847 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:35" (1/1) ...
[2025-03-17 11:13:35,850 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:35" (1/1) ...
[2025-03-17 11:13:35,854 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:35" (1/1) ...
[2025-03-17 11:13:35,859 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:35" (1/1) ...
[2025-03-17 11:13:35,863 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:35" (1/1) ...
[2025-03-17 11:13:35,865 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:35" (1/1) ...
[2025-03-17 11:13:35,869 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:35" (1/1) ...
[2025-03-17 11:13:35,871 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-17 11:13:35,872 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-17 11:13:35,872 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-17 11:13:35,872 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-17 11:13:35,872 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:35" (1/1) ...
[2025-03-17 11:13:35,880 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-17 11:13:35,890 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-17 11:13:35,905 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-17 11:13:35,913 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-17 11:13:35,930 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-17 11:13:35,930 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2025-03-17 11:13:35,930 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2025-03-17 11:13:35,931 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2025-03-17 11:13:35,931 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2025-03-17 11:13:35,931 INFO  L130     BoogieDeclarations]: Found specification of procedure thread3
[2025-03-17 11:13:35,931 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread3
[2025-03-17 11:13:35,931 INFO  L130     BoogieDeclarations]: Found specification of procedure thread4
[2025-03-17 11:13:35,931 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread4
[2025-03-17 11:13:35,931 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-03-17 11:13:35,931 INFO  L130     BoogieDeclarations]: Found specification of procedure thread5
[2025-03-17 11:13:35,931 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread5
[2025-03-17 11:13:35,931 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-17 11:13:35,931 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-17 11:13:35,932 WARN  L225             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-03-17 11:13:36,034 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-17 11:13:36,036 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-17 11:13:36,349 INFO  L303             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-03-17 11:13:36,349 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-17 11:13:36,374 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-17 11:13:36,374 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-17 11:13:36,375 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:36 BoogieIcfgContainer
[2025-03-17 11:13:36,375 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-17 11:13:36,376 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-17 11:13:36,376 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-17 11:13:36,380 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-17 11:13:36,380 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:13:35" (1/3) ...
[2025-03-17 11:13:36,380 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8339cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:36, skipping insertion in model container
[2025-03-17 11:13:36,380 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:35" (2/3) ...
[2025-03-17 11:13:36,381 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8339cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:36, skipping insertion in model container
[2025-03-17 11:13:36,381 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:36" (3/3) ...
[2025-03-17 11:13:36,382 INFO  L128   eAbstractionObserver]: Analyzing ICFG parallel-ticket-5.wvr.c
[2025-03-17 11:13:36,392 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-17 11:13:36,394 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-5.wvr.c that has 6 procedures, 271 locations, 1 initial locations, 0 loop locations, and 15 error locations.
[2025-03-17 11:13:36,394 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-03-17 11:13:36,480 INFO  L143    ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions.
[2025-03-17 11:13:36,517 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 286 places, 281 transitions, 597 flow
[2025-03-17 11:13:36,606 INFO  L124   PetriNetUnfolderBase]: 11/276 cut-off events.
[2025-03-17 11:13:36,608 INFO  L125   PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES.
[2025-03-17 11:13:36,617 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 297 conditions, 276 events. 11/276 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 490 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 233. Up to 2 conditions per place. 
[2025-03-17 11:13:36,617 INFO  L82        GeneralOperation]: Start removeDead. Operand has 286 places, 281 transitions, 597 flow
[2025-03-17 11:13:36,623 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 265 places, 259 transitions, 545 flow
[2025-03-17 11:13:36,628 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-17 11:13:36,636 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;@735643da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-17 11:13:36,636 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 30 error locations.
[2025-03-17 11:13:36,643 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-03-17 11:13:36,644 INFO  L124   PetriNetUnfolderBase]: 0/28 cut-off events.
[2025-03-17 11:13:36,644 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-17 11:13:36,644 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-17 11:13:36,644 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]
[2025-03-17 11:13:36,645 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-17 11:13:36,658 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 11:13:36,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -1738636137, now seen corresponding path program 1 times
[2025-03-17 11:13:36,664 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 11:13:36,664 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537543369]
[2025-03-17 11:13:36,664 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 11:13:36,665 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 11:13:36,716 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-03-17 11:13:36,726 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-03-17 11:13:36,726 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 11:13:36,726 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 11:13:36,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-17 11:13:36,783 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 11:13:36,783 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537543369]
[2025-03-17 11:13:36,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537543369] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 11:13:36,783 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 11:13:36,783 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-17 11:13:36,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940602424]
[2025-03-17 11:13:36,785 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 11:13:36,789 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 11:13:36,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 11:13:36,815 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 11:13:36,816 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 11:13:36,846 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281
[2025-03-17 11:13:36,849 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 259 transitions, 545 flow. Second operand  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-17 11:13:36,849 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-17 11:13:36,849 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281
[2025-03-17 11:13:36,853 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-17 11:13:39,740 INFO  L124   PetriNetUnfolderBase]: 8140/22951 cut-off events.
[2025-03-17 11:13:39,741 INFO  L125   PetriNetUnfolderBase]: For 1237/1237 co-relation queries the response was YES.
[2025-03-17 11:13:39,816 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34557 conditions, 22951 events. 8140/22951 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 262123 event pairs, 5691 based on Foata normal form. 1950/21770 useless extension candidates. Maximal degree in co-relation 33945. Up to 10336 conditions per place. 
[2025-03-17 11:13:39,947 INFO  L140   encePairwiseOnDemand]: 272/281 looper letters, 34 selfloop transitions, 2 changer transitions 1/252 dead transitions.
[2025-03-17 11:13:39,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 252 transitions, 603 flow
[2025-03-17 11:13:39,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 11:13:39,951 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-17 11:13:39,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 745 transitions.
[2025-03-17 11:13:39,962 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8837485172004745
[2025-03-17 11:13:39,965 INFO  L175             Difference]: Start difference. First operand has 265 places, 259 transitions, 545 flow. Second operand 3 states and 745 transitions.
[2025-03-17 11:13:39,966 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 252 transitions, 603 flow
[2025-03-17 11:13:39,978 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 252 transitions, 586 flow, removed 0 selfloop flow, removed 9 redundant places.
[2025-03-17 11:13:39,982 INFO  L231             Difference]: Finished difference. Result has 257 places, 251 transitions, 516 flow
[2025-03-17 11:13:39,984 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=257, PETRI_TRANSITIONS=251}
[2025-03-17 11:13:39,987 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -8 predicate places.
[2025-03-17 11:13:39,988 INFO  L471      AbstractCegarLoop]: Abstraction has has 257 places, 251 transitions, 516 flow
[2025-03-17 11:13:39,988 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-17 11:13:39,988 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-17 11:13:39,988 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]
[2025-03-17 11:13:39,989 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-17 11:13:39,989 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-17 11:13:39,989 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 11:13:39,989 INFO  L85        PathProgramCache]: Analyzing trace with hash 2130051975, now seen corresponding path program 1 times
[2025-03-17 11:13:39,989 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 11:13:39,989 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473853779]
[2025-03-17 11:13:39,989 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 11:13:39,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 11:13:40,002 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-03-17 11:13:40,009 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-03-17 11:13:40,012 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 11:13:40,012 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 11:13:40,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-17 11:13:40,052 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 11:13:40,052 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473853779]
[2025-03-17 11:13:40,052 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473853779] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 11:13:40,052 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 11:13:40,052 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-17 11:13:40,052 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863059321]
[2025-03-17 11:13:40,052 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 11:13:40,053 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 11:13:40,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 11:13:40,053 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 11:13:40,053 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 11:13:40,076 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281
[2025-03-17 11:13:40,077 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 251 transitions, 516 flow. Second operand  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-17 11:13:40,077 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-17 11:13:40,077 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281
[2025-03-17 11:13:40,077 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-17 11:13:42,399 INFO  L124   PetriNetUnfolderBase]: 9181/24265 cut-off events.
[2025-03-17 11:13:42,399 INFO  L125   PetriNetUnfolderBase]: For 358/358 co-relation queries the response was YES.
[2025-03-17 11:13:42,459 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36917 conditions, 24265 events. 9181/24265 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 270295 event pairs, 6649 based on Foata normal form. 0/21006 useless extension candidates. Maximal degree in co-relation 36881. Up to 11675 conditions per place. 
[2025-03-17 11:13:42,548 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/250 dead transitions.
[2025-03-17 11:13:42,548 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 250 transitions, 586 flow
[2025-03-17 11:13:42,549 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 11:13:42,549 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-17 11:13:42,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions.
[2025-03-17 11:13:42,551 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8766310794780545
[2025-03-17 11:13:42,551 INFO  L175             Difference]: Start difference. First operand has 257 places, 251 transitions, 516 flow. Second operand 3 states and 739 transitions.
[2025-03-17 11:13:42,551 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 250 transitions, 586 flow
[2025-03-17 11:13:42,552 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 250 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-17 11:13:42,554 INFO  L231             Difference]: Finished difference. Result has 255 places, 250 transitions, 514 flow
[2025-03-17 11:13:42,554 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=255, PETRI_TRANSITIONS=250}
[2025-03-17 11:13:42,555 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -10 predicate places.
[2025-03-17 11:13:42,555 INFO  L471      AbstractCegarLoop]: Abstraction has has 255 places, 250 transitions, 514 flow
[2025-03-17 11:13:42,555 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-17 11:13:42,555 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-17 11:13:42,555 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]
[2025-03-17 11:13:42,556 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-17 11:13:42,556 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-17 11:13:42,560 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 11:13:42,560 INFO  L85        PathProgramCache]: Analyzing trace with hash 1997808468, now seen corresponding path program 1 times
[2025-03-17 11:13:42,560 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 11:13:42,560 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865873430]
[2025-03-17 11:13:42,560 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 11:13:42,560 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 11:13:42,566 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-03-17 11:13:42,570 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-03-17 11:13:42,574 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 11:13:42,575 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 11:13:42,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-17 11:13:42,604 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 11:13:42,604 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865873430]
[2025-03-17 11:13:42,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865873430] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 11:13:42,605 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 11:13:42,605 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-17 11:13:42,606 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914961180]
[2025-03-17 11:13:42,606 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 11:13:42,606 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 11:13:42,606 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 11:13:42,607 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 11:13:42,607 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 11:13:42,621 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281
[2025-03-17 11:13:42,622 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 250 transitions, 514 flow. Second operand  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-17 11:13:42,622 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-17 11:13:42,622 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281
[2025-03-17 11:13:42,622 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-17 11:13:44,706 INFO  L124   PetriNetUnfolderBase]: 9267/24292 cut-off events.
[2025-03-17 11:13:44,706 INFO  L125   PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES.
[2025-03-17 11:13:44,769 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37061 conditions, 24292 events. 9267/24292 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 270744 event pairs, 6740 based on Foata normal form. 0/20931 useless extension candidates. Maximal degree in co-relation 37017. Up to 11781 conditions per place. 
[2025-03-17 11:13:44,863 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/249 dead transitions.
[2025-03-17 11:13:44,863 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 249 transitions, 584 flow
[2025-03-17 11:13:44,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 11:13:44,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-17 11:13:44,865 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions.
[2025-03-17 11:13:44,865 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8766310794780545
[2025-03-17 11:13:44,865 INFO  L175             Difference]: Start difference. First operand has 255 places, 250 transitions, 514 flow. Second operand 3 states and 739 transitions.
[2025-03-17 11:13:44,865 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 249 transitions, 584 flow
[2025-03-17 11:13:44,866 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 249 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-17 11:13:44,868 INFO  L231             Difference]: Finished difference. Result has 254 places, 249 transitions, 512 flow
[2025-03-17 11:13:44,869 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=254, PETRI_TRANSITIONS=249}
[2025-03-17 11:13:44,870 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -11 predicate places.
[2025-03-17 11:13:44,870 INFO  L471      AbstractCegarLoop]: Abstraction has has 254 places, 249 transitions, 512 flow
[2025-03-17 11:13:44,870 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-17 11:13:44,870 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-17 11:13:44,871 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]
[2025-03-17 11:13:44,871 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-17 11:13:44,871 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-17 11:13:44,871 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 11:13:44,871 INFO  L85        PathProgramCache]: Analyzing trace with hash 1541127045, now seen corresponding path program 1 times
[2025-03-17 11:13:44,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 11:13:44,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174995968]
[2025-03-17 11:13:44,872 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 11:13:44,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 11:13:44,879 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-03-17 11:13:44,890 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-03-17 11:13:44,890 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 11:13:44,890 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 11:13:44,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-17 11:13:44,925 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 11:13:44,925 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174995968]
[2025-03-17 11:13:44,925 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174995968] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 11:13:44,925 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 11:13:44,925 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-17 11:13:44,925 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006352159]
[2025-03-17 11:13:44,925 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 11:13:44,925 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 11:13:44,926 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 11:13:44,926 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 11:13:44,926 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 11:13:44,941 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281
[2025-03-17 11:13:44,942 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 249 transitions, 512 flow. Second operand  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-17 11:13:44,942 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-17 11:13:44,942 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281
[2025-03-17 11:13:44,942 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-17 11:13:47,183 INFO  L124   PetriNetUnfolderBase]: 9706/21096 cut-off events.
[2025-03-17 11:13:47,183 INFO  L125   PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES.
[2025-03-17 11:13:47,236 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34356 conditions, 21096 events. 9706/21096 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 205825 event pairs, 7189 based on Foata normal form. 0/18384 useless extension candidates. Maximal degree in co-relation 34304. Up to 12334 conditions per place. 
[2025-03-17 11:13:47,323 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/248 dead transitions.
[2025-03-17 11:13:47,323 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 248 transitions, 582 flow
[2025-03-17 11:13:47,324 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 11:13:47,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-17 11:13:47,325 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions.
[2025-03-17 11:13:47,325 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8766310794780545
[2025-03-17 11:13:47,325 INFO  L175             Difference]: Start difference. First operand has 254 places, 249 transitions, 512 flow. Second operand 3 states and 739 transitions.
[2025-03-17 11:13:47,325 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 248 transitions, 582 flow
[2025-03-17 11:13:47,327 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 248 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-17 11:13:47,328 INFO  L231             Difference]: Finished difference. Result has 253 places, 248 transitions, 510 flow
[2025-03-17 11:13:47,329 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=253, PETRI_TRANSITIONS=248}
[2025-03-17 11:13:47,329 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -12 predicate places.
[2025-03-17 11:13:47,330 INFO  L471      AbstractCegarLoop]: Abstraction has has 253 places, 248 transitions, 510 flow
[2025-03-17 11:13:47,330 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-17 11:13:47,330 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-17 11:13:47,330 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]
[2025-03-17 11:13:47,330 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-17 11:13:47,331 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-17 11:13:47,331 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 11:13:47,331 INFO  L85        PathProgramCache]: Analyzing trace with hash 63339555, now seen corresponding path program 1 times
[2025-03-17 11:13:47,331 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 11:13:47,331 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44159611]
[2025-03-17 11:13:47,331 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 11:13:47,331 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 11:13:47,337 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes.
[2025-03-17 11:13:47,340 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements.
[2025-03-17 11:13:47,341 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 11:13:47,341 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 11:13:47,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-17 11:13:47,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 11:13:47,385 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44159611]
[2025-03-17 11:13:47,385 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44159611] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 11:13:47,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 11:13:47,385 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-17 11:13:47,385 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816388537]
[2025-03-17 11:13:47,385 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 11:13:47,385 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 11:13:47,385 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 11:13:47,386 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 11:13:47,386 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 11:13:47,399 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281
[2025-03-17 11:13:47,400 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 248 transitions, 510 flow. Second operand  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-17 11:13:47,400 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-17 11:13:47,400 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281
[2025-03-17 11:13:47,400 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-17 11:13:49,333 INFO  L124   PetriNetUnfolderBase]: 8685/22770 cut-off events.
[2025-03-17 11:13:49,333 INFO  L125   PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES.
[2025-03-17 11:13:49,394 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34475 conditions, 22770 events. 8685/22770 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 248313 event pairs, 6215 based on Foata normal form. 0/19671 useless extension candidates. Maximal degree in co-relation 34415. Up to 11049 conditions per place. 
[2025-03-17 11:13:49,479 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 2 changer transitions 0/247 dead transitions.
[2025-03-17 11:13:49,479 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 247 transitions, 580 flow
[2025-03-17 11:13:49,480 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 11:13:49,480 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-17 11:13:49,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions.
[2025-03-17 11:13:49,481 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8766310794780545
[2025-03-17 11:13:49,481 INFO  L175             Difference]: Start difference. First operand has 253 places, 248 transitions, 510 flow. Second operand 3 states and 739 transitions.
[2025-03-17 11:13:49,481 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 247 transitions, 580 flow
[2025-03-17 11:13:49,482 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 247 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-17 11:13:49,484 INFO  L231             Difference]: Finished difference. Result has 252 places, 247 transitions, 508 flow
[2025-03-17 11:13:49,485 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=252, PETRI_TRANSITIONS=247}
[2025-03-17 11:13:49,485 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -13 predicate places.
[2025-03-17 11:13:49,485 INFO  L471      AbstractCegarLoop]: Abstraction has has 252 places, 247 transitions, 508 flow
[2025-03-17 11:13:49,486 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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-03-17 11:13:49,486 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-17 11:13:49,486 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]
[2025-03-17 11:13:49,486 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-17 11:13:49,486 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-17 11:13:49,487 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 11:13:49,487 INFO  L85        PathProgramCache]: Analyzing trace with hash 654571398, now seen corresponding path program 1 times
[2025-03-17 11:13:49,487 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 11:13:49,487 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531405359]
[2025-03-17 11:13:49,487 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 11:13:49,487 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 11:13:49,499 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes.
[2025-03-17 11:13:49,513 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements.
[2025-03-17 11:13:49,513 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 11:13:49,514 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 11:13:49,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-17 11:13:49,564 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 11:13:49,564 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531405359]
[2025-03-17 11:13:49,564 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531405359] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 11:13:49,564 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 11:13:49,564 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-17 11:13:49,564 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686739645]
[2025-03-17 11:13:49,564 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 11:13:49,564 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 11:13:49,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 11:13:49,565 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 11:13:49,565 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 11:13:49,578 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281
[2025-03-17 11:13:49,579 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 247 transitions, 508 flow. Second operand  has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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-03-17 11:13:49,579 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-17 11:13:49,579 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281
[2025-03-17 11:13:49,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-17 11:13:52,442 INFO  L124   PetriNetUnfolderBase]: 11755/30292 cut-off events.
[2025-03-17 11:13:52,442 INFO  L125   PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES.
[2025-03-17 11:13:52,524 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46458 conditions, 30292 events. 11755/30292 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 1216. Compared 345963 event pairs, 6460 based on Foata normal form. 0/26240 useless extension candidates. Maximal degree in co-relation 46390. Up to 11588 conditions per place. 
[2025-03-17 11:13:52,641 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 49 selfloop transitions, 2 changer transitions 0/262 dead transitions.
[2025-03-17 11:13:52,641 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 262 transitions, 645 flow
[2025-03-17 11:13:52,642 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 11:13:52,642 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-17 11:13:52,643 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions.
[2025-03-17 11:13:52,643 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9015421115065243
[2025-03-17 11:13:52,643 INFO  L175             Difference]: Start difference. First operand has 252 places, 247 transitions, 508 flow. Second operand 3 states and 760 transitions.
[2025-03-17 11:13:52,643 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 262 transitions, 645 flow
[2025-03-17 11:13:52,644 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 262 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-17 11:13:52,646 INFO  L231             Difference]: Finished difference. Result has 251 places, 246 transitions, 506 flow
[2025-03-17 11:13:52,647 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=251, PETRI_TRANSITIONS=246}
[2025-03-17 11:13:52,647 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -14 predicate places.
[2025-03-17 11:13:52,648 INFO  L471      AbstractCegarLoop]: Abstraction has has 251 places, 246 transitions, 506 flow
[2025-03-17 11:13:52,648 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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-03-17 11:13:52,648 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-17 11:13:52,648 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]
[2025-03-17 11:13:52,648 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-17 11:13:52,648 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-17 11:13:52,649 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 11:13:52,649 INFO  L85        PathProgramCache]: Analyzing trace with hash -1901759544, now seen corresponding path program 1 times
[2025-03-17 11:13:52,649 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 11:13:52,649 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297372431]
[2025-03-17 11:13:52,649 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 11:13:52,649 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 11:13:52,660 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes.
[2025-03-17 11:13:52,666 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements.
[2025-03-17 11:13:52,666 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 11:13:52,666 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 11:13:52,715 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-17 11:13:52,715 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 11:13:52,715 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297372431]
[2025-03-17 11:13:52,715 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297372431] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 11:13:52,715 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 11:13:52,715 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-17 11:13:52,715 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718131266]
[2025-03-17 11:13:52,715 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 11:13:52,716 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 11:13:52,716 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 11:13:52,716 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 11:13:52,716 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 11:13:52,725 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281
[2025-03-17 11:13:52,726 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 246 transitions, 506 flow. Second operand  has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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-03-17 11:13:52,726 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-17 11:13:52,726 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281
[2025-03-17 11:13:52,726 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-17 11:13:54,563 INFO  L124   PetriNetUnfolderBase]: 10729/21932 cut-off events.
[2025-03-17 11:13:54,564 INFO  L125   PetriNetUnfolderBase]: For 591/591 co-relation queries the response was YES.
[2025-03-17 11:13:54,618 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36888 conditions, 21932 events. 10729/21932 cut-off events. For 591/591 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 201080 event pairs, 5362 based on Foata normal form. 0/20328 useless extension candidates. Maximal degree in co-relation 27803. Up to 9906 conditions per place. 
[2025-03-17 11:13:54,709 INFO  L140   encePairwiseOnDemand]: 279/281 looper letters, 48 selfloop transitions, 1 changer transitions 0/261 dead transitions.
[2025-03-17 11:13:54,709 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 261 transitions, 639 flow
[2025-03-17 11:13:54,709 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 11:13:54,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-17 11:13:54,711 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 764 transitions.
[2025-03-17 11:13:54,711 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9062870699881376
[2025-03-17 11:13:54,711 INFO  L175             Difference]: Start difference. First operand has 251 places, 246 transitions, 506 flow. Second operand 3 states and 764 transitions.
[2025-03-17 11:13:54,711 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 261 transitions, 639 flow
[2025-03-17 11:13:54,713 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 261 transitions, 635 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-17 11:13:54,715 INFO  L231             Difference]: Finished difference. Result has 250 places, 245 transitions, 502 flow
[2025-03-17 11:13:54,715 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=250, PETRI_TRANSITIONS=245}
[2025-03-17 11:13:54,716 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -15 predicate places.
[2025-03-17 11:13:54,716 INFO  L471      AbstractCegarLoop]: Abstraction has has 250 places, 245 transitions, 502 flow
[2025-03-17 11:13:54,717 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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-03-17 11:13:54,717 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-17 11:13:54,717 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]
[2025-03-17 11:13:54,717 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-17 11:13:54,717 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-17 11:13:54,717 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 11:13:54,718 INFO  L85        PathProgramCache]: Analyzing trace with hash -452901935, now seen corresponding path program 1 times
[2025-03-17 11:13:54,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 11:13:54,718 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568723072]
[2025-03-17 11:13:54,718 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 11:13:54,718 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 11:13:54,726 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes.
[2025-03-17 11:13:54,735 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements.
[2025-03-17 11:13:54,735 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 11:13:54,735 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 11:13:54,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-17 11:13:54,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 11:13:54,776 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568723072]
[2025-03-17 11:13:54,776 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568723072] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 11:13:54,776 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 11:13:54,776 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-17 11:13:54,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038133703]
[2025-03-17 11:13:54,776 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 11:13:54,777 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 11:13:54,777 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 11:13:54,777 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 11:13:54,777 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 11:13:54,789 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281
[2025-03-17 11:13:54,790 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 245 transitions, 502 flow. Second operand  has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-03-17 11:13:54,790 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-17 11:13:54,790 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281
[2025-03-17 11:13:54,790 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-17 11:13:57,728 INFO  L124   PetriNetUnfolderBase]: 14428/32703 cut-off events.
[2025-03-17 11:13:57,728 INFO  L125   PetriNetUnfolderBase]: For 547/547 co-relation queries the response was YES.
[2025-03-17 11:13:57,810 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52534 conditions, 32703 events. 14428/32703 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 355218 event pairs, 7947 based on Foata normal form. 0/28649 useless extension candidates. Maximal degree in co-relation 40943. Up to 13745 conditions per place. 
[2025-03-17 11:13:57,922 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 50 selfloop transitions, 2 changer transitions 0/261 dead transitions.
[2025-03-17 11:13:57,922 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 261 transitions, 643 flow
[2025-03-17 11:13:57,923 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 11:13:57,923 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-17 11:13:57,924 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions.
[2025-03-17 11:13:57,924 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9027283511269276
[2025-03-17 11:13:57,924 INFO  L175             Difference]: Start difference. First operand has 250 places, 245 transitions, 502 flow. Second operand 3 states and 761 transitions.
[2025-03-17 11:13:57,924 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 261 transitions, 643 flow
[2025-03-17 11:13:57,925 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 261 transitions, 642 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-17 11:13:57,927 INFO  L231             Difference]: Finished difference. Result has 250 places, 244 transitions, 503 flow
[2025-03-17 11:13:57,927 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=503, PETRI_PLACES=250, PETRI_TRANSITIONS=244}
[2025-03-17 11:13:57,928 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -15 predicate places.
[2025-03-17 11:13:57,928 INFO  L471      AbstractCegarLoop]: Abstraction has has 250 places, 244 transitions, 503 flow
[2025-03-17 11:13:57,928 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-03-17 11:13:57,928 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-17 11:13:57,928 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]
[2025-03-17 11:13:57,929 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-17 11:13:57,929 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-17 11:13:57,929 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 11:13:57,929 INFO  L85        PathProgramCache]: Analyzing trace with hash 961141011, now seen corresponding path program 1 times
[2025-03-17 11:13:57,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 11:13:57,929 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315032751]
[2025-03-17 11:13:57,929 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 11:13:57,930 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 11:13:57,939 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes.
[2025-03-17 11:13:57,945 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements.
[2025-03-17 11:13:57,948 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 11:13:57,948 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 11:13:57,980 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-17 11:13:57,980 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 11:13:57,981 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315032751]
[2025-03-17 11:13:57,981 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315032751] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 11:13:57,981 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 11:13:57,981 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-17 11:13:57,981 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509472447]
[2025-03-17 11:13:57,981 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 11:13:57,981 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 11:13:57,982 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 11:13:57,982 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 11:13:57,982 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 11:13:57,989 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281
[2025-03-17 11:13:57,990 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 244 transitions, 503 flow. Second operand  has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 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-03-17 11:13:57,990 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-17 11:13:57,990 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281
[2025-03-17 11:13:57,990 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-17 11:14:00,301 INFO  L124   PetriNetUnfolderBase]: 11068/25050 cut-off events.
[2025-03-17 11:14:00,301 INFO  L125   PetriNetUnfolderBase]: For 864/864 co-relation queries the response was YES.
[2025-03-17 11:14:00,366 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40703 conditions, 25050 events. 11068/25050 cut-off events. For 864/864 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 253624 event pairs, 4982 based on Foata normal form. 0/22705 useless extension candidates. Maximal degree in co-relation 31491. Up to 8803 conditions per place. 
[2025-03-17 11:14:00,440 INFO  L140   encePairwiseOnDemand]: 279/281 looper letters, 49 selfloop transitions, 1 changer transitions 0/260 dead transitions.
[2025-03-17 11:14:00,440 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 260 transitions, 640 flow
[2025-03-17 11:14:00,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 11:14:00,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-17 11:14:00,441 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions.
[2025-03-17 11:14:00,442 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9074733096085409
[2025-03-17 11:14:00,442 INFO  L175             Difference]: Start difference. First operand has 250 places, 244 transitions, 503 flow. Second operand 3 states and 765 transitions.
[2025-03-17 11:14:00,442 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 260 transitions, 640 flow
[2025-03-17 11:14:00,445 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 260 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-17 11:14:00,447 INFO  L231             Difference]: Finished difference. Result has 249 places, 243 transitions, 499 flow
[2025-03-17 11:14:00,447 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=249, PETRI_TRANSITIONS=243}
[2025-03-17 11:14:00,448 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -16 predicate places.
[2025-03-17 11:14:00,448 INFO  L471      AbstractCegarLoop]: Abstraction has has 249 places, 243 transitions, 499 flow
[2025-03-17 11:14:00,448 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 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-03-17 11:14:00,448 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-17 11:14:00,448 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]
[2025-03-17 11:14:00,448 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-17 11:14:00,448 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-17 11:14:00,449 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 11:14:00,449 INFO  L85        PathProgramCache]: Analyzing trace with hash -1562667426, now seen corresponding path program 1 times
[2025-03-17 11:14:00,449 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 11:14:00,449 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370255767]
[2025-03-17 11:14:00,449 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 11:14:00,449 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 11:14:00,457 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes.
[2025-03-17 11:14:00,465 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements.
[2025-03-17 11:14:00,466 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 11:14:00,466 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 11:14:00,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-17 11:14:00,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 11:14:00,485 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370255767]
[2025-03-17 11:14:00,485 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370255767] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 11:14:00,485 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 11:14:00,485 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-17 11:14:00,486 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626343982]
[2025-03-17 11:14:00,486 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 11:14:00,486 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 11:14:00,486 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 11:14:00,486 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 11:14:00,486 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 11:14:00,497 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281
[2025-03-17 11:14:00,498 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 243 transitions, 499 flow. Second operand  has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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-03-17 11:14:00,498 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-17 11:14:00,498 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281
[2025-03-17 11:14:00,498 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-17 11:14:03,152 INFO  L124   PetriNetUnfolderBase]: 14487/31582 cut-off events.
[2025-03-17 11:14:03,153 INFO  L125   PetriNetUnfolderBase]: For 603/603 co-relation queries the response was YES.
[2025-03-17 11:14:03,226 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51474 conditions, 31582 events. 14487/31582 cut-off events. For 603/603 co-relation queries the response was YES. Maximal size of possible extension queue 1302. Compared 335150 event pairs, 7988 based on Foata normal form. 0/27701 useless extension candidates. Maximal degree in co-relation 40321. Up to 13706 conditions per place. 
[2025-03-17 11:14:03,352 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 50 selfloop transitions, 2 changer transitions 0/259 dead transitions.
[2025-03-17 11:14:03,352 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 259 transitions, 640 flow
[2025-03-17 11:14:03,352 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 11:14:03,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-17 11:14:03,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions.
[2025-03-17 11:14:03,354 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9027283511269276
[2025-03-17 11:14:03,354 INFO  L175             Difference]: Start difference. First operand has 249 places, 243 transitions, 499 flow. Second operand 3 states and 761 transitions.
[2025-03-17 11:14:03,354 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 259 transitions, 640 flow
[2025-03-17 11:14:03,355 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 259 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-17 11:14:03,357 INFO  L231             Difference]: Finished difference. Result has 249 places, 242 transitions, 500 flow
[2025-03-17 11:14:03,357 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=249, PETRI_TRANSITIONS=242}
[2025-03-17 11:14:03,358 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -16 predicate places.
[2025-03-17 11:14:03,358 INFO  L471      AbstractCegarLoop]: Abstraction has has 249 places, 242 transitions, 500 flow
[2025-03-17 11:14:03,358 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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-03-17 11:14:03,358 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-17 11:14:03,358 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]
[2025-03-17 11:14:03,358 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-17 11:14:03,358 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-17 11:14:03,359 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 11:14:03,359 INFO  L85        PathProgramCache]: Analyzing trace with hash 91933664, now seen corresponding path program 1 times
[2025-03-17 11:14:03,359 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 11:14:03,359 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022252514]
[2025-03-17 11:14:03,359 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 11:14:03,359 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 11:14:03,371 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-03-17 11:14:03,381 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-03-17 11:14:03,381 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 11:14:03,381 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 11:14:03,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-17 11:14:03,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 11:14:03,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022252514]
[2025-03-17 11:14:03,431 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022252514] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 11:14:03,431 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 11:14:03,431 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-17 11:14:03,431 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969707885]
[2025-03-17 11:14:03,431 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 11:14:03,431 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 11:14:03,432 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 11:14:03,432 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 11:14:03,432 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 11:14:03,441 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281
[2025-03-17 11:14:03,442 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 242 transitions, 500 flow. Second operand  has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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-03-17 11:14:03,442 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-17 11:14:03,442 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281
[2025-03-17 11:14:03,443 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-17 11:14:05,951 INFO  L124   PetriNetUnfolderBase]: 10372/25666 cut-off events.
[2025-03-17 11:14:05,951 INFO  L125   PetriNetUnfolderBase]: For 861/861 co-relation queries the response was YES.
[2025-03-17 11:14:06,004 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40457 conditions, 25666 events. 10372/25666 cut-off events. For 861/861 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 278071 event pairs, 3395 based on Foata normal form. 0/22524 useless extension candidates. Maximal degree in co-relation 31513. Up to 7615 conditions per place. 
[2025-03-17 11:14:06,062 INFO  L140   encePairwiseOnDemand]: 279/281 looper letters, 49 selfloop transitions, 1 changer transitions 0/258 dead transitions.
[2025-03-17 11:14:06,063 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 258 transitions, 637 flow
[2025-03-17 11:14:06,063 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 11:14:06,063 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-17 11:14:06,064 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions.
[2025-03-17 11:14:06,064 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9074733096085409
[2025-03-17 11:14:06,064 INFO  L175             Difference]: Start difference. First operand has 249 places, 242 transitions, 500 flow. Second operand 3 states and 765 transitions.
[2025-03-17 11:14:06,064 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 258 transitions, 637 flow
[2025-03-17 11:14:06,069 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 258 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-17 11:14:06,071 INFO  L231             Difference]: Finished difference. Result has 248 places, 241 transitions, 496 flow
[2025-03-17 11:14:06,071 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=248, PETRI_TRANSITIONS=241}
[2025-03-17 11:14:06,071 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -17 predicate places.
[2025-03-17 11:14:06,072 INFO  L471      AbstractCegarLoop]: Abstraction has has 248 places, 241 transitions, 496 flow
[2025-03-17 11:14:06,072 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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-03-17 11:14:06,072 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-17 11:14:06,072 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]
[2025-03-17 11:14:06,072 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-17 11:14:06,072 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting thread4Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-17 11:14:06,073 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 11:14:06,073 INFO  L85        PathProgramCache]: Analyzing trace with hash -1204852429, now seen corresponding path program 1 times
[2025-03-17 11:14:06,073 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 11:14:06,073 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759980465]
[2025-03-17 11:14:06,073 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 11:14:06,073 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 11:14:06,078 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes.
[2025-03-17 11:14:06,083 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements.
[2025-03-17 11:14:06,083 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 11:14:06,083 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 11:14:06,109 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-17 11:14:06,109 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 11:14:06,109 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759980465]
[2025-03-17 11:14:06,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759980465] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 11:14:06,109 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 11:14:06,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-17 11:14:06,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564095941]
[2025-03-17 11:14:06,109 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 11:14:06,110 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 11:14:06,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 11:14:06,110 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 11:14:06,110 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 11:14:06,123 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281
[2025-03-17 11:14:06,124 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 241 transitions, 496 flow. Second operand  has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 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-03-17 11:14:06,124 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-17 11:14:06,124 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281
[2025-03-17 11:14:06,124 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-17 11:14:08,438 INFO  L124   PetriNetUnfolderBase]: 14972/27283 cut-off events.
[2025-03-17 11:14:08,438 INFO  L125   PetriNetUnfolderBase]: For 662/662 co-relation queries the response was YES.
[2025-03-17 11:14:08,523 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47682 conditions, 27283 events. 14972/27283 cut-off events. For 662/662 co-relation queries the response was YES. Maximal size of possible extension queue 1323. Compared 245071 event pairs, 8588 based on Foata normal form. 0/24254 useless extension candidates. Maximal degree in co-relation 37304. Up to 14363 conditions per place. 
[2025-03-17 11:14:08,646 INFO  L140   encePairwiseOnDemand]: 278/281 looper letters, 50 selfloop transitions, 2 changer transitions 0/257 dead transitions.
[2025-03-17 11:14:08,646 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 257 transitions, 637 flow
[2025-03-17 11:14:08,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 11:14:08,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-17 11:14:08,651 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions.
[2025-03-17 11:14:08,651 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9027283511269276
[2025-03-17 11:14:08,651 INFO  L175             Difference]: Start difference. First operand has 248 places, 241 transitions, 496 flow. Second operand 3 states and 761 transitions.
[2025-03-17 11:14:08,651 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 257 transitions, 637 flow
[2025-03-17 11:14:08,653 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 257 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-17 11:14:08,655 INFO  L231             Difference]: Finished difference. Result has 248 places, 240 transitions, 497 flow
[2025-03-17 11:14:08,656 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=248, PETRI_TRANSITIONS=240}
[2025-03-17 11:14:08,656 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -17 predicate places.
[2025-03-17 11:14:08,656 INFO  L471      AbstractCegarLoop]: Abstraction has has 248 places, 240 transitions, 497 flow
[2025-03-17 11:14:08,657 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 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-03-17 11:14:08,657 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-17 11:14:08,657 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]
[2025-03-17 11:14:08,657 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-17 11:14:08,657 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-17 11:14:08,658 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 11:14:08,658 INFO  L85        PathProgramCache]: Analyzing trace with hash -732177675, now seen corresponding path program 1 times
[2025-03-17 11:14:08,658 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 11:14:08,658 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745108414]
[2025-03-17 11:14:08,658 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 11:14:08,658 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 11:14:08,665 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-03-17 11:14:08,672 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-03-17 11:14:08,672 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 11:14:08,672 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 11:14:08,694 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-17 11:14:08,695 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 11:14:08,695 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745108414]
[2025-03-17 11:14:08,695 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745108414] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 11:14:08,695 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 11:14:08,695 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-17 11:14:08,695 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916342435]
[2025-03-17 11:14:08,695 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 11:14:08,695 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 11:14:08,696 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 11:14:08,696 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 11:14:08,696 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 11:14:08,705 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 238 out of 281
[2025-03-17 11:14:08,706 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 240 transitions, 497 flow. Second operand  has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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-03-17 11:14:08,706 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-17 11:14:08,706 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 281
[2025-03-17 11:14:08,706 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-17 11:14:10,753 INFO  L124   PetriNetUnfolderBase]: 10913/23336 cut-off events.
[2025-03-17 11:14:10,753 INFO  L125   PetriNetUnfolderBase]: For 956/956 co-relation queries the response was YES.
[2025-03-17 11:14:10,849 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39009 conditions, 23336 events. 10913/23336 cut-off events. For 956/956 co-relation queries the response was YES. Maximal size of possible extension queue 1026. Compared 225250 event pairs, 3900 based on Foata normal form. 0/21011 useless extension candidates. Maximal degree in co-relation 30642. Up to 7428 conditions per place. 
[2025-03-17 11:14:10,900 INFO  L140   encePairwiseOnDemand]: 279/281 looper letters, 46 selfloop transitions, 1 changer transitions 6/256 dead transitions.
[2025-03-17 11:14:10,900 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 256 transitions, 634 flow
[2025-03-17 11:14:10,901 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-17 11:14:10,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-17 11:14:10,901 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions.
[2025-03-17 11:14:10,902 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9074733096085409
[2025-03-17 11:14:10,902 INFO  L175             Difference]: Start difference. First operand has 248 places, 240 transitions, 497 flow. Second operand 3 states and 765 transitions.
[2025-03-17 11:14:10,902 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 256 transitions, 634 flow
[2025-03-17 11:14:10,924 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 256 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-17 11:14:10,927 INFO  L231             Difference]: Finished difference. Result has 247 places, 235 transitions, 485 flow
[2025-03-17 11:14:10,927 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=247, PETRI_TRANSITIONS=235}
[2025-03-17 11:14:10,927 INFO  L279   CegarLoopForPetriNet]: 265 programPoint places, -18 predicate places.
[2025-03-17 11:14:10,928 INFO  L471      AbstractCegarLoop]: Abstraction has has 247 places, 235 transitions, 485 flow
[2025-03-17 11:14:10,928 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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-03-17 11:14:10,928 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-17 11:14:10,928 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]
[2025-03-17 11:14:10,928 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-17 11:14:10,928 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting thread5Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-17 11:14:10,929 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 11:14:10,929 INFO  L85        PathProgramCache]: Analyzing trace with hash -689650688, now seen corresponding path program 1 times
[2025-03-17 11:14:10,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 11:14:10,929 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149040671]
[2025-03-17 11:14:10,929 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 11:14:10,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 11:14:10,936 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes.
[2025-03-17 11:14:10,941 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements.
[2025-03-17 11:14:10,941 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 11:14:10,941 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 11:14:10,965 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-17 11:14:10,965 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 11:14:10,965 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149040671]
[2025-03-17 11:14:10,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149040671] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 11:14:10,966 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 11:14:10,966 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-17 11:14:10,966 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709425718]
[2025-03-17 11:14:10,966 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 11:14:10,967 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-17 11:14:10,967 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 11:14:10,967 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-17 11:14:10,967 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-17 11:14:10,978 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 236 out of 281
[2025-03-17 11:14:10,979 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 235 transitions, 485 flow. Second operand  has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 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-03-17 11:14:10,979 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-17 11:14:10,979 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 281
[2025-03-17 11:14:10,979 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand