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


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


Checking for data races
Using default analysis
Version f8ab0bd5
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/popl20-channel-sum.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 bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-f8ab0bd-m
[2025-03-13 22:25:25,339 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-13 22:25:25,395 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2025-03-13 22:25:25,399 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-13 22:25:25,399 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-13 22:25:25,415 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-13 22:25:25,416 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-13 22:25:25,416 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-13 22:25:25,416 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-13 22:25:25,416 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-13 22:25:25,416 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-13 22:25:25,416 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-13 22:25:25,416 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-13 22:25:25,416 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-13 22:25:25,416 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-13 22:25:25,417 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-13 22:25:25,417 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-13 22:25:25,418 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-13 22:25:25,418 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-13 22:25:25,418 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-13 22:25:25,418 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-13 22:25:25,418 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-13 22:25:25,418 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-13 22:25:25,418 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-13 22:25:25,418 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-13 22:25:25,418 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-13 22:25:25,418 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-13 22:25:25,418 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 -> bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670
[2025-03-13 22:25:25,690 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-13 22:25:25,696 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-13 22:25:25,698 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-13 22:25:25,698 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-13 22:25:25,699 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-13 22:25:25,699 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c
[2025-03-13 22:25:26,868 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688501c66/3eb8a5e38b3243dc9affbf04d8fe52fc/FLAG50b077304
[2025-03-13 22:25:27,081 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-13 22:25:27,081 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c
[2025-03-13 22:25:27,086 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688501c66/3eb8a5e38b3243dc9affbf04d8fe52fc/FLAG50b077304
[2025-03-13 22:25:27,431 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688501c66/3eb8a5e38b3243dc9affbf04d8fe52fc
[2025-03-13 22:25:27,433 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-13 22:25:27,434 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-13 22:25:27,435 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-13 22:25:27,435 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-13 22:25:27,438 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-13 22:25:27,438 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:27" (1/1) ...
[2025-03-13 22:25:27,439 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6755a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:27, skipping insertion in model container
[2025-03-13 22:25:27,439 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:27" (1/1) ...
[2025-03-13 22:25:27,453 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-13 22:25:27,584 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-13 22:25:27,592 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-13 22:25:27,616 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-13 22:25:27,632 INFO  L204         MainTranslator]: Completed translation
[2025-03-13 22:25:27,633 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:27 WrapperNode
[2025-03-13 22:25:27,633 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-13 22:25:27,634 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-13 22:25:27,634 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-13 22:25:27,634 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-13 22:25:27,640 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:27" (1/1) ...
[2025-03-13 22:25:27,646 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:27" (1/1) ...
[2025-03-13 22:25:27,666 INFO  L138                Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 200
[2025-03-13 22:25:27,667 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-13 22:25:27,667 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-13 22:25:27,668 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-13 22:25:27,668 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-13 22:25:27,673 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:27" (1/1) ...
[2025-03-13 22:25:27,673 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:27" (1/1) ...
[2025-03-13 22:25:27,675 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:27" (1/1) ...
[2025-03-13 22:25:27,675 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:27" (1/1) ...
[2025-03-13 22:25:27,682 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:27" (1/1) ...
[2025-03-13 22:25:27,684 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:27" (1/1) ...
[2025-03-13 22:25:27,685 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:27" (1/1) ...
[2025-03-13 22:25:27,686 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:27" (1/1) ...
[2025-03-13 22:25:27,688 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-13 22:25:27,688 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-13 22:25:27,688 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-13 22:25:27,689 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-13 22:25:27,689 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:27" (1/1) ...
[2025-03-13 22:25:27,693 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-13 22:25:27,705 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-13 22:25:27,718 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-13 22:25:27,720 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-13 22:25:27,736 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-13 22:25:27,736 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2025-03-13 22:25:27,737 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2025-03-13 22:25:27,737 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2025-03-13 22:25:27,737 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2025-03-13 22:25:27,737 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-03-13 22:25:27,737 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2025-03-13 22:25:27,737 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2025-03-13 22:25:27,737 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-13 22:25:27,737 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-13 22:25:27,737 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2025-03-13 22:25:27,738 WARN  L225             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-03-13 22:25:27,813 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-13 22:25:27,814 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-13 22:25:28,126 INFO  L303             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-03-13 22:25:28,127 INFO  L313             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-13 22:25:28,127 INFO  L318             CfgBuilder]: Performing block encoding
[2025-03-13 22:25:28,158 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-13 22:25:28,160 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:28 BoogieIcfgContainer
[2025-03-13 22:25:28,160 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-13 22:25:28,161 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-13 22:25:28,162 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-13 22:25:28,165 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-13 22:25:28,165 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:25:27" (1/3) ...
[2025-03-13 22:25:28,165 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e334c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:28, skipping insertion in model container
[2025-03-13 22:25:28,166 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:27" (2/3) ...
[2025-03-13 22:25:28,166 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e334c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:28, skipping insertion in model container
[2025-03-13 22:25:28,166 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:28" (3/3) ...
[2025-03-13 22:25:28,167 INFO  L128   eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c
[2025-03-13 22:25:28,176 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-13 22:25:28,178 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-channel-sum.wvr.c that has 3 procedures, 239 locations, 1 initial locations, 3 loop locations, and 18 error locations.
[2025-03-13 22:25:28,178 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-03-13 22:25:28,254 INFO  L143    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2025-03-13 22:25:28,289 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 245 places, 253 transitions, 520 flow
[2025-03-13 22:25:28,365 INFO  L124   PetriNetUnfolderBase]: 15/251 cut-off events.
[2025-03-13 22:25:28,368 INFO  L125   PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2025-03-13 22:25:28,374 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 260 conditions, 251 events. 15/251 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 530 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 149. Up to 2 conditions per place. 
[2025-03-13 22:25:28,375 INFO  L82        GeneralOperation]: Start removeDead. Operand has 245 places, 253 transitions, 520 flow
[2025-03-13 22:25:28,381 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 225 places, 231 transitions, 474 flow
[2025-03-13 22:25:28,391 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-13 22:25:28,402 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;@3db64f11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-13 22:25:28,402 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 32 error locations.
[2025-03-13 22:25:28,409 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-03-13 22:25:28,409 INFO  L124   PetriNetUnfolderBase]: 0/27 cut-off events.
[2025-03-13 22:25:28,409 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-13 22:25:28,410 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:28,410 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]
[2025-03-13 22:25:28,411 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2025-03-13 22:25:28,415 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:28,415 INFO  L85        PathProgramCache]: Analyzing trace with hash -1235175803, now seen corresponding path program 1 times
[2025-03-13 22:25:28,420 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:28,423 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604195305]
[2025-03-13 22:25:28,424 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:28,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:28,491 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-03-13 22:25:28,501 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-03-13 22:25:28,502 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:28,502 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:28,566 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-13 22:25:28,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:28,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604195305]
[2025-03-13 22:25:28,568 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604195305] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:28,568 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:28,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:28,569 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208287284]
[2025-03-13 22:25:28,569 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:28,573 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:28,576 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:28,592 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:28,593 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:28,635 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 253
[2025-03-13 22:25:28,639 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 231 transitions, 474 flow. Second operand  has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 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-13 22:25:28,639 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:28,639 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 253
[2025-03-13 22:25:28,641 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:28,754 INFO  L124   PetriNetUnfolderBase]: 24/428 cut-off events.
[2025-03-13 22:25:28,757 INFO  L125   PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES.
[2025-03-13 22:25:28,760 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 488 conditions, 428 events. 24/428 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1561 event pairs, 11 based on Foata normal form. 20/381 useless extension candidates. Maximal degree in co-relation 358. Up to 42 conditions per place. 
[2025-03-13 22:25:28,764 INFO  L140   encePairwiseOnDemand]: 243/253 looper letters, 15 selfloop transitions, 2 changer transitions 2/223 dead transitions.
[2025-03-13 22:25:28,765 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 223 transitions, 492 flow
[2025-03-13 22:25:28,766 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:28,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:28,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions.
[2025-03-13 22:25:28,779 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.922266139657444
[2025-03-13 22:25:28,781 INFO  L175             Difference]: Start difference. First operand has 225 places, 231 transitions, 474 flow. Second operand 3 states and 700 transitions.
[2025-03-13 22:25:28,782 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 223 transitions, 492 flow
[2025-03-13 22:25:28,786 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 223 transitions, 484 flow, removed 0 selfloop flow, removed 4 redundant places.
[2025-03-13 22:25:28,790 INFO  L231             Difference]: Finished difference. Result has 222 places, 221 transitions, 450 flow
[2025-03-13 22:25:28,792 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=222, PETRI_TRANSITIONS=221}
[2025-03-13 22:25:28,794 INFO  L279   CegarLoopForPetriNet]: 225 programPoint places, -3 predicate places.
[2025-03-13 22:25:28,794 INFO  L471      AbstractCegarLoop]: Abstraction has has 222 places, 221 transitions, 450 flow
[2025-03-13 22:25:28,795 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 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-13 22:25:28,795 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:28,795 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]
[2025-03-13 22:25:28,795 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-13 22:25:28,796 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2025-03-13 22:25:28,796 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:28,796 INFO  L85        PathProgramCache]: Analyzing trace with hash -1826982964, now seen corresponding path program 1 times
[2025-03-13 22:25:28,796 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:28,796 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438685752]
[2025-03-13 22:25:28,796 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:28,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:28,803 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-03-13 22:25:28,811 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-03-13 22:25:28,811 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:28,811 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:28,849 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-13 22:25:28,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:28,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438685752]
[2025-03-13 22:25:28,849 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438685752] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:28,850 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:28,850 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:28,850 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121098699]
[2025-03-13 22:25:28,850 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:28,851 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:28,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:28,851 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:28,851 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:28,866 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 253
[2025-03-13 22:25:28,867 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 221 transitions, 450 flow. Second operand  has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 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-13 22:25:28,867 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:28,867 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 253
[2025-03-13 22:25:28,868 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:28,958 INFO  L124   PetriNetUnfolderBase]: 39/577 cut-off events.
[2025-03-13 22:25:28,958 INFO  L125   PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES.
[2025-03-13 22:25:28,963 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 652 conditions, 577 events. 39/577 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2842 event pairs, 19 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 615. Up to 62 conditions per place. 
[2025-03-13 22:25:28,966 INFO  L140   encePairwiseOnDemand]: 249/253 looper letters, 15 selfloop transitions, 1 changer transitions 0/218 dead transitions.
[2025-03-13 22:25:28,966 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 218 transitions, 476 flow
[2025-03-13 22:25:28,967 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:28,967 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:28,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions.
[2025-03-13 22:25:28,969 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9143610013175231
[2025-03-13 22:25:28,969 INFO  L175             Difference]: Start difference. First operand has 222 places, 221 transitions, 450 flow. Second operand 3 states and 694 transitions.
[2025-03-13 22:25:28,969 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 218 transitions, 476 flow
[2025-03-13 22:25:28,970 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 218 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:28,975 INFO  L231             Difference]: Finished difference. Result has 217 places, 218 transitions, 442 flow
[2025-03-13 22:25:28,976 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=217, PETRI_TRANSITIONS=218}
[2025-03-13 22:25:28,976 INFO  L279   CegarLoopForPetriNet]: 225 programPoint places, -8 predicate places.
[2025-03-13 22:25:28,976 INFO  L471      AbstractCegarLoop]: Abstraction has has 217 places, 218 transitions, 442 flow
[2025-03-13 22:25:28,977 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 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-13 22:25:28,977 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:28,977 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]
[2025-03-13 22:25:28,977 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-13 22:25:28,977 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2025-03-13 22:25:28,978 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:28,978 INFO  L85        PathProgramCache]: Analyzing trace with hash -176853484, now seen corresponding path program 1 times
[2025-03-13 22:25:28,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:28,978 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38459071]
[2025-03-13 22:25:28,978 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:28,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:28,990 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes.
[2025-03-13 22:25:29,023 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements.
[2025-03-13 22:25:29,024 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:29,024 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:29,536 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-13 22:25:29,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:29,537 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38459071]
[2025-03-13 22:25:29,537 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38459071] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:29,537 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:29,537 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-13 22:25:29,537 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931381080]
[2025-03-13 22:25:29,537 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:29,537 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-13 22:25:29,537 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:29,538 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-13 22:25:29,538 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-13 22:25:29,670 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 209 out of 253
[2025-03-13 22:25:29,671 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 218 transitions, 442 flow. Second operand  has 6 states, 6 states have (on average 210.83333333333334) internal successors, (1265), 6 states have internal predecessors, (1265), 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-13 22:25:29,671 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:29,671 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 253
[2025-03-13 22:25:29,671 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:29,801 INFO  L124   PetriNetUnfolderBase]: 120/846 cut-off events.
[2025-03-13 22:25:29,802 INFO  L125   PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES.
[2025-03-13 22:25:29,805 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 846 events. 120/846 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4419 event pairs, 65 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 1018. Up to 193 conditions per place. 
[2025-03-13 22:25:29,825 INFO  L140   encePairwiseOnDemand]: 247/253 looper letters, 29 selfloop transitions, 5 changer transitions 0/217 dead transitions.
[2025-03-13 22:25:29,826 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 217 transitions, 508 flow
[2025-03-13 22:25:29,826 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-13 22:25:29,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-13 22:25:29,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1289 transitions.
[2025-03-13 22:25:29,829 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8491436100131752
[2025-03-13 22:25:29,829 INFO  L175             Difference]: Start difference. First operand has 217 places, 218 transitions, 442 flow. Second operand 6 states and 1289 transitions.
[2025-03-13 22:25:29,829 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 217 transitions, 508 flow
[2025-03-13 22:25:29,830 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 217 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:29,833 INFO  L231             Difference]: Finished difference. Result has 220 places, 217 transitions, 449 flow
[2025-03-13 22:25:29,833 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=449, PETRI_PLACES=220, PETRI_TRANSITIONS=217}
[2025-03-13 22:25:29,834 INFO  L279   CegarLoopForPetriNet]: 225 programPoint places, -5 predicate places.
[2025-03-13 22:25:29,834 INFO  L471      AbstractCegarLoop]: Abstraction has has 220 places, 217 transitions, 449 flow
[2025-03-13 22:25:29,835 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 210.83333333333334) internal successors, (1265), 6 states have internal predecessors, (1265), 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-13 22:25:29,835 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:29,835 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]
[2025-03-13 22:25:29,835 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-13 22:25:29,835 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2025-03-13 22:25:29,836 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:29,836 INFO  L85        PathProgramCache]: Analyzing trace with hash 1180655049, now seen corresponding path program 1 times
[2025-03-13 22:25:29,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:29,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423663824]
[2025-03-13 22:25:29,836 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:29,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:29,843 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes.
[2025-03-13 22:25:29,848 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements.
[2025-03-13 22:25:29,850 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:29,850 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:29,874 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-13 22:25:29,874 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:29,874 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423663824]
[2025-03-13 22:25:29,874 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423663824] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:29,874 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:29,875 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:29,875 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763365240]
[2025-03-13 22:25:29,875 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:29,875 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:29,875 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:29,875 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:29,875 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:29,896 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 253
[2025-03-13 22:25:29,897 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 217 transitions, 449 flow. Second operand  has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 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-13 22:25:29,897 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:29,897 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 253
[2025-03-13 22:25:29,897 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:29,939 INFO  L124   PetriNetUnfolderBase]: 26/374 cut-off events.
[2025-03-13 22:25:29,939 INFO  L125   PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES.
[2025-03-13 22:25:29,940 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 432 conditions, 374 events. 26/374 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1351 event pairs, 14 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 414. Up to 44 conditions per place. 
[2025-03-13 22:25:29,942 INFO  L140   encePairwiseOnDemand]: 250/253 looper letters, 15 selfloop transitions, 2 changer transitions 0/216 dead transitions.
[2025-03-13 22:25:29,942 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 216 transitions, 481 flow
[2025-03-13 22:25:29,942 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:29,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:29,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions.
[2025-03-13 22:25:29,945 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9130434782608695
[2025-03-13 22:25:29,945 INFO  L175             Difference]: Start difference. First operand has 220 places, 217 transitions, 449 flow. Second operand 3 states and 693 transitions.
[2025-03-13 22:25:29,946 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 216 transitions, 481 flow
[2025-03-13 22:25:29,947 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 216 transitions, 471 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-03-13 22:25:29,949 INFO  L231             Difference]: Finished difference. Result has 216 places, 216 transitions, 441 flow
[2025-03-13 22:25:29,950 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=216, PETRI_TRANSITIONS=216}
[2025-03-13 22:25:29,950 INFO  L279   CegarLoopForPetriNet]: 225 programPoint places, -9 predicate places.
[2025-03-13 22:25:29,950 INFO  L471      AbstractCegarLoop]: Abstraction has has 216 places, 216 transitions, 441 flow
[2025-03-13 22:25:29,951 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 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-13 22:25:29,951 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:29,952 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]
[2025-03-13 22:25:29,952 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-13 22:25:29,952 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2025-03-13 22:25:29,952 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:29,953 INFO  L85        PathProgramCache]: Analyzing trace with hash -405790837, now seen corresponding path program 1 times
[2025-03-13 22:25:29,953 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:29,953 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001350071]
[2025-03-13 22:25:29,954 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:29,954 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:29,961 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-03-13 22:25:29,967 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-03-13 22:25:29,968 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:29,968 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:30,011 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-13 22:25:30,013 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:30,013 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001350071]
[2025-03-13 22:25:30,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001350071] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:30,013 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:30,013 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-13 22:25:30,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362403492]
[2025-03-13 22:25:30,013 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:30,014 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:30,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:30,015 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:30,015 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:30,065 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 231 out of 253
[2025-03-13 22:25:30,066 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 216 transitions, 441 flow. Second operand  has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-13 22:25:30,066 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:30,066 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 253
[2025-03-13 22:25:30,066 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:30,118 INFO  L124   PetriNetUnfolderBase]: 32/493 cut-off events.
[2025-03-13 22:25:30,118 INFO  L125   PetriNetUnfolderBase]: For 8/13 co-relation queries the response was YES.
[2025-03-13 22:25:30,119 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 549 conditions, 493 events. 32/493 cut-off events. For 8/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1748 event pairs, 1 based on Foata normal form. 1/420 useless extension candidates. Maximal degree in co-relation 511. Up to 33 conditions per place. 
[2025-03-13 22:25:30,136 INFO  L140   encePairwiseOnDemand]: 248/253 looper letters, 14 selfloop transitions, 4 changer transitions 0/221 dead transitions.
[2025-03-13 22:25:30,136 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 221 transitions, 489 flow
[2025-03-13 22:25:30,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:30,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:30,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions.
[2025-03-13 22:25:30,138 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9380764163372859
[2025-03-13 22:25:30,138 INFO  L175             Difference]: Start difference. First operand has 216 places, 216 transitions, 441 flow. Second operand 3 states and 712 transitions.
[2025-03-13 22:25:30,138 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 221 transitions, 489 flow
[2025-03-13 22:25:30,139 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 221 transitions, 485 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:30,141 INFO  L231             Difference]: Finished difference. Result has 218 places, 219 transitions, 467 flow
[2025-03-13 22:25:30,142 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=218, PETRI_TRANSITIONS=219}
[2025-03-13 22:25:30,142 INFO  L279   CegarLoopForPetriNet]: 225 programPoint places, -7 predicate places.
[2025-03-13 22:25:30,142 INFO  L471      AbstractCegarLoop]: Abstraction has has 218 places, 219 transitions, 467 flow
[2025-03-13 22:25:30,143 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-13 22:25:30,143 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:30,143 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]
[2025-03-13 22:25:30,143 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-13 22:25:30,143 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2025-03-13 22:25:30,144 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:30,144 INFO  L85        PathProgramCache]: Analyzing trace with hash 1695698137, now seen corresponding path program 1 times
[2025-03-13 22:25:30,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:30,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133004561]
[2025-03-13 22:25:30,144 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:30,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:30,150 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-03-13 22:25:30,155 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-03-13 22:25:30,155 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:30,155 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:30,190 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-13 22:25:30,190 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:30,191 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133004561]
[2025-03-13 22:25:30,191 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133004561] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:30,192 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:30,192 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:30,192 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150449236]
[2025-03-13 22:25:30,192 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:30,192 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:30,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:30,194 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:30,194 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:30,211 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 253
[2025-03-13 22:25:30,212 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 219 transitions, 467 flow. Second operand  has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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-13 22:25:30,212 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:30,212 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 253
[2025-03-13 22:25:30,212 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:30,264 INFO  L124   PetriNetUnfolderBase]: 35/426 cut-off events.
[2025-03-13 22:25:30,264 INFO  L125   PetriNetUnfolderBase]: For 59/80 co-relation queries the response was YES.
[2025-03-13 22:25:30,265 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 536 conditions, 426 events. 35/426 cut-off events. For 59/80 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1276 event pairs, 2 based on Foata normal form. 4/371 useless extension candidates. Maximal degree in co-relation 497. Up to 39 conditions per place. 
[2025-03-13 22:25:30,267 INFO  L140   encePairwiseOnDemand]: 247/253 looper letters, 13 selfloop transitions, 2 changer transitions 6/218 dead transitions.
[2025-03-13 22:25:30,268 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 218 transitions, 507 flow
[2025-03-13 22:25:30,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:30,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:30,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 695 transitions.
[2025-03-13 22:25:30,269 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9156785243741765
[2025-03-13 22:25:30,269 INFO  L175             Difference]: Start difference. First operand has 218 places, 219 transitions, 467 flow. Second operand 3 states and 695 transitions.
[2025-03-13 22:25:30,270 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 218 transitions, 507 flow
[2025-03-13 22:25:30,271 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 218 transitions, 499 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:30,273 INFO  L231             Difference]: Finished difference. Result has 215 places, 210 transitions, 444 flow
[2025-03-13 22:25:30,274 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=215, PETRI_TRANSITIONS=210}
[2025-03-13 22:25:30,275 INFO  L279   CegarLoopForPetriNet]: 225 programPoint places, -10 predicate places.
[2025-03-13 22:25:30,275 INFO  L471      AbstractCegarLoop]: Abstraction has has 215 places, 210 transitions, 444 flow
[2025-03-13 22:25:30,276 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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-13 22:25:30,276 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:30,276 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]
[2025-03-13 22:25:30,276 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-13 22:25:30,276 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2025-03-13 22:25:30,276 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:30,276 INFO  L85        PathProgramCache]: Analyzing trace with hash -724150130, now seen corresponding path program 1 times
[2025-03-13 22:25:30,277 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:30,277 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528050588]
[2025-03-13 22:25:30,277 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:30,277 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:30,289 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-03-13 22:25:30,296 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-03-13 22:25:30,296 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:30,296 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:30,325 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-13 22:25:30,326 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:30,327 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528050588]
[2025-03-13 22:25:30,327 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528050588] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:30,327 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:30,327 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:30,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000384303]
[2025-03-13 22:25:30,327 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:30,327 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:30,328 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:30,329 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:30,329 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:30,342 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 253
[2025-03-13 22:25:30,343 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 210 transitions, 444 flow. Second operand  has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 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-13 22:25:30,343 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:30,343 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 253
[2025-03-13 22:25:30,343 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:30,422 INFO  L124   PetriNetUnfolderBase]: 74/722 cut-off events.
[2025-03-13 22:25:30,422 INFO  L125   PetriNetUnfolderBase]: For 48/56 co-relation queries the response was YES.
[2025-03-13 22:25:30,424 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 893 conditions, 722 events. 74/722 cut-off events. For 48/56 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3053 event pairs, 12 based on Foata normal form. 0/625 useless extension candidates. Maximal degree in co-relation 855. Up to 102 conditions per place. 
[2025-03-13 22:25:30,426 INFO  L140   encePairwiseOnDemand]: 248/253 looper letters, 18 selfloop transitions, 2 changer transitions 0/210 dead transitions.
[2025-03-13 22:25:30,426 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 210 transitions, 485 flow
[2025-03-13 22:25:30,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:30,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:30,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions.
[2025-03-13 22:25:30,429 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9169960474308301
[2025-03-13 22:25:30,429 INFO  L175             Difference]: Start difference. First operand has 215 places, 210 transitions, 444 flow. Second operand 3 states and 696 transitions.
[2025-03-13 22:25:30,429 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 210 transitions, 485 flow
[2025-03-13 22:25:30,431 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 210 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:30,434 INFO  L231             Difference]: Finished difference. Result has 207 places, 209 transitions, 448 flow
[2025-03-13 22:25:30,434 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=207, PETRI_TRANSITIONS=209}
[2025-03-13 22:25:30,435 INFO  L279   CegarLoopForPetriNet]: 225 programPoint places, -18 predicate places.
[2025-03-13 22:25:30,436 INFO  L471      AbstractCegarLoop]: Abstraction has has 207 places, 209 transitions, 448 flow
[2025-03-13 22:25:30,437 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 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-13 22:25:30,437 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:30,437 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:30,437 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-13 22:25:30,437 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2025-03-13 22:25:30,438 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:30,438 INFO  L85        PathProgramCache]: Analyzing trace with hash -772436364, now seen corresponding path program 1 times
[2025-03-13 22:25:30,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:30,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248313885]
[2025-03-13 22:25:30,438 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:30,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:30,451 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes.
[2025-03-13 22:25:30,463 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements.
[2025-03-13 22:25:30,465 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:30,466 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:30,809 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-13 22:25:30,809 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:30,810 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248313885]
[2025-03-13 22:25:30,810 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248313885] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:30,810 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:30,810 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-13 22:25:30,810 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345550707]
[2025-03-13 22:25:30,810 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:30,811 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-13 22:25:30,811 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:30,811 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-13 22:25:30,811 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-13 22:25:30,945 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 216 out of 253
[2025-03-13 22:25:30,946 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 209 transitions, 448 flow. Second operand  has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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-13 22:25:30,947 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:30,947 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 253
[2025-03-13 22:25:30,947 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:31,041 INFO  L124   PetriNetUnfolderBase]: 96/719 cut-off events.
[2025-03-13 22:25:31,041 INFO  L125   PetriNetUnfolderBase]: For 68/80 co-relation queries the response was YES.
[2025-03-13 22:25:31,044 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 936 conditions, 719 events. 96/719 cut-off events. For 68/80 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2824 event pairs, 2 based on Foata normal form. 8/638 useless extension candidates. Maximal degree in co-relation 896. Up to 48 conditions per place. 
[2025-03-13 22:25:31,045 INFO  L140   encePairwiseOnDemand]: 241/253 looper letters, 19 selfloop transitions, 12 changer transitions 4/215 dead transitions.
[2025-03-13 22:25:31,045 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 215 transitions, 534 flow
[2025-03-13 22:25:31,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-13 22:25:31,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-13 22:25:31,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1331 transitions.
[2025-03-13 22:25:31,048 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8768115942028986
[2025-03-13 22:25:31,048 INFO  L175             Difference]: Start difference. First operand has 207 places, 209 transitions, 448 flow. Second operand 6 states and 1331 transitions.
[2025-03-13 22:25:31,048 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 215 transitions, 534 flow
[2025-03-13 22:25:31,050 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 215 transitions, 534 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-03-13 22:25:31,052 INFO  L231             Difference]: Finished difference. Result has 210 places, 207 transitions, 468 flow
[2025-03-13 22:25:31,052 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=210, PETRI_TRANSITIONS=207}
[2025-03-13 22:25:31,053 INFO  L279   CegarLoopForPetriNet]: 225 programPoint places, -15 predicate places.
[2025-03-13 22:25:31,053 INFO  L471      AbstractCegarLoop]: Abstraction has has 210 places, 207 transitions, 468 flow
[2025-03-13 22:25:31,053 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 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-13 22:25:31,054 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:31,054 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:31,054 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-13 22:25:31,054 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2025-03-13 22:25:31,055 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:31,055 INFO  L85        PathProgramCache]: Analyzing trace with hash -1032478622, now seen corresponding path program 1 times
[2025-03-13 22:25:31,055 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:31,055 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455145418]
[2025-03-13 22:25:31,055 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:31,055 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:31,064 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-03-13 22:25:31,072 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-03-13 22:25:31,075 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:31,075 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:31,398 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-13 22:25:31,398 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:31,398 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455145418]
[2025-03-13 22:25:31,398 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455145418] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:31,398 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:31,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-13 22:25:31,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880076352]
[2025-03-13 22:25:31,399 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:31,399 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-13 22:25:31,399 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:31,399 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-13 22:25:31,399 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-13 22:25:31,569 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 222 out of 253
[2025-03-13 22:25:31,570 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 207 transitions, 468 flow. Second operand  has 6 states, 6 states have (on average 224.16666666666666) internal successors, (1345), 6 states have internal predecessors, (1345), 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-13 22:25:31,571 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:31,571 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 253
[2025-03-13 22:25:31,571 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:31,627 INFO  L124   PetriNetUnfolderBase]: 38/401 cut-off events.
[2025-03-13 22:25:31,628 INFO  L125   PetriNetUnfolderBase]: For 96/126 co-relation queries the response was YES.
[2025-03-13 22:25:31,629 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 569 conditions, 401 events. 38/401 cut-off events. For 96/126 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1095 event pairs, 2 based on Foata normal form. 8/362 useless extension candidates. Maximal degree in co-relation 528. Up to 39 conditions per place. 
[2025-03-13 22:25:31,630 INFO  L140   encePairwiseOnDemand]: 247/253 looper letters, 25 selfloop transitions, 5 changer transitions 0/214 dead transitions.
[2025-03-13 22:25:31,630 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 214 transitions, 574 flow
[2025-03-13 22:25:31,631 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-13 22:25:31,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-13 22:25:31,633 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1361 transitions.
[2025-03-13 22:25:31,634 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8965744400527009
[2025-03-13 22:25:31,634 INFO  L175             Difference]: Start difference. First operand has 210 places, 207 transitions, 468 flow. Second operand 6 states and 1361 transitions.
[2025-03-13 22:25:31,634 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 214 transitions, 574 flow
[2025-03-13 22:25:31,635 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 214 transitions, 534 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-03-13 22:25:31,637 INFO  L231             Difference]: Finished difference. Result has 209 places, 206 transitions, 452 flow
[2025-03-13 22:25:31,637 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=452, PETRI_PLACES=209, PETRI_TRANSITIONS=206}
[2025-03-13 22:25:31,638 INFO  L279   CegarLoopForPetriNet]: 225 programPoint places, -16 predicate places.
[2025-03-13 22:25:31,638 INFO  L471      AbstractCegarLoop]: Abstraction has has 209 places, 206 transitions, 452 flow
[2025-03-13 22:25:31,639 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 224.16666666666666) internal successors, (1345), 6 states have internal predecessors, (1345), 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-13 22:25:31,639 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:31,639 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:31,639 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-13 22:25:31,639 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2025-03-13 22:25:31,640 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:31,640 INFO  L85        PathProgramCache]: Analyzing trace with hash 1892326140, now seen corresponding path program 1 times
[2025-03-13 22:25:31,640 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:31,640 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33834244]
[2025-03-13 22:25:31,640 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:31,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:31,651 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes.
[2025-03-13 22:25:31,658 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements.
[2025-03-13 22:25:31,659 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:31,659 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:31,685 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-13 22:25:31,686 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:31,686 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33834244]
[2025-03-13 22:25:31,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33834244] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:31,686 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:31,686 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:31,686 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569166305]
[2025-03-13 22:25:31,686 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:31,687 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:31,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:31,688 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:31,688 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:31,697 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 229 out of 253
[2025-03-13 22:25:31,698 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 206 transitions, 452 flow. Second operand  has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 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-13 22:25:31,698 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:31,698 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 253
[2025-03-13 22:25:31,698 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:31,745 INFO  L124   PetriNetUnfolderBase]: 38/399 cut-off events.
[2025-03-13 22:25:31,745 INFO  L125   PetriNetUnfolderBase]: For 36/66 co-relation queries the response was YES.
[2025-03-13 22:25:31,747 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 516 conditions, 399 events. 38/399 cut-off events. For 36/66 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1080 event pairs, 2 based on Foata normal form. 2/350 useless extension candidates. Maximal degree in co-relation 477. Up to 44 conditions per place. 
[2025-03-13 22:25:31,748 INFO  L140   encePairwiseOnDemand]: 250/253 looper letters, 15 selfloop transitions, 2 changer transitions 0/207 dead transitions.
[2025-03-13 22:25:31,748 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 207 transitions, 492 flow
[2025-03-13 22:25:31,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:31,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:31,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions.
[2025-03-13 22:25:31,751 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9262187088274044
[2025-03-13 22:25:31,751 INFO  L175             Difference]: Start difference. First operand has 209 places, 206 transitions, 452 flow. Second operand 3 states and 703 transitions.
[2025-03-13 22:25:31,751 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 207 transitions, 492 flow
[2025-03-13 22:25:31,752 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 207 transitions, 482 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-03-13 22:25:31,755 INFO  L231             Difference]: Finished difference. Result has 205 places, 205 transitions, 444 flow
[2025-03-13 22:25:31,757 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=205, PETRI_TRANSITIONS=205}
[2025-03-13 22:25:31,757 INFO  L279   CegarLoopForPetriNet]: 225 programPoint places, -20 predicate places.
[2025-03-13 22:25:31,757 INFO  L471      AbstractCegarLoop]: Abstraction has has 205 places, 205 transitions, 444 flow
[2025-03-13 22:25:31,758 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 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-13 22:25:31,758 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:31,758 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:31,758 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-13 22:25:31,758 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2025-03-13 22:25:31,760 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:31,760 INFO  L85        PathProgramCache]: Analyzing trace with hash -1210189624, now seen corresponding path program 1 times
[2025-03-13 22:25:31,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:31,760 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917822864]
[2025-03-13 22:25:31,760 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:31,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:31,771 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-03-13 22:25:31,777 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-03-13 22:25:31,778 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:31,779 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:31,810 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-13 22:25:31,812 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:31,812 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917822864]
[2025-03-13 22:25:31,812 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917822864] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:31,812 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:31,812 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:31,812 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824142220]
[2025-03-13 22:25:31,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:31,813 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:31,813 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:31,813 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:31,813 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:31,820 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 231 out of 253
[2025-03-13 22:25:31,821 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 205 transitions, 444 flow. Second operand  has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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-13 22:25:31,821 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:31,822 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 253
[2025-03-13 22:25:31,822 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:31,878 INFO  L124   PetriNetUnfolderBase]: 46/579 cut-off events.
[2025-03-13 22:25:31,878 INFO  L125   PetriNetUnfolderBase]: For 50/72 co-relation queries the response was YES.
[2025-03-13 22:25:31,880 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 710 conditions, 579 events. 46/579 cut-off events. For 50/72 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1633 event pairs, 4 based on Foata normal form. 2/520 useless extension candidates. Maximal degree in co-relation 671. Up to 41 conditions per place. 
[2025-03-13 22:25:31,881 INFO  L140   encePairwiseOnDemand]: 250/253 looper letters, 15 selfloop transitions, 2 changer transitions 2/210 dead transitions.
[2025-03-13 22:25:31,881 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 210 transitions, 503 flow
[2025-03-13 22:25:31,882 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:31,882 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:31,883 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions.
[2025-03-13 22:25:31,883 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9341238471673254
[2025-03-13 22:25:31,883 INFO  L175             Difference]: Start difference. First operand has 205 places, 205 transitions, 444 flow. Second operand 3 states and 709 transitions.
[2025-03-13 22:25:31,883 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 210 transitions, 503 flow
[2025-03-13 22:25:31,886 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 210 transitions, 497 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:31,888 INFO  L231             Difference]: Finished difference. Result has 205 places, 205 transitions, 448 flow
[2025-03-13 22:25:31,888 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=205, PETRI_TRANSITIONS=205}
[2025-03-13 22:25:31,888 INFO  L279   CegarLoopForPetriNet]: 225 programPoint places, -20 predicate places.
[2025-03-13 22:25:31,888 INFO  L471      AbstractCegarLoop]: Abstraction has has 205 places, 205 transitions, 448 flow
[2025-03-13 22:25:31,890 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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-13 22:25:31,890 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:31,890 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:31,890 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-13 22:25:31,890 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2025-03-13 22:25:31,891 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:31,891 INFO  L85        PathProgramCache]: Analyzing trace with hash 755111970, now seen corresponding path program 1 times
[2025-03-13 22:25:31,891 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:31,891 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210598440]
[2025-03-13 22:25:31,891 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:31,891 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:31,902 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes.
[2025-03-13 22:25:31,909 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements.
[2025-03-13 22:25:31,909 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:31,909 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:31,935 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-03-13 22:25:31,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:31,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210598440]
[2025-03-13 22:25:31,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210598440] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:31,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:31,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:31,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432369253]
[2025-03-13 22:25:31,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:31,936 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:31,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:31,936 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:31,936 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:31,956 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 227 out of 253
[2025-03-13 22:25:31,957 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 205 transitions, 448 flow. Second operand  has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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-13 22:25:31,958 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:31,958 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 253
[2025-03-13 22:25:31,958 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:32,011 INFO  L124   PetriNetUnfolderBase]: 50/581 cut-off events.
[2025-03-13 22:25:32,011 INFO  L125   PetriNetUnfolderBase]: For 52/66 co-relation queries the response was YES.
[2025-03-13 22:25:32,013 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 725 conditions, 581 events. 50/581 cut-off events. For 52/66 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1623 event pairs, 4 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 685. Up to 58 conditions per place. 
[2025-03-13 22:25:32,014 INFO  L140   encePairwiseOnDemand]: 250/253 looper letters, 0 selfloop transitions, 0 changer transitions 206/206 dead transitions.
[2025-03-13 22:25:32,014 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 206 transitions, 488 flow
[2025-03-13 22:25:32,014 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:32,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:32,015 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 697 transitions.
[2025-03-13 22:25:32,016 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9183135704874835
[2025-03-13 22:25:32,016 INFO  L175             Difference]: Start difference. First operand has 205 places, 205 transitions, 448 flow. Second operand 3 states and 697 transitions.
[2025-03-13 22:25:32,016 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 206 transitions, 488 flow
[2025-03-13 22:25:32,017 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 206 transitions, 486 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:32,019 INFO  L231             Difference]: Finished difference. Result has 205 places, 0 transitions, 0 flow
[2025-03-13 22:25:32,019 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=205, PETRI_TRANSITIONS=0}
[2025-03-13 22:25:32,019 INFO  L279   CegarLoopForPetriNet]: 225 programPoint places, -20 predicate places.
[2025-03-13 22:25:32,019 INFO  L471      AbstractCegarLoop]: Abstraction has has 205 places, 0 transitions, 0 flow
[2025-03-13 22:25:32,020 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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-13 22:25:32,022 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (31 of 32 remaining)
[2025-03-13 22:25:32,022 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (30 of 32 remaining)
[2025-03-13 22:25:32,022 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (29 of 32 remaining)
[2025-03-13 22:25:32,023 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 32 remaining)
[2025-03-13 22:25:32,023 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 32 remaining)
[2025-03-13 22:25:32,023 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 32 remaining)
[2025-03-13 22:25:32,023 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (25 of 32 remaining)
[2025-03-13 22:25:32,023 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (24 of 32 remaining)
[2025-03-13 22:25:32,023 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 32 remaining)
[2025-03-13 22:25:32,023 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (22 of 32 remaining)
[2025-03-13 22:25:32,023 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 32 remaining)
[2025-03-13 22:25:32,023 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 32 remaining)
[2025-03-13 22:25:32,023 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 32 remaining)
[2025-03-13 22:25:32,023 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 32 remaining)
[2025-03-13 22:25:32,023 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 32 remaining)
[2025-03-13 22:25:32,023 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 32 remaining)
[2025-03-13 22:25:32,023 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 32 remaining)
[2025-03-13 22:25:32,023 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 32 remaining)
[2025-03-13 22:25:32,024 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 32 remaining)
[2025-03-13 22:25:32,024 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 32 remaining)
[2025-03-13 22:25:32,024 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (11 of 32 remaining)
[2025-03-13 22:25:32,024 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (10 of 32 remaining)
[2025-03-13 22:25:32,024 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (9 of 32 remaining)
[2025-03-13 22:25:32,024 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (8 of 32 remaining)
[2025-03-13 22:25:32,024 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (7 of 32 remaining)
[2025-03-13 22:25:32,024 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (6 of 32 remaining)
[2025-03-13 22:25:32,024 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (5 of 32 remaining)
[2025-03-13 22:25:32,024 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 32 remaining)
[2025-03-13 22:25:32,024 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (3 of 32 remaining)
[2025-03-13 22:25:32,024 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (2 of 32 remaining)
[2025-03-13 22:25:32,024 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (1 of 32 remaining)
[2025-03-13 22:25:32,024 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (0 of 32 remaining)
[2025-03-13 22:25:32,025 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-13 22:25:32,025 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:32,028 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-03-13 22:25:32,029 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-13 22:25:32,032 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:25:32 BasicIcfg
[2025-03-13 22:25:32,033 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-13 22:25:32,033 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-13 22:25:32,033 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-13 22:25:32,033 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-13 22:25:32,034 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:28" (3/4) ...
[2025-03-13 22:25:32,035 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-13 22:25:32,037 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread1
[2025-03-13 22:25:32,037 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread2
[2025-03-13 22:25:32,039 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges
[2025-03-13 22:25:32,039 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-13 22:25:32,039 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges
[2025-03-13 22:25:32,040 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-13 22:25:32,101 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-13 22:25:32,102 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-13 22:25:32,102 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-13 22:25:32,102 INFO  L158              Benchmark]: Toolchain (without parser) took 4668.79ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 111.4MB in the beginning and 192.1MB in the end (delta: -80.7MB). Peak memory consumption was 129.8MB. Max. memory is 16.1GB.
[2025-03-13 22:25:32,103 INFO  L158              Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-13 22:25:32,103 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 198.69ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 99.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-13 22:25:32,103 INFO  L158              Benchmark]: Boogie Procedure Inliner took 33.03ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-13 22:25:32,103 INFO  L158              Benchmark]: Boogie Preprocessor took 20.28ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-13 22:25:32,104 INFO  L158              Benchmark]: IcfgBuilder took 471.56ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 71.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-13 22:25:32,105 INFO  L158              Benchmark]: TraceAbstraction took 3871.16ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 71.0MB in the beginning and 69.8MB in the end (delta: 1.2MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB.
[2025-03-13 22:25:32,105 INFO  L158              Benchmark]: Witness Printer took 68.73ms. Allocated memory is still 226.5MB. Free memory was 69.8MB in the beginning and 192.1MB in the end (delta: -122.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-13 22:25:32,106 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 198.69ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 99.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 33.03ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 20.28ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 471.56ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 71.5MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 3871.16ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 71.0MB in the beginning and 69.8MB in the end (delta: 1.2MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB.
 * Witness Printer took 68.73ms. Allocated memory is still 226.5MB. Free memory was 69.8MB in the beginning and 192.1MB in the end (delta: -122.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 47]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 48]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 48]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 48]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 50]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 50]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 50]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 59]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 61]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 64]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 61]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 64]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 78]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 79]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 99]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 79]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 87]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 87]: there are no data races
    For all program executions holds that there are no data races at this location
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 5 procedures, 357 locations, 32 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 535 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 255 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 947 IncrementalHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 28 mSDtfsCounter, 947 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=474occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1067 NumberOfCodeBlocks, 1067 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1055 ConstructedInterpolants, 0 QuantifiedInterpolants, 1512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    18 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-03-13 22:25:32,122 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE