./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-ring-nondet.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-bad-ring-nondet.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 01186d000498d57447d1d7ea86dd893215c56febea2169abeb96f12030a58ea4
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-f8ab0bd-m
[2025-03-13 22:25:22,264 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-13 22:25:22,327 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:22,335 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-13 22:25:22,335 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-13 22:25:22,358 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-13 22:25:22,360 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-13 22:25:22,360 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-13 22:25:22,361 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-13 22:25:22,361 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-13 22:25:22,362 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-13 22:25:22,362 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-13 22:25:22,362 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-13 22:25:22,362 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-13 22:25:22,362 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-13 22:25:22,362 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-13 22:25:22,363 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-13 22:25:22,363 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-13 22:25:22,363 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-13 22:25:22,363 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-13 22:25:22,363 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-13 22:25:22,363 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-13 22:25:22,363 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2025-03-13 22:25:22,364 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-03-13 22:25:22,364 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-13 22:25:22,364 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-13 22:25:22,364 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-13 22:25:22,364 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-13 22:25:22,364 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-13 22:25:22,364 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-13 22:25:22,364 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-13 22:25:22,364 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-13 22:25:22,365 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-13 22:25:22,365 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-13 22:25:22,365 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-13 22:25:22,365 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-13 22:25:22,365 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-13 22:25:22,366 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-13 22:25:22,366 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-13 22:25:22,366 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-13 22:25:22,366 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-13 22:25:22,366 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-13 22:25:22,366 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 -> 01186d000498d57447d1d7ea86dd893215c56febea2169abeb96f12030a58ea4
[2025-03-13 22:25:22,609 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-13 22:25:22,617 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-13 22:25:22,619 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-13 22:25:22,620 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-13 22:25:22,621 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-13 22:25:22,622 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c
[2025-03-13 22:25:23,840 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2aa60ba0/27317211fa4a4cdc96cbdfaec2e337fe/FLAG17c7fe5e9
[2025-03-13 22:25:24,149 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-13 22:25:24,150 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c
[2025-03-13 22:25:24,157 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2aa60ba0/27317211fa4a4cdc96cbdfaec2e337fe/FLAG17c7fe5e9
[2025-03-13 22:25:24,438 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2aa60ba0/27317211fa4a4cdc96cbdfaec2e337fe
[2025-03-13 22:25:24,440 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-13 22:25:24,441 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-13 22:25:24,446 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-13 22:25:24,446 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-13 22:25:24,449 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-13 22:25:24,450 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:24" (1/1) ...
[2025-03-13 22:25:24,451 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263c013a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:24, skipping insertion in model container
[2025-03-13 22:25:24,451 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:24" (1/1) ...
[2025-03-13 22:25:24,464 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-13 22:25:24,611 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-13 22:25:24,618 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-13 22:25:24,644 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-13 22:25:24,656 INFO  L204         MainTranslator]: Completed translation
[2025-03-13 22:25:24,656 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:24 WrapperNode
[2025-03-13 22:25:24,656 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-13 22:25:24,657 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-13 22:25:24,657 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-13 22:25:24,659 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-13 22:25:24,664 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:24" (1/1) ...
[2025-03-13 22:25:24,672 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:24" (1/1) ...
[2025-03-13 22:25:24,710 INFO  L138                Inliner]: procedures = 24, calls = 49, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 597
[2025-03-13 22:25:24,711 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-13 22:25:24,711 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-13 22:25:24,711 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-13 22:25:24,711 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-13 22:25:24,719 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:24" (1/1) ...
[2025-03-13 22:25:24,720 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:24" (1/1) ...
[2025-03-13 22:25:24,729 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:24" (1/1) ...
[2025-03-13 22:25:24,729 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:24" (1/1) ...
[2025-03-13 22:25:24,752 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:24" (1/1) ...
[2025-03-13 22:25:24,754 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:24" (1/1) ...
[2025-03-13 22:25:24,756 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:24" (1/1) ...
[2025-03-13 22:25:24,759 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:24" (1/1) ...
[2025-03-13 22:25:24,763 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-13 22:25:24,764 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-13 22:25:24,764 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-13 22:25:24,764 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-13 22:25:24,764 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:24" (1/1) ...
[2025-03-13 22:25:24,770 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-13 22:25:24,781 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-13 22:25:24,800 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:24,811 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:24,831 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-13 22:25:24,832 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2025-03-13 22:25:24,832 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2025-03-13 22:25:24,832 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2025-03-13 22:25:24,832 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2025-03-13 22:25:24,832 INFO  L130     BoogieDeclarations]: Found specification of procedure thread3
[2025-03-13 22:25:24,832 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread3
[2025-03-13 22:25:24,832 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-03-13 22:25:24,832 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2025-03-13 22:25:24,832 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2025-03-13 22:25:24,832 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2025-03-13 22:25:24,832 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2025-03-13 22:25:24,832 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-13 22:25:24,832 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-13 22:25:24,832 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2025-03-13 22:25:24,835 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:24,961 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-13 22:25:24,962 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-13 22:25:25,755 INFO  L303             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-03-13 22:25:25,755 INFO  L313             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-13 22:25:25,756 INFO  L318             CfgBuilder]: Performing block encoding
[2025-03-13 22:25:26,185 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-13 22:25:26,190 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:26 BoogieIcfgContainer
[2025-03-13 22:25:26,190 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-13 22:25:26,191 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-13 22:25:26,191 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-13 22:25:26,195 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-13 22:25:26,195 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:25:24" (1/3) ...
[2025-03-13 22:25:26,196 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a169fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:26, skipping insertion in model container
[2025-03-13 22:25:26,197 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:24" (2/3) ...
[2025-03-13 22:25:26,197 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a169fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:26, skipping insertion in model container
[2025-03-13 22:25:26,198 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:26" (3/3) ...
[2025-03-13 22:25:26,199 INFO  L128   eAbstractionObserver]: Analyzing ICFG popl20-bad-ring-nondet.wvr.c
[2025-03-13 22:25:26,213 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-13 22:25:26,214 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-ring-nondet.wvr.c that has 4 procedures, 460 locations, 1 initial locations, 6 loop locations, and 90 error locations.
[2025-03-13 22:25:26,216 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-03-13 22:25:26,342 INFO  L143    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2025-03-13 22:25:26,377 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 469 places, 480 transitions, 981 flow
[2025-03-13 22:25:26,526 INFO  L124   PetriNetUnfolderBase]: 21/477 cut-off events.
[2025-03-13 22:25:26,528 INFO  L125   PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2025-03-13 22:25:26,534 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 490 conditions, 477 events. 21/477 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 825 event pairs, 0 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 427. Up to 3 conditions per place. 
[2025-03-13 22:25:26,535 INFO  L82        GeneralOperation]: Start removeDead. Operand has 469 places, 480 transitions, 981 flow
[2025-03-13 22:25:26,541 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 450 places, 460 transitions, 938 flow
[2025-03-13 22:25:26,547 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-13 22:25:26,562 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;@3a9f67d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-13 22:25:26,562 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 159 error locations.
[2025-03-13 22:25:26,567 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-03-13 22:25:26,568 INFO  L124   PetriNetUnfolderBase]: 0/31 cut-off events.
[2025-03-13 22:25:26,568 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-13 22:25:26,568 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:26,569 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:26,569 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:26,573 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:26,573 INFO  L85        PathProgramCache]: Analyzing trace with hash -566216227, now seen corresponding path program 1 times
[2025-03-13 22:25:26,579 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:26,580 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20333649]
[2025-03-13 22:25:26,580 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:26,582 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:26,643 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-03-13 22:25:26,652 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-03-13 22:25:26,653 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:26,653 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:26,722 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:26,723 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:26,723 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20333649]
[2025-03-13 22:25:26,725 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20333649] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:26,725 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:26,725 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:26,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044585862]
[2025-03-13 22:25:26,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:26,732 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:26,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:26,749 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:26,750 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:26,775 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 386 out of 480
[2025-03-13 22:25:26,779 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 460 transitions, 938 flow. Second operand  has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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:26,779 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:26,779 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 480
[2025-03-13 22:25:26,782 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:27,052 INFO  L124   PetriNetUnfolderBase]: 152/786 cut-off events.
[2025-03-13 22:25:27,053 INFO  L125   PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES.
[2025-03-13 22:25:27,057 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 786 events. 152/786 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2910 event pairs, 92 based on Foata normal form. 18/700 useless extension candidates. Maximal degree in co-relation 676. Up to 219 conditions per place. 
[2025-03-13 22:25:27,063 INFO  L140   encePairwiseOnDemand]: 408/480 looper letters, 19 selfloop transitions, 2 changer transitions 7/390 dead transitions.
[2025-03-13 22:25:27,063 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 390 transitions, 840 flow
[2025-03-13 22:25:27,064 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:27,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:27,076 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1249 transitions.
[2025-03-13 22:25:27,080 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8673611111111111
[2025-03-13 22:25:27,082 INFO  L175             Difference]: Start difference. First operand has 450 places, 460 transitions, 938 flow. Second operand 3 states and 1249 transitions.
[2025-03-13 22:25:27,082 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 390 transitions, 840 flow
[2025-03-13 22:25:27,090 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 390 transitions, 828 flow, removed 0 selfloop flow, removed 6 redundant places.
[2025-03-13 22:25:27,100 INFO  L231             Difference]: Finished difference. Result has 387 places, 383 transitions, 776 flow
[2025-03-13 22:25:27,104 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=387, PETRI_TRANSITIONS=383}
[2025-03-13 22:25:27,107 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -63 predicate places.
[2025-03-13 22:25:27,108 INFO  L471      AbstractCegarLoop]: Abstraction has has 387 places, 383 transitions, 776 flow
[2025-03-13 22:25:27,109 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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:27,109 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:27,109 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]
[2025-03-13 22:25:27,109 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-13 22:25:27,110 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:27,110 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:27,111 INFO  L85        PathProgramCache]: Analyzing trace with hash 1373957760, now seen corresponding path program 1 times
[2025-03-13 22:25:27,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:27,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682303606]
[2025-03-13 22:25:27,111 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:27,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:27,126 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-03-13 22:25:27,131 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-03-13 22:25:27,132 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:27,132 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:27,156 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:27,156 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:27,156 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682303606]
[2025-03-13 22:25:27,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682303606] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:27,156 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:27,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:27,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300817748]
[2025-03-13 22:25:27,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:27,157 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:27,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:27,158 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:27,158 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:27,179 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 386 out of 480
[2025-03-13 22:25:27,181 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 383 transitions, 776 flow. Second operand  has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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:27,181 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:27,181 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 480
[2025-03-13 22:25:27,181 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:27,352 INFO  L124   PetriNetUnfolderBase]: 152/778 cut-off events.
[2025-03-13 22:25:27,353 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2025-03-13 22:25:27,355 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 778 events. 152/778 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3126 event pairs, 92 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 985. Up to 219 conditions per place. 
[2025-03-13 22:25:27,358 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 19 selfloop transitions, 2 changer transitions 0/382 dead transitions.
[2025-03-13 22:25:27,358 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 382 transitions, 816 flow
[2025-03-13 22:25:27,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:27,359 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:27,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1180 transitions.
[2025-03-13 22:25:27,361 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8194444444444444
[2025-03-13 22:25:27,361 INFO  L175             Difference]: Start difference. First operand has 387 places, 383 transitions, 776 flow. Second operand 3 states and 1180 transitions.
[2025-03-13 22:25:27,362 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 382 transitions, 816 flow
[2025-03-13 22:25:27,370 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 382 transitions, 812 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:27,374 INFO  L231             Difference]: Finished difference. Result has 379 places, 382 transitions, 774 flow
[2025-03-13 22:25:27,375 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=379, PETRI_TRANSITIONS=382}
[2025-03-13 22:25:27,375 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -71 predicate places.
[2025-03-13 22:25:27,375 INFO  L471      AbstractCegarLoop]: Abstraction has has 379 places, 382 transitions, 774 flow
[2025-03-13 22:25:27,376 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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:27,376 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:27,376 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]
[2025-03-13 22:25:27,376 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-13 22:25:27,377 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:27,377 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:27,377 INFO  L85        PathProgramCache]: Analyzing trace with hash -882647655, now seen corresponding path program 1 times
[2025-03-13 22:25:27,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:27,378 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900821618]
[2025-03-13 22:25:27,378 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:27,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:27,386 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes.
[2025-03-13 22:25:27,391 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements.
[2025-03-13 22:25:27,391 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:27,391 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:27,449 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:27,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:27,449 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900821618]
[2025-03-13 22:25:27,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900821618] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:27,449 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:27,449 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:27,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172766359]
[2025-03-13 22:25:27,449 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:27,450 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:27,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:27,450 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:27,450 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:27,477 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 387 out of 480
[2025-03-13 22:25:27,479 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 774 flow. Second operand  has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:27,479 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:27,479 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 480
[2025-03-13 22:25:27,479 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:27,638 INFO  L124   PetriNetUnfolderBase]: 127/699 cut-off events.
[2025-03-13 22:25:27,638 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2025-03-13 22:25:27,640 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 905 conditions, 699 events. 127/699 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2386 event pairs, 74 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 858. Up to 183 conditions per place. 
[2025-03-13 22:25:27,642 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 18 selfloop transitions, 2 changer transitions 0/381 dead transitions.
[2025-03-13 22:25:27,642 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 381 transitions, 812 flow
[2025-03-13 22:25:27,642 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:27,642 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:27,644 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions.
[2025-03-13 22:25:27,644 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8208333333333333
[2025-03-13 22:25:27,644 INFO  L175             Difference]: Start difference. First operand has 379 places, 382 transitions, 774 flow. Second operand 3 states and 1182 transitions.
[2025-03-13 22:25:27,644 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 381 transitions, 812 flow
[2025-03-13 22:25:27,646 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 381 transitions, 808 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:27,649 INFO  L231             Difference]: Finished difference. Result has 378 places, 381 transitions, 772 flow
[2025-03-13 22:25:27,649 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=378, PETRI_TRANSITIONS=381}
[2025-03-13 22:25:27,650 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -72 predicate places.
[2025-03-13 22:25:27,650 INFO  L471      AbstractCegarLoop]: Abstraction has has 378 places, 381 transitions, 772 flow
[2025-03-13 22:25:27,650 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:27,650 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:27,651 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]
[2025-03-13 22:25:27,651 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-13 22:25:27,651 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:27,651 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:27,651 INFO  L85        PathProgramCache]: Analyzing trace with hash 350209437, now seen corresponding path program 1 times
[2025-03-13 22:25:27,651 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:27,651 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813495534]
[2025-03-13 22:25:27,651 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:27,652 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:27,661 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes.
[2025-03-13 22:25:27,669 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements.
[2025-03-13 22:25:27,670 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:27,670 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:27,709 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:27,709 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:27,709 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813495534]
[2025-03-13 22:25:27,709 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813495534] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:27,710 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:27,710 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:27,710 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801852426]
[2025-03-13 22:25:27,710 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:27,710 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:27,710 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:27,710 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:27,711 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:27,724 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 387 out of 480
[2025-03-13 22:25:27,725 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 381 transitions, 772 flow. Second operand  has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:27,725 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:27,725 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 480
[2025-03-13 22:25:27,725 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:27,831 INFO  L124   PetriNetUnfolderBase]: 127/698 cut-off events.
[2025-03-13 22:25:27,831 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2025-03-13 22:25:27,835 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 904 conditions, 698 events. 127/698 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2396 event pairs, 74 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 849. Up to 183 conditions per place. 
[2025-03-13 22:25:27,837 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 18 selfloop transitions, 2 changer transitions 0/380 dead transitions.
[2025-03-13 22:25:27,837 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 380 transitions, 810 flow
[2025-03-13 22:25:27,838 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:27,838 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:27,839 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions.
[2025-03-13 22:25:27,840 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8208333333333333
[2025-03-13 22:25:27,840 INFO  L175             Difference]: Start difference. First operand has 378 places, 381 transitions, 772 flow. Second operand 3 states and 1182 transitions.
[2025-03-13 22:25:27,840 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 380 transitions, 810 flow
[2025-03-13 22:25:27,841 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 380 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:27,844 INFO  L231             Difference]: Finished difference. Result has 377 places, 380 transitions, 770 flow
[2025-03-13 22:25:27,845 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=377, PETRI_TRANSITIONS=380}
[2025-03-13 22:25:27,846 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -73 predicate places.
[2025-03-13 22:25:27,846 INFO  L471      AbstractCegarLoop]: Abstraction has has 377 places, 380 transitions, 770 flow
[2025-03-13 22:25:27,847 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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:27,847 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:27,847 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:27,847 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-13 22:25:27,847 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:27,848 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:27,848 INFO  L85        PathProgramCache]: Analyzing trace with hash 1898374336, now seen corresponding path program 1 times
[2025-03-13 22:25:27,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:27,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690414724]
[2025-03-13 22:25:27,848 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:27,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:27,857 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes.
[2025-03-13 22:25:27,866 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements.
[2025-03-13 22:25:27,866 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:27,866 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:27,912 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:27,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:27,912 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690414724]
[2025-03-13 22:25:27,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690414724] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:27,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:27,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:27,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812636358]
[2025-03-13 22:25:27,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:27,912 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:27,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:27,913 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:27,913 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:27,925 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 388 out of 480
[2025-03-13 22:25:27,926 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 380 transitions, 770 flow. Second operand  has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 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:27,926 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:27,926 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 480
[2025-03-13 22:25:27,926 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:28,084 INFO  L124   PetriNetUnfolderBase]: 211/958 cut-off events.
[2025-03-13 22:25:28,085 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2025-03-13 22:25:28,087 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 958 events. 211/958 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4349 event pairs, 109 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 1211. Up to 286 conditions per place. 
[2025-03-13 22:25:28,090 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 18 selfloop transitions, 1 changer transitions 0/378 dead transitions.
[2025-03-13 22:25:28,090 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 378 transitions, 804 flow
[2025-03-13 22:25:28,090 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:28,090 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:28,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions.
[2025-03-13 22:25:28,092 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8229166666666666
[2025-03-13 22:25:28,092 INFO  L175             Difference]: Start difference. First operand has 377 places, 380 transitions, 770 flow. Second operand 3 states and 1185 transitions.
[2025-03-13 22:25:28,094 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 378 transitions, 804 flow
[2025-03-13 22:25:28,096 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 378 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:28,099 INFO  L231             Difference]: Finished difference. Result has 375 places, 378 transitions, 764 flow
[2025-03-13 22:25:28,099 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=375, PETRI_TRANSITIONS=378}
[2025-03-13 22:25:28,100 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -75 predicate places.
[2025-03-13 22:25:28,101 INFO  L471      AbstractCegarLoop]: Abstraction has has 375 places, 378 transitions, 764 flow
[2025-03-13 22:25:28,102 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 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,102 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:28,102 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]
[2025-03-13 22:25:28,102 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-13 22:25:28,102 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:28,103 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:28,103 INFO  L85        PathProgramCache]: Analyzing trace with hash -233441299, now seen corresponding path program 1 times
[2025-03-13 22:25:28,103 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:28,103 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008939184]
[2025-03-13 22:25:28,103 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:28,103 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:28,118 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-03-13 22:25:28,147 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-03-13 22:25:28,147 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:28,147 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:28,620 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,621 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:28,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008939184]
[2025-03-13 22:25:28,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008939184] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:28,622 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:28,622 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-13 22:25:28,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127286957]
[2025-03-13 22:25:28,622 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:28,622 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-13 22:25:28,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:28,624 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-13 22:25:28,624 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-13 22:25:28,843 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 349 out of 480
[2025-03-13 22:25:28,846 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 378 transitions, 764 flow. Second operand  has 6 states, 6 states have (on average 350.5) internal successors, (2103), 6 states have internal predecessors, (2103), 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,846 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:28,846 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 480
[2025-03-13 22:25:28,846 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:29,024 INFO  L124   PetriNetUnfolderBase]: 244/1242 cut-off events.
[2025-03-13 22:25:29,024 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2025-03-13 22:25:29,026 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1637 conditions, 1242 events. 244/1242 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6078 event pairs, 128 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 1575. Up to 348 conditions per place. 
[2025-03-13 22:25:29,030 INFO  L140   encePairwiseOnDemand]: 462/480 looper letters, 42 selfloop transitions, 15 changer transitions 0/375 dead transitions.
[2025-03-13 22:25:29,031 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 375 transitions, 872 flow
[2025-03-13 22:25:29,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-13 22:25:29,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-13 22:25:29,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2154 transitions.
[2025-03-13 22:25:29,035 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.7479166666666667
[2025-03-13 22:25:29,035 INFO  L175             Difference]: Start difference. First operand has 375 places, 378 transitions, 764 flow. Second operand 6 states and 2154 transitions.
[2025-03-13 22:25:29,035 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 375 transitions, 872 flow
[2025-03-13 22:25:29,036 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 375 transitions, 871 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:29,039 INFO  L231             Difference]: Finished difference. Result has 376 places, 375 transitions, 787 flow
[2025-03-13 22:25:29,040 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=787, PETRI_PLACES=376, PETRI_TRANSITIONS=375}
[2025-03-13 22:25:29,040 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -74 predicate places.
[2025-03-13 22:25:29,040 INFO  L471      AbstractCegarLoop]: Abstraction has has 376 places, 375 transitions, 787 flow
[2025-03-13 22:25:29,041 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 350.5) internal successors, (2103), 6 states have internal predecessors, (2103), 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,041 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:29,042 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]
[2025-03-13 22:25:29,042 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-13 22:25:29,042 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:29,042 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:29,042 INFO  L85        PathProgramCache]: Analyzing trace with hash -820541248, now seen corresponding path program 1 times
[2025-03-13 22:25:29,042 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:29,042 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425907879]
[2025-03-13 22:25:29,042 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:29,042 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:29,051 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-03-13 22:25:29,056 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-03-13 22:25:29,057 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:29,057 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:29,083 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,083 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:29,083 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425907879]
[2025-03-13 22:25:29,083 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425907879] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:29,083 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:29,083 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:29,083 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669182833]
[2025-03-13 22:25:29,084 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:29,084 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:29,084 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:29,084 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:29,084 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:29,099 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 387 out of 480
[2025-03-13 22:25:29,100 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 375 transitions, 787 flow. Second operand  has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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,100 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:29,100 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 480
[2025-03-13 22:25:29,100 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:29,230 INFO  L124   PetriNetUnfolderBase]: 173/1213 cut-off events.
[2025-03-13 22:25:29,230 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2025-03-13 22:25:29,234 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1469 conditions, 1213 events. 173/1213 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6045 event pairs, 74 based on Foata normal form. 0/1001 useless extension candidates. Maximal degree in co-relation 1421. Up to 219 conditions per place. 
[2025-03-13 22:25:29,237 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 18 selfloop transitions, 2 changer transitions 0/374 dead transitions.
[2025-03-13 22:25:29,237 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 374 transitions, 825 flow
[2025-03-13 22:25:29,238 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:29,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:29,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions.
[2025-03-13 22:25:29,240 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8208333333333333
[2025-03-13 22:25:29,240 INFO  L175             Difference]: Start difference. First operand has 376 places, 375 transitions, 787 flow. Second operand 3 states and 1182 transitions.
[2025-03-13 22:25:29,240 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 374 transitions, 825 flow
[2025-03-13 22:25:29,242 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 374 transitions, 795 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-03-13 22:25:29,245 INFO  L231             Difference]: Finished difference. Result has 372 places, 374 transitions, 759 flow
[2025-03-13 22:25:29,245 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=372, PETRI_TRANSITIONS=374}
[2025-03-13 22:25:29,246 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -78 predicate places.
[2025-03-13 22:25:29,246 INFO  L471      AbstractCegarLoop]: Abstraction has has 372 places, 374 transitions, 759 flow
[2025-03-13 22:25:29,246 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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,246 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:29,247 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]
[2025-03-13 22:25:29,247 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-13 22:25:29,247 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:29,247 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:29,247 INFO  L85        PathProgramCache]: Analyzing trace with hash -177860368, now seen corresponding path program 1 times
[2025-03-13 22:25:29,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:29,247 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96098558]
[2025-03-13 22:25:29,247 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:29,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:29,258 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-03-13 22:25:29,265 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-03-13 22:25:29,265 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:29,265 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:29,291 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,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:29,291 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96098558]
[2025-03-13 22:25:29,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96098558] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:29,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:29,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:29,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778500390]
[2025-03-13 22:25:29,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:29,291 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:29,291 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:29,292 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:29,292 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:29,300 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480
[2025-03-13 22:25:29,302 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 374 transitions, 759 flow. Second operand  has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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,302 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:29,302 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480
[2025-03-13 22:25:29,302 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:29,415 INFO  L124   PetriNetUnfolderBase]: 151/731 cut-off events.
[2025-03-13 22:25:29,415 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2025-03-13 22:25:29,417 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 956 conditions, 731 events. 151/731 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2480 event pairs, 73 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 893. Up to 202 conditions per place. 
[2025-03-13 22:25:29,422 INFO  L140   encePairwiseOnDemand]: 478/480 looper letters, 16 selfloop transitions, 1 changer transitions 0/373 dead transitions.
[2025-03-13 22:25:29,422 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 373 transitions, 791 flow
[2025-03-13 22:25:29,423 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:29,423 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:29,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1191 transitions.
[2025-03-13 22:25:29,425 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8270833333333333
[2025-03-13 22:25:29,425 INFO  L175             Difference]: Start difference. First operand has 372 places, 374 transitions, 759 flow. Second operand 3 states and 1191 transitions.
[2025-03-13 22:25:29,425 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 373 transitions, 791 flow
[2025-03-13 22:25:29,428 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 373 transitions, 787 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:29,431 INFO  L231             Difference]: Finished difference. Result has 371 places, 373 transitions, 755 flow
[2025-03-13 22:25:29,431 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=371, PETRI_TRANSITIONS=373}
[2025-03-13 22:25:29,432 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -79 predicate places.
[2025-03-13 22:25:29,432 INFO  L471      AbstractCegarLoop]: Abstraction has has 371 places, 373 transitions, 755 flow
[2025-03-13 22:25:29,432 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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,432 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:29,433 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:29,433 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-13 22:25:29,433 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:29,433 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:29,433 INFO  L85        PathProgramCache]: Analyzing trace with hash -1420555873, now seen corresponding path program 1 times
[2025-03-13 22:25:29,435 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:29,435 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538122878]
[2025-03-13 22:25:29,435 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:29,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:29,447 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-03-13 22:25:29,452 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-03-13 22:25:29,452 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:29,452 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:29,481 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,481 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:29,481 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538122878]
[2025-03-13 22:25:29,482 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538122878] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:29,482 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:29,482 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:29,482 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091279494]
[2025-03-13 22:25:29,482 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:29,482 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:29,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:29,482 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:29,483 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:29,490 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 388 out of 480
[2025-03-13 22:25:29,491 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 373 transitions, 755 flow. Second operand  has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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,491 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:29,491 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 480
[2025-03-13 22:25:29,491 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:29,610 INFO  L124   PetriNetUnfolderBase]: 151/730 cut-off events.
[2025-03-13 22:25:29,610 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2025-03-13 22:25:29,613 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 956 conditions, 730 events. 151/730 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2475 event pairs, 73 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 893. Up to 204 conditions per place. 
[2025-03-13 22:25:29,615 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 17 selfloop transitions, 2 changer transitions 0/372 dead transitions.
[2025-03-13 22:25:29,615 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 372 transitions, 791 flow
[2025-03-13 22:25:29,615 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:29,616 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:29,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions.
[2025-03-13 22:25:29,618 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8222222222222222
[2025-03-13 22:25:29,618 INFO  L175             Difference]: Start difference. First operand has 371 places, 373 transitions, 755 flow. Second operand 3 states and 1184 transitions.
[2025-03-13 22:25:29,618 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 372 transitions, 791 flow
[2025-03-13 22:25:29,619 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 372 transitions, 790 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:29,622 INFO  L231             Difference]: Finished difference. Result has 371 places, 372 transitions, 756 flow
[2025-03-13 22:25:29,623 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=371, PETRI_TRANSITIONS=372}
[2025-03-13 22:25:29,623 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -79 predicate places.
[2025-03-13 22:25:29,623 INFO  L471      AbstractCegarLoop]: Abstraction has has 371 places, 372 transitions, 756 flow
[2025-03-13 22:25:29,624 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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,624 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:29,624 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]
[2025-03-13 22:25:29,624 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-13 22:25:29,624 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:29,625 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:29,625 INFO  L85        PathProgramCache]: Analyzing trace with hash 1814180489, now seen corresponding path program 1 times
[2025-03-13 22:25:29,625 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:29,625 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858662280]
[2025-03-13 22:25:29,625 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:29,625 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:29,632 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes.
[2025-03-13 22:25:29,636 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements.
[2025-03-13 22:25:29,637 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:29,637 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:29,663 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,663 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:29,663 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858662280]
[2025-03-13 22:25:29,663 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858662280] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:29,663 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:29,663 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:29,663 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259128218]
[2025-03-13 22:25:29,664 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:29,665 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:29,665 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:29,665 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:29,665 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:29,672 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480
[2025-03-13 22:25:29,673 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 372 transitions, 756 flow. Second operand  has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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,674 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:29,674 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480
[2025-03-13 22:25:29,674 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:29,755 INFO  L124   PetriNetUnfolderBase]: 151/729 cut-off events.
[2025-03-13 22:25:29,756 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2025-03-13 22:25:29,758 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 955 conditions, 729 events. 151/729 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2472 event pairs, 73 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 892. Up to 202 conditions per place. 
[2025-03-13 22:25:29,760 INFO  L140   encePairwiseOnDemand]: 478/480 looper letters, 16 selfloop transitions, 1 changer transitions 0/371 dead transitions.
[2025-03-13 22:25:29,760 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 371 transitions, 788 flow
[2025-03-13 22:25:29,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:29,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:29,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1191 transitions.
[2025-03-13 22:25:29,763 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8270833333333333
[2025-03-13 22:25:29,763 INFO  L175             Difference]: Start difference. First operand has 371 places, 372 transitions, 756 flow. Second operand 3 states and 1191 transitions.
[2025-03-13 22:25:29,763 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 371 transitions, 788 flow
[2025-03-13 22:25:29,764 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 371 transitions, 784 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:29,767 INFO  L231             Difference]: Finished difference. Result has 370 places, 371 transitions, 752 flow
[2025-03-13 22:25:29,768 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=370, PETRI_TRANSITIONS=371}
[2025-03-13 22:25:29,769 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -80 predicate places.
[2025-03-13 22:25:29,769 INFO  L471      AbstractCegarLoop]: Abstraction has has 370 places, 371 transitions, 752 flow
[2025-03-13 22:25:29,770 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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,770 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:29,770 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:29,770 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-13 22:25:29,770 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:29,771 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:29,771 INFO  L85        PathProgramCache]: Analyzing trace with hash -1778374903, now seen corresponding path program 1 times
[2025-03-13 22:25:29,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:29,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455806747]
[2025-03-13 22:25:29,771 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:29,772 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:29,780 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes.
[2025-03-13 22:25:29,789 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements.
[2025-03-13 22:25:29,790 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:29,790 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:29,845 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,845 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:29,845 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455806747]
[2025-03-13 22:25:29,845 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455806747] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:29,845 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:29,845 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:29,845 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412351035]
[2025-03-13 22:25:29,845 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:29,846 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:29,846 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:29,846 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:29,846 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:29,852 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 388 out of 480
[2025-03-13 22:25:29,854 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 371 transitions, 752 flow. Second operand  has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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,854 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:29,854 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 480
[2025-03-13 22:25:29,854 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:29,944 INFO  L124   PetriNetUnfolderBase]: 151/728 cut-off events.
[2025-03-13 22:25:29,944 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2025-03-13 22:25:29,946 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 955 conditions, 728 events. 151/728 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2465 event pairs, 73 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 892. Up to 204 conditions per place. 
[2025-03-13 22:25:29,948 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 17 selfloop transitions, 2 changer transitions 0/370 dead transitions.
[2025-03-13 22:25:29,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 370 transitions, 788 flow
[2025-03-13 22:25:29,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:29,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:29,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions.
[2025-03-13 22:25:29,951 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8222222222222222
[2025-03-13 22:25:29,951 INFO  L175             Difference]: Start difference. First operand has 370 places, 371 transitions, 752 flow. Second operand 3 states and 1184 transitions.
[2025-03-13 22:25:29,951 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 370 transitions, 788 flow
[2025-03-13 22:25:29,952 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 370 transitions, 787 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:29,955 INFO  L231             Difference]: Finished difference. Result has 370 places, 370 transitions, 753 flow
[2025-03-13 22:25:29,955 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=753, PETRI_PLACES=370, PETRI_TRANSITIONS=370}
[2025-03-13 22:25:29,955 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -80 predicate places.
[2025-03-13 22:25:29,956 INFO  L471      AbstractCegarLoop]: Abstraction has has 370 places, 370 transitions, 753 flow
[2025-03-13 22:25:29,956 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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,956 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:29,957 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:29,957 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-13 22:25:29,957 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:29,957 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:29,957 INFO  L85        PathProgramCache]: Analyzing trace with hash -1943529984, now seen corresponding path program 1 times
[2025-03-13 22:25:29,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:29,958 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787141990]
[2025-03-13 22:25:29,958 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:29,958 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:29,967 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-03-13 22:25:29,973 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-03-13 22:25:29,974 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:29,974 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:30,006 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,007 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:30,007 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787141990]
[2025-03-13 22:25:30,007 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787141990] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:30,007 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:30,007 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:30,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714360007]
[2025-03-13 22:25:30,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:30,007 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:30,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:30,008 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:30,008 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:30,017 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 387 out of 480
[2025-03-13 22:25:30,018 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 370 transitions, 753 flow. Second operand  has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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,018 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:30,018 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 480
[2025-03-13 22:25:30,018 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:30,109 INFO  L124   PetriNetUnfolderBase]: 151/727 cut-off events.
[2025-03-13 22:25:30,109 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2025-03-13 22:25:30,111 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 957 conditions, 727 events. 151/727 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2463 event pairs, 73 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 894. Up to 205 conditions per place. 
[2025-03-13 22:25:30,113 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 18 selfloop transitions, 2 changer transitions 0/369 dead transitions.
[2025-03-13 22:25:30,113 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 369 transitions, 791 flow
[2025-03-13 22:25:30,113 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:30,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:30,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions.
[2025-03-13 22:25:30,115 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8208333333333333
[2025-03-13 22:25:30,115 INFO  L175             Difference]: Start difference. First operand has 370 places, 370 transitions, 753 flow. Second operand 3 states and 1182 transitions.
[2025-03-13 22:25:30,115 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 369 transitions, 791 flow
[2025-03-13 22:25:30,117 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 369 transitions, 787 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:30,119 INFO  L231             Difference]: Finished difference. Result has 369 places, 369 transitions, 751 flow
[2025-03-13 22:25:30,120 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=369, PETRI_TRANSITIONS=369}
[2025-03-13 22:25:30,120 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -81 predicate places.
[2025-03-13 22:25:30,120 INFO  L471      AbstractCegarLoop]: Abstraction has has 369 places, 369 transitions, 751 flow
[2025-03-13 22:25:30,121 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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,121 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:30,121 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:30,121 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-13 22:25:30,121 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:30,122 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:30,122 INFO  L85        PathProgramCache]: Analyzing trace with hash 738943908, now seen corresponding path program 1 times
[2025-03-13 22:25:30,122 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:30,122 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122114370]
[2025-03-13 22:25:30,122 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:30,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:30,133 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes.
[2025-03-13 22:25:30,137 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements.
[2025-03-13 22:25:30,138 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:30,138 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:30,168 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,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:30,169 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122114370]
[2025-03-13 22:25:30,170 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122114370] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:30,170 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:30,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:30,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025054261]
[2025-03-13 22:25:30,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:30,170 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:30,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:30,171 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:30,171 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:30,184 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 387 out of 480
[2025-03-13 22:25:30,185 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 369 transitions, 751 flow. Second operand  has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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,185 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:30,186 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 480
[2025-03-13 22:25:30,186 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:30,302 INFO  L124   PetriNetUnfolderBase]: 151/726 cut-off events.
[2025-03-13 22:25:30,302 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2025-03-13 22:25:30,303 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 956 conditions, 726 events. 151/726 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2461 event pairs, 73 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 893. Up to 205 conditions per place. 
[2025-03-13 22:25:30,305 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 18 selfloop transitions, 2 changer transitions 0/368 dead transitions.
[2025-03-13 22:25:30,305 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 368 transitions, 789 flow
[2025-03-13 22:25:30,306 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:30,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:30,307 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions.
[2025-03-13 22:25:30,308 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8208333333333333
[2025-03-13 22:25:30,308 INFO  L175             Difference]: Start difference. First operand has 369 places, 369 transitions, 751 flow. Second operand 3 states and 1182 transitions.
[2025-03-13 22:25:30,308 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 368 transitions, 789 flow
[2025-03-13 22:25:30,310 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 368 transitions, 785 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:30,312 INFO  L231             Difference]: Finished difference. Result has 368 places, 368 transitions, 749 flow
[2025-03-13 22:25:30,313 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=749, PETRI_PLACES=368, PETRI_TRANSITIONS=368}
[2025-03-13 22:25:30,313 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -82 predicate places.
[2025-03-13 22:25:30,313 INFO  L471      AbstractCegarLoop]: Abstraction has has 368 places, 368 transitions, 749 flow
[2025-03-13 22:25:30,314 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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,314 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:30,314 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-13 22:25:30,314 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-13 22:25:30,314 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:30,315 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:30,315 INFO  L85        PathProgramCache]: Analyzing trace with hash -1760991297, now seen corresponding path program 1 times
[2025-03-13 22:25:30,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:30,315 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568860221]
[2025-03-13 22:25:30,315 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:30,316 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:30,323 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes.
[2025-03-13 22:25:30,328 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements.
[2025-03-13 22:25:30,329 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:30,329 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:30,354 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,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:30,355 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568860221]
[2025-03-13 22:25:30,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568860221] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:30,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:30,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:30,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423571634]
[2025-03-13 22:25:30,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:30,355 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:30,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:30,356 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:30,356 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:30,365 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 387 out of 480
[2025-03-13 22:25:30,366 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 368 transitions, 749 flow. Second operand  has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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,366 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:30,366 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 480
[2025-03-13 22:25:30,366 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:30,463 INFO  L124   PetriNetUnfolderBase]: 151/725 cut-off events.
[2025-03-13 22:25:30,463 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2025-03-13 22:25:30,466 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 955 conditions, 725 events. 151/725 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2480 event pairs, 73 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 892. Up to 205 conditions per place. 
[2025-03-13 22:25:30,469 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 18 selfloop transitions, 2 changer transitions 0/367 dead transitions.
[2025-03-13 22:25:30,469 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 367 transitions, 787 flow
[2025-03-13 22:25:30,469 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:30,469 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:30,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions.
[2025-03-13 22:25:30,471 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8208333333333333
[2025-03-13 22:25:30,471 INFO  L175             Difference]: Start difference. First operand has 368 places, 368 transitions, 749 flow. Second operand 3 states and 1182 transitions.
[2025-03-13 22:25:30,471 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 367 transitions, 787 flow
[2025-03-13 22:25:30,473 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 367 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:30,476 INFO  L231             Difference]: Finished difference. Result has 367 places, 367 transitions, 747 flow
[2025-03-13 22:25:30,477 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=747, PETRI_PLACES=367, PETRI_TRANSITIONS=367}
[2025-03-13 22:25:30,478 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places.
[2025-03-13 22:25:30,478 INFO  L471      AbstractCegarLoop]: Abstraction has has 367 places, 367 transitions, 747 flow
[2025-03-13 22:25:30,479 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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,479 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:30,479 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,479 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-13 22:25:30,479 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:30,480 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:30,480 INFO  L85        PathProgramCache]: Analyzing trace with hash -1556130564, now seen corresponding path program 1 times
[2025-03-13 22:25:30,480 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:30,480 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343801986]
[2025-03-13 22:25:30,480 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:30,480 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:30,489 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes.
[2025-03-13 22:25:30,496 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements.
[2025-03-13 22:25:30,496 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:30,496 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:30,532 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,532 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:30,532 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343801986]
[2025-03-13 22:25:30,532 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343801986] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:30,532 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:30,532 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:30,532 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167516587]
[2025-03-13 22:25:30,532 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:30,533 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:30,533 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:30,533 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:30,533 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:30,539 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480
[2025-03-13 22:25:30,540 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 367 transitions, 747 flow. Second operand  has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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,540 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:30,540 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480
[2025-03-13 22:25:30,541 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:30,635 INFO  L124   PetriNetUnfolderBase]: 140/708 cut-off events.
[2025-03-13 22:25:30,635 INFO  L125   PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES.
[2025-03-13 22:25:30,637 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 929 conditions, 708 events. 140/708 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2378 event pairs, 13 based on Foata normal form. 0/627 useless extension candidates. Maximal degree in co-relation 867. Up to 147 conditions per place. 
[2025-03-13 22:25:30,639 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 24 selfloop transitions, 2 changer transitions 0/375 dead transitions.
[2025-03-13 22:25:30,640 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 375 transitions, 817 flow
[2025-03-13 22:25:30,642 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:30,642 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:30,643 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1200 transitions.
[2025-03-13 22:25:30,644 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8333333333333334
[2025-03-13 22:25:30,644 INFO  L175             Difference]: Start difference. First operand has 367 places, 367 transitions, 747 flow. Second operand 3 states and 1200 transitions.
[2025-03-13 22:25:30,644 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 375 transitions, 817 flow
[2025-03-13 22:25:30,645 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 375 transitions, 813 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:30,651 INFO  L231             Difference]: Finished difference. Result has 367 places, 367 transitions, 751 flow
[2025-03-13 22:25:30,651 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=367, PETRI_TRANSITIONS=367}
[2025-03-13 22:25:30,652 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places.
[2025-03-13 22:25:30,652 INFO  L471      AbstractCegarLoop]: Abstraction has has 367 places, 367 transitions, 751 flow
[2025-03-13 22:25:30,652 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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,652 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:30,653 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,653 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-13 22:25:30,653 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:30,653 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:30,653 INFO  L85        PathProgramCache]: Analyzing trace with hash -1670032689, now seen corresponding path program 1 times
[2025-03-13 22:25:30,654 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:30,654 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602203862]
[2025-03-13 22:25:30,654 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:30,654 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:30,666 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes.
[2025-03-13 22:25:30,672 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements.
[2025-03-13 22:25:30,672 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:30,673 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:30,706 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,706 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:30,706 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602203862]
[2025-03-13 22:25:30,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602203862] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:30,707 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:30,707 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:30,707 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732427344]
[2025-03-13 22:25:30,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:30,708 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:30,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:30,708 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:30,708 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:30,722 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 385 out of 480
[2025-03-13 22:25:30,724 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 367 transitions, 751 flow. Second operand  has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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,724 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:30,724 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 480
[2025-03-13 22:25:30,724 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:30,842 INFO  L124   PetriNetUnfolderBase]: 225/943 cut-off events.
[2025-03-13 22:25:30,843 INFO  L125   PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES.
[2025-03-13 22:25:30,844 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 943 events. 225/943 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4195 event pairs, 127 based on Foata normal form. 0/849 useless extension candidates. Maximal degree in co-relation 1327. Up to 318 conditions per place. 
[2025-03-13 22:25:30,847 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 21 selfloop transitions, 2 changer transitions 0/366 dead transitions.
[2025-03-13 22:25:30,848 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 366 transitions, 795 flow
[2025-03-13 22:25:30,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:30,848 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:30,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions.
[2025-03-13 22:25:30,850 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8180555555555555
[2025-03-13 22:25:30,850 INFO  L175             Difference]: Start difference. First operand has 367 places, 367 transitions, 751 flow. Second operand 3 states and 1178 transitions.
[2025-03-13 22:25:30,850 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 366 transitions, 795 flow
[2025-03-13 22:25:30,852 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 366 transitions, 793 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:30,854 INFO  L231             Difference]: Finished difference. Result has 367 places, 366 transitions, 751 flow
[2025-03-13 22:25:30,854 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=367, PETRI_TRANSITIONS=366}
[2025-03-13 22:25:30,855 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places.
[2025-03-13 22:25:30,855 INFO  L471      AbstractCegarLoop]: Abstraction has has 367 places, 366 transitions, 751 flow
[2025-03-13 22:25:30,856 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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,856 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:30,857 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,857 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-13 22:25:30,857 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:30,857 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:30,857 INFO  L85        PathProgramCache]: Analyzing trace with hash 958864959, now seen corresponding path program 1 times
[2025-03-13 22:25:30,858 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:30,858 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992188442]
[2025-03-13 22:25:30,858 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:30,858 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:30,867 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes.
[2025-03-13 22:25:30,873 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements.
[2025-03-13 22:25:30,874 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:30,874 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:30,902 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,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:30,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992188442]
[2025-03-13 22:25:30,904 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992188442] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:30,904 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:30,904 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:30,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136545029]
[2025-03-13 22:25:30,904 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:30,905 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:30,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:30,905 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:30,905 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:30,911 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480
[2025-03-13 22:25:30,912 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 366 transitions, 751 flow. Second operand  has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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,912 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:30,912 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480
[2025-03-13 22:25:30,912 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:31,035 INFO  L124   PetriNetUnfolderBase]: 152/737 cut-off events.
[2025-03-13 22:25:31,035 INFO  L125   PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES.
[2025-03-13 22:25:31,038 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 737 events. 152/737 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2530 event pairs, 27 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 951. Up to 125 conditions per place. 
[2025-03-13 22:25:31,041 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 26 selfloop transitions, 2 changer transitions 0/375 dead transitions.
[2025-03-13 22:25:31,042 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 375 transitions, 831 flow
[2025-03-13 22:25:31,042 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:31,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:31,044 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1200 transitions.
[2025-03-13 22:25:31,044 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8333333333333334
[2025-03-13 22:25:31,045 INFO  L175             Difference]: Start difference. First operand has 367 places, 366 transitions, 751 flow. Second operand 3 states and 1200 transitions.
[2025-03-13 22:25:31,045 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 375 transitions, 831 flow
[2025-03-13 22:25:31,048 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 375 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:31,051 INFO  L231             Difference]: Finished difference. Result has 367 places, 366 transitions, 755 flow
[2025-03-13 22:25:31,052 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=367, PETRI_TRANSITIONS=366}
[2025-03-13 22:25:31,053 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places.
[2025-03-13 22:25:31,053 INFO  L471      AbstractCegarLoop]: Abstraction has has 367 places, 366 transitions, 755 flow
[2025-03-13 22:25:31,054 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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: SelfDestructingSolverStorable16
[2025-03-13 22:25:31,055 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:31,056 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:31,057 INFO  L85        PathProgramCache]: Analyzing trace with hash -93097083, now seen corresponding path program 1 times
[2025-03-13 22:25:31,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:31,057 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870189668]
[2025-03-13 22:25:31,057 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:31,057 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:31,070 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-13 22:25:31,079 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-13 22:25:31,079 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:31,079 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:31,113 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,113 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:31,113 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870189668]
[2025-03-13 22:25:31,113 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870189668] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:31,113 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:31,113 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:31,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704892670]
[2025-03-13 22:25:31,113 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:31,113 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:31,114 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:31,114 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:31,114 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:31,123 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 388 out of 480
[2025-03-13 22:25:31,124 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 366 transitions, 755 flow. Second operand  has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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,124 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:31,124 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 480
[2025-03-13 22:25:31,124 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:31,239 INFO  L124   PetriNetUnfolderBase]: 152/731 cut-off events.
[2025-03-13 22:25:31,240 INFO  L125   PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES.
[2025-03-13 22:25:31,243 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 731 events. 152/731 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2517 event pairs, 73 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 993. Up to 214 conditions per place. 
[2025-03-13 22:25:31,245 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 19 selfloop transitions, 2 changer transitions 0/365 dead transitions.
[2025-03-13 22:25:31,246 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 365 transitions, 795 flow
[2025-03-13 22:25:31,246 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:31,246 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:31,248 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions.
[2025-03-13 22:25:31,249 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8222222222222222
[2025-03-13 22:25:31,249 INFO  L175             Difference]: Start difference. First operand has 367 places, 366 transitions, 755 flow. Second operand 3 states and 1184 transitions.
[2025-03-13 22:25:31,249 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 365 transitions, 795 flow
[2025-03-13 22:25:31,251 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 365 transitions, 793 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:31,255 INFO  L231             Difference]: Finished difference. Result has 367 places, 365 transitions, 755 flow
[2025-03-13 22:25:31,255 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=367, PETRI_TRANSITIONS=365}
[2025-03-13 22:25:31,255 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places.
[2025-03-13 22:25:31,256 INFO  L471      AbstractCegarLoop]: Abstraction has has 367 places, 365 transitions, 755 flow
[2025-03-13 22:25:31,256 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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,256 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:31,256 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,256 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-13 22:25:31,256 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:31,257 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:31,257 INFO  L85        PathProgramCache]: Analyzing trace with hash 1095093137, now seen corresponding path program 1 times
[2025-03-13 22:25:31,257 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:31,257 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125271109]
[2025-03-13 22:25:31,258 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:31,258 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:31,281 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes.
[2025-03-13 22:25:31,289 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements.
[2025-03-13 22:25:31,289 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:31,289 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:31,353 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,354 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:31,354 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125271109]
[2025-03-13 22:25:31,354 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125271109] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:31,354 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:31,354 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:31,354 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008944685]
[2025-03-13 22:25:31,354 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:31,355 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:31,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:31,356 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:31,356 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:31,366 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480
[2025-03-13 22:25:31,368 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 365 transitions, 755 flow. Second operand  has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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,368 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:31,368 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480
[2025-03-13 22:25:31,368 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:31,604 INFO  L124   PetriNetUnfolderBase]: 236/1206 cut-off events.
[2025-03-13 22:25:31,604 INFO  L125   PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES.
[2025-03-13 22:25:31,608 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1677 conditions, 1206 events. 236/1206 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6132 event pairs, 73 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1613. Up to 212 conditions per place. 
[2025-03-13 22:25:31,611 INFO  L140   encePairwiseOnDemand]: 476/480 looper letters, 29 selfloop transitions, 3 changer transitions 0/377 dead transitions.
[2025-03-13 22:25:31,611 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 377 transitions, 856 flow
[2025-03-13 22:25:31,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:31,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:31,612 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1202 transitions.
[2025-03-13 22:25:31,613 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8347222222222223
[2025-03-13 22:25:31,613 INFO  L175             Difference]: Start difference. First operand has 367 places, 365 transitions, 755 flow. Second operand 3 states and 1202 transitions.
[2025-03-13 22:25:31,613 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 377 transitions, 856 flow
[2025-03-13 22:25:31,615 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 377 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:31,617 INFO  L231             Difference]: Finished difference. Result has 367 places, 365 transitions, 762 flow
[2025-03-13 22:25:31,618 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=367, PETRI_TRANSITIONS=365}
[2025-03-13 22:25:31,618 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places.
[2025-03-13 22:25:31,618 INFO  L471      AbstractCegarLoop]: Abstraction has has 367 places, 365 transitions, 762 flow
[2025-03-13 22:25:31,618 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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,619 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:31,619 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,619 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-13 22:25:31,619 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:31,620 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:31,620 INFO  L85        PathProgramCache]: Analyzing trace with hash 1319286200, now seen corresponding path program 1 times
[2025-03-13 22:25:31,620 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:31,620 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107098763]
[2025-03-13 22:25:31,620 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:31,620 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:31,628 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes.
[2025-03-13 22:25:31,633 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements.
[2025-03-13 22:25:31,633 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:31,633 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:31,661 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,661 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:31,661 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107098763]
[2025-03-13 22:25:31,661 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107098763] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:31,661 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:31,661 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:31,661 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157167721]
[2025-03-13 22:25:31,661 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:31,661 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:31,662 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:31,662 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:31,662 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:31,667 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 388 out of 480
[2025-03-13 22:25:31,668 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 365 transitions, 762 flow. Second operand  has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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,668 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:31,668 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 480
[2025-03-13 22:25:31,668 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:31,797 INFO  L124   PetriNetUnfolderBase]: 224/960 cut-off events.
[2025-03-13 22:25:31,797 INFO  L125   PetriNetUnfolderBase]: For 209/209 co-relation queries the response was YES.
[2025-03-13 22:25:31,800 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 960 events. 224/960 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4090 event pairs, 123 based on Foata normal form. 0/843 useless extension candidates. Maximal degree in co-relation 1432. Up to 324 conditions per place. 
[2025-03-13 22:25:31,803 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 20 selfloop transitions, 2 changer transitions 0/364 dead transitions.
[2025-03-13 22:25:31,803 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 364 transitions, 804 flow
[2025-03-13 22:25:31,804 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:31,804 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:31,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions.
[2025-03-13 22:25:31,806 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8222222222222222
[2025-03-13 22:25:31,806 INFO  L175             Difference]: Start difference. First operand has 367 places, 365 transitions, 762 flow. Second operand 3 states and 1184 transitions.
[2025-03-13 22:25:31,806 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 364 transitions, 804 flow
[2025-03-13 22:25:31,808 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 364 transitions, 801 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:31,810 INFO  L231             Difference]: Finished difference. Result has 367 places, 364 transitions, 761 flow
[2025-03-13 22:25:31,811 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=761, PETRI_PLACES=367, PETRI_TRANSITIONS=364}
[2025-03-13 22:25:31,811 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places.
[2025-03-13 22:25:31,811 INFO  L471      AbstractCegarLoop]: Abstraction has has 367 places, 364 transitions, 761 flow
[2025-03-13 22:25:31,812 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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,812 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:31,812 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,812 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-13 22:25:31,812 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:31,813 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:31,813 INFO  L85        PathProgramCache]: Analyzing trace with hash -388776092, now seen corresponding path program 1 times
[2025-03-13 22:25:31,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:31,813 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917090549]
[2025-03-13 22:25:31,813 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:31,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:31,824 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-03-13 22:25:31,829 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-03-13 22:25:31,829 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:31,829 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:31,865 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,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:31,866 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917090549]
[2025-03-13 22:25:31,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917090549] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:31,866 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:31,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:31,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149104491]
[2025-03-13 22:25:31,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:31,867 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:31,868 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:31,868 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:31,868 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:31,877 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 388 out of 480
[2025-03-13 22:25:31,878 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 364 transitions, 761 flow. Second operand  has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 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,879 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:31,879 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 480
[2025-03-13 22:25:31,879 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:32,070 INFO  L124   PetriNetUnfolderBase]: 323/1581 cut-off events.
[2025-03-13 22:25:32,070 INFO  L125   PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES.
[2025-03-13 22:25:32,074 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 1581 events. 323/1581 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8820 event pairs, 183 based on Foata normal form. 0/1329 useless extension candidates. Maximal degree in co-relation 2226. Up to 456 conditions per place. 
[2025-03-13 22:25:32,078 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 21 selfloop transitions, 1 changer transitions 0/362 dead transitions.
[2025-03-13 22:25:32,078 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 362 transitions, 801 flow
[2025-03-13 22:25:32,079 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:32,079 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:32,080 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions.
[2025-03-13 22:25:32,081 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8229166666666666
[2025-03-13 22:25:32,081 INFO  L175             Difference]: Start difference. First operand has 367 places, 364 transitions, 761 flow. Second operand 3 states and 1185 transitions.
[2025-03-13 22:25:32,081 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 362 transitions, 801 flow
[2025-03-13 22:25:32,083 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 362 transitions, 797 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:32,086 INFO  L231             Difference]: Finished difference. Result has 365 places, 362 transitions, 755 flow
[2025-03-13 22:25:32,086 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=365, PETRI_TRANSITIONS=362}
[2025-03-13 22:25:32,086 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -85 predicate places.
[2025-03-13 22:25:32,087 INFO  L471      AbstractCegarLoop]: Abstraction has has 365 places, 362 transitions, 755 flow
[2025-03-13 22:25:32,087 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 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,087 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:32,087 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,087 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-13 22:25:32,088 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err29ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:32,088 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:32,088 INFO  L85        PathProgramCache]: Analyzing trace with hash 117257516, now seen corresponding path program 1 times
[2025-03-13 22:25:32,088 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:32,088 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564599191]
[2025-03-13 22:25:32,089 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:32,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:32,098 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes.
[2025-03-13 22:25:32,104 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements.
[2025-03-13 22:25:32,105 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:32,105 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:32,152 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:32,152 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:32,152 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564599191]
[2025-03-13 22:25:32,152 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564599191] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:32,152 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:32,152 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:32,152 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539705331]
[2025-03-13 22:25:32,153 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:32,153 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:32,153 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:32,154 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:32,154 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:32,161 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 389 out of 480
[2025-03-13 22:25:32,162 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 362 transitions, 755 flow. Second operand  has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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,162 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:32,162 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 480
[2025-03-13 22:25:32,162 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:32,358 INFO  L124   PetriNetUnfolderBase]: 327/1521 cut-off events.
[2025-03-13 22:25:32,359 INFO  L125   PetriNetUnfolderBase]: For 237/237 co-relation queries the response was YES.
[2025-03-13 22:25:32,362 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2241 conditions, 1521 events. 327/1521 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 8236 event pairs, 138 based on Foata normal form. 0/1312 useless extension candidates. Maximal degree in co-relation 2176. Up to 383 conditions per place. 
[2025-03-13 22:25:32,366 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 28 selfloop transitions, 2 changer transitions 0/369 dead transitions.
[2025-03-13 22:25:32,367 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 369 transitions, 839 flow
[2025-03-13 22:25:32,367 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:32,367 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:32,368 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1193 transitions.
[2025-03-13 22:25:32,369 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8284722222222223
[2025-03-13 22:25:32,369 INFO  L175             Difference]: Start difference. First operand has 365 places, 362 transitions, 755 flow. Second operand 3 states and 1193 transitions.
[2025-03-13 22:25:32,369 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 369 transitions, 839 flow
[2025-03-13 22:25:32,371 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 369 transitions, 838 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:32,374 INFO  L231             Difference]: Finished difference. Result has 365 places, 361 transitions, 756 flow
[2025-03-13 22:25:32,374 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=365, PETRI_TRANSITIONS=361}
[2025-03-13 22:25:32,374 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -85 predicate places.
[2025-03-13 22:25:32,374 INFO  L471      AbstractCegarLoop]: Abstraction has has 365 places, 361 transitions, 756 flow
[2025-03-13 22:25:32,375 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 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,375 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:32,375 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,375 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-13 22:25:32,376 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err27ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:32,376 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:32,376 INFO  L85        PathProgramCache]: Analyzing trace with hash 1910018251, now seen corresponding path program 1 times
[2025-03-13 22:25:32,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:32,377 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921124778]
[2025-03-13 22:25:32,377 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:32,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:32,386 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes.
[2025-03-13 22:25:32,392 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements.
[2025-03-13 22:25:32,392 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:32,392 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:32,426 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:32,426 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:32,426 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921124778]
[2025-03-13 22:25:32,426 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921124778] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:32,426 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:32,426 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:32,426 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390748779]
[2025-03-13 22:25:32,426 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:32,427 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:32,427 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:32,427 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:32,427 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:32,439 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 385 out of 480
[2025-03-13 22:25:32,441 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 361 transitions, 756 flow. Second operand  has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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,441 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:32,441 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 480
[2025-03-13 22:25:32,441 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:32,698 INFO  L124   PetriNetUnfolderBase]: 561/2044 cut-off events.
[2025-03-13 22:25:32,699 INFO  L125   PetriNetUnfolderBase]: For 371/371 co-relation queries the response was YES.
[2025-03-13 22:25:32,704 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3265 conditions, 2044 events. 561/2044 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 12407 event pairs, 94 based on Foata normal form. 0/1858 useless extension candidates. Maximal degree in co-relation 3200. Up to 636 conditions per place. 
[2025-03-13 22:25:32,710 INFO  L140   encePairwiseOnDemand]: 473/480 looper letters, 32 selfloop transitions, 5 changer transitions 0/371 dead transitions.
[2025-03-13 22:25:32,711 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 371 transitions, 863 flow
[2025-03-13 22:25:32,711 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:32,711 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:32,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions.
[2025-03-13 22:25:32,713 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8263888888888888
[2025-03-13 22:25:32,713 INFO  L175             Difference]: Start difference. First operand has 365 places, 361 transitions, 756 flow. Second operand 3 states and 1190 transitions.
[2025-03-13 22:25:32,713 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 371 transitions, 863 flow
[2025-03-13 22:25:32,715 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 371 transitions, 859 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:32,719 INFO  L231             Difference]: Finished difference. Result has 364 places, 362 transitions, 786 flow
[2025-03-13 22:25:32,719 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=364, PETRI_TRANSITIONS=362}
[2025-03-13 22:25:32,720 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -86 predicate places.
[2025-03-13 22:25:32,720 INFO  L471      AbstractCegarLoop]: Abstraction has has 364 places, 362 transitions, 786 flow
[2025-03-13 22:25:32,720 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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,720 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:32,721 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,721 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-13 22:25:32,721 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:32,722 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:32,722 INFO  L85        PathProgramCache]: Analyzing trace with hash -1335459207, now seen corresponding path program 1 times
[2025-03-13 22:25:32,722 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:32,722 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330009998]
[2025-03-13 22:25:32,722 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:32,723 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:32,734 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes.
[2025-03-13 22:25:32,741 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements.
[2025-03-13 22:25:32,741 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:32,741 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:32,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-13 22:25:32,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:32,776 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330009998]
[2025-03-13 22:25:32,776 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330009998] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:32,776 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:32,777 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:32,777 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053205159]
[2025-03-13 22:25:32,777 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:32,777 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:32,778 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:32,778 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:32,778 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:32,783 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480
[2025-03-13 22:25:32,784 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 362 transitions, 786 flow. Second operand  has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 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,784 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:32,784 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480
[2025-03-13 22:25:32,784 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:33,020 INFO  L124   PetriNetUnfolderBase]: 407/1869 cut-off events.
[2025-03-13 22:25:33,021 INFO  L125   PetriNetUnfolderBase]: For 735/755 co-relation queries the response was YES.
[2025-03-13 22:25:33,025 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3047 conditions, 1869 events. 407/1869 cut-off events. For 735/755 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 11631 event pairs, 150 based on Foata normal form. 4/1682 useless extension candidates. Maximal degree in co-relation 2981. Up to 524 conditions per place. 
[2025-03-13 22:25:33,029 INFO  L140   encePairwiseOnDemand]: 476/480 looper letters, 29 selfloop transitions, 4 changer transitions 0/371 dead transitions.
[2025-03-13 22:25:33,029 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 371 transitions, 890 flow
[2025-03-13 22:25:33,029 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:33,029 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:33,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1199 transitions.
[2025-03-13 22:25:33,031 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8326388888888889
[2025-03-13 22:25:33,031 INFO  L175             Difference]: Start difference. First operand has 364 places, 362 transitions, 786 flow. Second operand 3 states and 1199 transitions.
[2025-03-13 22:25:33,032 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 371 transitions, 890 flow
[2025-03-13 22:25:33,034 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 371 transitions, 878 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-13 22:25:33,036 INFO  L231             Difference]: Finished difference. Result has 364 places, 365 transitions, 812 flow
[2025-03-13 22:25:33,037 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=364, PETRI_TRANSITIONS=365}
[2025-03-13 22:25:33,037 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -86 predicate places.
[2025-03-13 22:25:33,037 INFO  L471      AbstractCegarLoop]: Abstraction has has 364 places, 365 transitions, 812 flow
[2025-03-13 22:25:33,038 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 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:33,038 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:33,038 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,038 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-13 22:25:33,039 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:33,039 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:33,039 INFO  L85        PathProgramCache]: Analyzing trace with hash 1153934813, now seen corresponding path program 1 times
[2025-03-13 22:25:33,040 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:33,040 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477010286]
[2025-03-13 22:25:33,040 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:33,040 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:33,053 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes.
[2025-03-13 22:25:33,063 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements.
[2025-03-13 22:25:33,063 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:33,063 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:33,501 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:33,501 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:33,501 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477010286]
[2025-03-13 22:25:33,501 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477010286] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:33,501 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:33,501 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-13 22:25:33,501 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327825917]
[2025-03-13 22:25:33,501 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:33,502 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-13 22:25:33,502 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:33,503 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-13 22:25:33,503 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-13 22:25:33,608 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 373 out of 480
[2025-03-13 22:25:33,610 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 365 transitions, 812 flow. Second operand  has 6 states, 6 states have (on average 374.8333333333333) internal successors, (2249), 6 states have internal predecessors, (2249), 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:33,610 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:33,610 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 480
[2025-03-13 22:25:33,610 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:34,102 INFO  L124   PetriNetUnfolderBase]: 618/2374 cut-off events.
[2025-03-13 22:25:34,102 INFO  L125   PetriNetUnfolderBase]: For 1205/1224 co-relation queries the response was YES.
[2025-03-13 22:25:34,108 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4168 conditions, 2374 events. 618/2374 cut-off events. For 1205/1224 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 15820 event pairs, 131 based on Foata normal form. 7/2162 useless extension candidates. Maximal degree in co-relation 4100. Up to 440 conditions per place. 
[2025-03-13 22:25:34,115 INFO  L140   encePairwiseOnDemand]: 473/480 looper letters, 76 selfloop transitions, 6 changer transitions 0/402 dead transitions.
[2025-03-13 22:25:34,115 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 402 transitions, 1118 flow
[2025-03-13 22:25:34,116 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-13 22:25:34,116 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-13 22:25:34,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2304 transitions.
[2025-03-13 22:25:34,119 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8
[2025-03-13 22:25:34,120 INFO  L175             Difference]: Start difference. First operand has 364 places, 365 transitions, 812 flow. Second operand 6 states and 2304 transitions.
[2025-03-13 22:25:34,120 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 402 transitions, 1118 flow
[2025-03-13 22:25:34,122 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 402 transitions, 1118 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-03-13 22:25:34,125 INFO  L231             Difference]: Finished difference. Result has 373 places, 369 transitions, 856 flow
[2025-03-13 22:25:34,125 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=856, PETRI_PLACES=373, PETRI_TRANSITIONS=369}
[2025-03-13 22:25:34,126 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -77 predicate places.
[2025-03-13 22:25:34,126 INFO  L471      AbstractCegarLoop]: Abstraction has has 373 places, 369 transitions, 856 flow
[2025-03-13 22:25:34,127 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 374.8333333333333) internal successors, (2249), 6 states have internal predecessors, (2249), 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:34,127 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:34,127 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,127 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-03-13 22:25:34,127 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:34,128 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:34,128 INFO  L85        PathProgramCache]: Analyzing trace with hash 2056217505, now seen corresponding path program 1 times
[2025-03-13 22:25:34,128 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:34,128 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610337691]
[2025-03-13 22:25:34,128 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-13 22:25:34,129 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:34,147 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes.
[2025-03-13 22:25:34,160 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements.
[2025-03-13 22:25:34,161 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-13 22:25:34,161 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:34,411 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:34,412 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:34,412 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610337691]
[2025-03-13 22:25:34,412 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610337691] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:34,412 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:34,412 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-13 22:25:34,412 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809172579]
[2025-03-13 22:25:34,412 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:34,412 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:34,413 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:34,413 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:34,413 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:34,417 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480
[2025-03-13 22:25:34,418 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 369 transitions, 856 flow. Second operand  has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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:34,418 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:34,418 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480
[2025-03-13 22:25:34,418 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:34,614 INFO  L124   PetriNetUnfolderBase]: 382/1638 cut-off events.
[2025-03-13 22:25:34,615 INFO  L125   PetriNetUnfolderBase]: For 959/1001 co-relation queries the response was YES.
[2025-03-13 22:25:34,620 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2898 conditions, 1638 events. 382/1638 cut-off events. For 959/1001 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9484 event pairs, 80 based on Foata normal form. 35/1483 useless extension candidates. Maximal degree in co-relation 2825. Up to 432 conditions per place. 
[2025-03-13 22:25:34,624 INFO  L140   encePairwiseOnDemand]: 477/480 looper letters, 36 selfloop transitions, 2 changer transitions 0/379 dead transitions.
[2025-03-13 22:25:34,624 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 379 transitions, 980 flow
[2025-03-13 22:25:34,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:34,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:34,626 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1200 transitions.
[2025-03-13 22:25:34,626 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8333333333333334
[2025-03-13 22:25:34,626 INFO  L175             Difference]: Start difference. First operand has 373 places, 369 transitions, 856 flow. Second operand 3 states and 1200 transitions.
[2025-03-13 22:25:34,626 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 379 transitions, 980 flow
[2025-03-13 22:25:34,629 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 379 transitions, 980 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-03-13 22:25:34,631 INFO  L231             Difference]: Finished difference. Result has 376 places, 370 transitions, 868 flow
[2025-03-13 22:25:34,631 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=868, PETRI_PLACES=376, PETRI_TRANSITIONS=370}
[2025-03-13 22:25:34,632 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -74 predicate places.
[2025-03-13 22:25:34,632 INFO  L471      AbstractCegarLoop]: Abstraction has has 376 places, 370 transitions, 868 flow
[2025-03-13 22:25:34,633 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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:34,633 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:34,633 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,633 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-03-13 22:25:34,633 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:34,634 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:34,634 INFO  L85        PathProgramCache]: Analyzing trace with hash -1659506937, now seen corresponding path program 2 times
[2025-03-13 22:25:34,634 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:34,634 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196775129]
[2025-03-13 22:25:34,634 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-13 22:25:34,635 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:34,652 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 267 statements into 1 equivalence classes.
[2025-03-13 22:25:34,661 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 267 of 267 statements.
[2025-03-13 22:25:34,661 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-03-13 22:25:34,661 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:34,863 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:34,863 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:34,863 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196775129]
[2025-03-13 22:25:34,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196775129] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:34,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:34,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-13 22:25:34,864 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535869538]
[2025-03-13 22:25:34,864 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:34,865 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:34,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:34,866 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:34,866 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:34,881 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480
[2025-03-13 22:25:34,882 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 370 transitions, 868 flow. Second operand  has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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:34,882 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:34,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480
[2025-03-13 22:25:34,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:35,114 INFO  L124   PetriNetUnfolderBase]: 376/1749 cut-off events.
[2025-03-13 22:25:35,114 INFO  L125   PetriNetUnfolderBase]: For 1086/1124 co-relation queries the response was YES.
[2025-03-13 22:25:35,120 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3169 conditions, 1749 events. 376/1749 cut-off events. For 1086/1124 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 9668 event pairs, 124 based on Foata normal form. 12/1549 useless extension candidates. Maximal degree in co-relation 3094. Up to 514 conditions per place. 
[2025-03-13 22:25:35,125 INFO  L140   encePairwiseOnDemand]: 476/480 looper letters, 30 selfloop transitions, 4 changer transitions 0/375 dead transitions.
[2025-03-13 22:25:35,125 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 375 transitions, 952 flow
[2025-03-13 22:25:35,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:35,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:35,127 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1198 transitions.
[2025-03-13 22:25:35,128 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8319444444444445
[2025-03-13 22:25:35,128 INFO  L175             Difference]: Start difference. First operand has 376 places, 370 transitions, 868 flow. Second operand 3 states and 1198 transitions.
[2025-03-13 22:25:35,128 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 375 transitions, 952 flow
[2025-03-13 22:25:35,131 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 375 transitions, 950 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:35,133 INFO  L231             Difference]: Finished difference. Result has 378 places, 370 transitions, 882 flow
[2025-03-13 22:25:35,134 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=378, PETRI_TRANSITIONS=370}
[2025-03-13 22:25:35,134 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -72 predicate places.
[2025-03-13 22:25:35,134 INFO  L471      AbstractCegarLoop]: Abstraction has has 378 places, 370 transitions, 882 flow
[2025-03-13 22:25:35,135 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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:35,135 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-13 22:25:35,135 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,135 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-03-13 22:25:35,135 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] ===
[2025-03-13 22:25:35,136 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-13 22:25:35,136 INFO  L85        PathProgramCache]: Analyzing trace with hash 1111076329, now seen corresponding path program 3 times
[2025-03-13 22:25:35,137 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-13 22:25:35,137 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905916830]
[2025-03-13 22:25:35,138 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-03-13 22:25:35,138 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-13 22:25:35,158 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 267 statements into 1 equivalence classes.
[2025-03-13 22:25:35,167 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 267 of 267 statements.
[2025-03-13 22:25:35,167 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-03-13 22:25:35,167 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-13 22:25:35,200 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:35,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-13 22:25:35,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905916830]
[2025-03-13 22:25:35,200 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905916830] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-13 22:25:35,200 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-13 22:25:35,200 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-13 22:25:35,200 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959429294]
[2025-03-13 22:25:35,200 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-13 22:25:35,201 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-13 22:25:35,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-13 22:25:35,201 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-13 22:25:35,201 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-13 22:25:35,208 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 391 out of 480
[2025-03-13 22:25:35,208 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 370 transitions, 882 flow. Second operand  has 3 states, 3 states have (on average 395.6666666666667) internal successors, (1187), 3 states have internal predecessors, (1187), 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:35,208 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-13 22:25:35,208 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 480
[2025-03-13 22:25:35,208 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-13 22:25:35,469 INFO  L124   PetriNetUnfolderBase]: 386/1902 cut-off events.
[2025-03-13 22:25:35,470 INFO  L125   PetriNetUnfolderBase]: For 1236/1270 co-relation queries the response was YES.
[2025-03-13 22:25:35,474 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3422 conditions, 1902 events. 386/1902 cut-off events. For 1236/1270 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10887 event pairs, 172 based on Foata normal form. 4/1684 useless extension candidates. Maximal degree in co-relation 3348. Up to 537 conditions per place. 
[2025-03-13 22:25:35,474 INFO  L140   encePairwiseOnDemand]: 478/480 looper letters, 0 selfloop transitions, 0 changer transitions 369/369 dead transitions.
[2025-03-13 22:25:35,474 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 369 transitions, 934 flow
[2025-03-13 22:25:35,475 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-13 22:25:35,475 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-13 22:25:35,476 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions.
[2025-03-13 22:25:35,477 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8263888888888888
[2025-03-13 22:25:35,477 INFO  L175             Difference]: Start difference. First operand has 378 places, 370 transitions, 882 flow. Second operand 3 states and 1190 transitions.
[2025-03-13 22:25:35,477 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 369 transitions, 934 flow
[2025-03-13 22:25:35,479 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 369 transitions, 930 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-13 22:25:35,481 INFO  L231             Difference]: Finished difference. Result has 378 places, 0 transitions, 0 flow
[2025-03-13 22:25:35,481 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=480, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=378, PETRI_TRANSITIONS=0}
[2025-03-13 22:25:35,481 INFO  L279   CegarLoopForPetriNet]: 450 programPoint places, -72 predicate places.
[2025-03-13 22:25:35,482 INFO  L471      AbstractCegarLoop]: Abstraction has has 378 places, 0 transitions, 0 flow
[2025-03-13 22:25:35,482 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 395.6666666666667) internal successors, (1187), 3 states have internal predecessors, (1187), 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:35,484 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (158 of 159 remaining)
[2025-03-13 22:25:35,484 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (157 of 159 remaining)
[2025-03-13 22:25:35,484 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (156 of 159 remaining)
[2025-03-13 22:25:35,484 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (155 of 159 remaining)
[2025-03-13 22:25:35,485 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (154 of 159 remaining)
[2025-03-13 22:25:35,485 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (153 of 159 remaining)
[2025-03-13 22:25:35,485 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (152 of 159 remaining)
[2025-03-13 22:25:35,485 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (151 of 159 remaining)
[2025-03-13 22:25:35,485 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (150 of 159 remaining)
[2025-03-13 22:25:35,485 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (149 of 159 remaining)
[2025-03-13 22:25:35,485 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (148 of 159 remaining)
[2025-03-13 22:25:35,485 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (147 of 159 remaining)
[2025-03-13 22:25:35,485 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (146 of 159 remaining)
[2025-03-13 22:25:35,485 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (145 of 159 remaining)
[2025-03-13 22:25:35,486 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (144 of 159 remaining)
[2025-03-13 22:25:35,486 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (143 of 159 remaining)
[2025-03-13 22:25:35,486 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (142 of 159 remaining)
[2025-03-13 22:25:35,486 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (141 of 159 remaining)
[2025-03-13 22:25:35,486 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (140 of 159 remaining)
[2025-03-13 22:25:35,486 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (139 of 159 remaining)
[2025-03-13 22:25:35,486 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (138 of 159 remaining)
[2025-03-13 22:25:35,486 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (137 of 159 remaining)
[2025-03-13 22:25:35,486 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (136 of 159 remaining)
[2025-03-13 22:25:35,486 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (135 of 159 remaining)
[2025-03-13 22:25:35,486 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (134 of 159 remaining)
[2025-03-13 22:25:35,487 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (133 of 159 remaining)
[2025-03-13 22:25:35,487 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (132 of 159 remaining)
[2025-03-13 22:25:35,487 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (131 of 159 remaining)
[2025-03-13 22:25:35,487 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (130 of 159 remaining)
[2025-03-13 22:25:35,487 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (129 of 159 remaining)
[2025-03-13 22:25:35,487 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (128 of 159 remaining)
[2025-03-13 22:25:35,487 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (127 of 159 remaining)
[2025-03-13 22:25:35,487 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (126 of 159 remaining)
[2025-03-13 22:25:35,487 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (125 of 159 remaining)
[2025-03-13 22:25:35,487 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (124 of 159 remaining)
[2025-03-13 22:25:35,487 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (123 of 159 remaining)
[2025-03-13 22:25:35,487 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (122 of 159 remaining)
[2025-03-13 22:25:35,487 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (121 of 159 remaining)
[2025-03-13 22:25:35,487 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (120 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (119 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (118 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (117 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (116 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (115 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (114 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (113 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (112 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (111 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (110 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (109 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (108 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (107 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (106 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (105 of 159 remaining)
[2025-03-13 22:25:35,488 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (104 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (103 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (102 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (101 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (100 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (99 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (98 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (97 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (96 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (95 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (94 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (93 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (92 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (91 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (90 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (89 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (88 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (87 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (86 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (85 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (84 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (83 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (82 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (81 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (80 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (79 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (78 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (77 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (76 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (75 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (74 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (73 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (72 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (71 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (70 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (69 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 159 remaining)
[2025-03-13 22:25:35,489 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (67 of 159 remaining)
[2025-03-13 22:25:35,490 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (66 of 159 remaining)
[2025-03-13 22:25:35,490 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (65 of 159 remaining)
[2025-03-13 22:25:35,490 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (64 of 159 remaining)
[2025-03-13 22:25:35,490 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 159 remaining)
[2025-03-13 22:25:35,490 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (62 of 159 remaining)
[2025-03-13 22:25:35,490 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (61 of 159 remaining)
[2025-03-13 22:25:35,490 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (60 of 159 remaining)
[2025-03-13 22:25:35,490 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (59 of 159 remaining)
[2025-03-13 22:25:35,490 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (58 of 159 remaining)
[2025-03-13 22:25:35,490 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (57 of 159 remaining)
[2025-03-13 22:25:35,490 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (56 of 159 remaining)
[2025-03-13 22:25:35,490 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (55 of 159 remaining)
[2025-03-13 22:25:35,490 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (54 of 159 remaining)
[2025-03-13 22:25:35,490 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (53 of 159 remaining)
[2025-03-13 22:25:35,490 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (52 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (51 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (50 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (49 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (48 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (47 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (46 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (45 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (44 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (43 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (42 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (41 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (40 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (39 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (38 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (37 of 159 remaining)
[2025-03-13 22:25:35,491 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (36 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (35 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (34 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (33 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (32 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (31 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (30 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (29 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (28 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (27 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (26 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (25 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (24 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (23 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (22 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (19 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (18 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 159 remaining)
[2025-03-13 22:25:35,492 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (15 of 159 remaining)
[2025-03-13 22:25:35,493 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (14 of 159 remaining)
[2025-03-13 22:25:35,493 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 159 remaining)
[2025-03-13 22:25:35,493 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 159 remaining)
[2025-03-13 22:25:35,493 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 159 remaining)
[2025-03-13 22:25:35,493 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 159 remaining)
[2025-03-13 22:25:35,493 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 159 remaining)
[2025-03-13 22:25:35,493 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 159 remaining)
[2025-03-13 22:25:35,493 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 159 remaining)
[2025-03-13 22:25:35,493 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 159 remaining)
[2025-03-13 22:25:35,493 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 159 remaining)
[2025-03-13 22:25:35,493 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 159 remaining)
[2025-03-13 22:25:35,493 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 159 remaining)
[2025-03-13 22:25:35,493 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 159 remaining)
[2025-03-13 22:25:35,493 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 159 remaining)
[2025-03-13 22:25:35,493 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 159 remaining)
[2025-03-13 22:25:35,493 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-03-13 22:25:35,493 INFO  L422         BasicCegarLoop]: Path program histogram: [3, 1, 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:35,498 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-03-13 22:25:35,498 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-13 22:25:35,503 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:25:35 BasicIcfg
[2025-03-13 22:25:35,503 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-13 22:25:35,504 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-13 22:25:35,504 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-13 22:25:35,504 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-13 22:25:35,504 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:26" (3/4) ...
[2025-03-13 22:25:35,505 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-13 22:25:35,507 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread1
[2025-03-13 22:25:35,508 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread2
[2025-03-13 22:25:35,508 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread3
[2025-03-13 22:25:35,514 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges
[2025-03-13 22:25:35,514 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges
[2025-03-13 22:25:35,514 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-13 22:25:35,515 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-13 22:25:35,586 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-13 22:25:35,586 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-13 22:25:35,586 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-13 22:25:35,587 INFO  L158              Benchmark]: Toolchain (without parser) took 11146.31ms. Allocated memory was 142.6MB in the beginning and 671.1MB in the end (delta: 528.5MB). Free memory was 104.5MB in the beginning and 571.3MB in the end (delta: -466.8MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB.
[2025-03-13 22:25:35,588 INFO  L158              Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-13 22:25:35,588 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 210.43ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 91.1MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-13 22:25:35,589 INFO  L158              Benchmark]: Boogie Procedure Inliner took 53.63ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 87.2MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-13 22:25:35,589 INFO  L158              Benchmark]: Boogie Preprocessor took 52.03ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 84.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-13 22:25:35,589 INFO  L158              Benchmark]: IcfgBuilder took 1426.21ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 56.8MB in the end (delta: 27.7MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB.
[2025-03-13 22:25:35,590 INFO  L158              Benchmark]: TraceAbstraction took 9312.26ms. Allocated memory was 142.6MB in the beginning and 671.1MB in the end (delta: 528.5MB). Free memory was 56.0MB in the beginning and 579.7MB in the end (delta: -523.7MB). Peak memory consumption was 383.6MB. Max. memory is 16.1GB.
[2025-03-13 22:25:35,590 INFO  L158              Benchmark]: Witness Printer took 82.57ms. Allocated memory is still 671.1MB. Free memory was 579.7MB in the beginning and 571.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-13 22:25:35,591 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.25ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 210.43ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 91.1MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 53.63ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 87.2MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 52.03ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 84.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 1426.21ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 56.8MB in the end (delta: 27.7MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB.
 * TraceAbstraction took 9312.26ms. Allocated memory was 142.6MB in the beginning and 671.1MB in the end (delta: 528.5MB). Free memory was 56.0MB in the beginning and 579.7MB in the end (delta: -523.7MB). Peak memory consumption was 383.6MB. Max. memory is 16.1GB.
 * Witness Printer took 82.57ms. Allocated memory is still 671.1MB. Free memory was 579.7MB in the beginning and 571.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 50]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 52]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 72]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 72]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 72]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 72]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 72]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 72]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 73]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 73]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 53]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 53]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 53]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 55]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 55]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 57]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 57]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 57]: 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: 59]: 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: 64]: 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: 65]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 65]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 65]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 66]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 66]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 67]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 67]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 84]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 84]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 84]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 84]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 84]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 85]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 85]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 85]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 86]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 86]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 89]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 89]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 89]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 89]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 89]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 89]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 90]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 90]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 106]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 106]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 106]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 106]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 106]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 107]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 107]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 107]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 108]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 108]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 111]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 111]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 111]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 111]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 111]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 111]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 112]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 112]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 127]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 129]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 130]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 131]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 133]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 167]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 133]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 134]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 167]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 134]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 135]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 167]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 135]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 137]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 138]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 139]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 141]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 141]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 142]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 142]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 143]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 143]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 145]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 155]: 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 7 procedures, 599 locations, 159 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: 9.1s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 695 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1460 IncrementalHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 109 mSDtfsCounter, 1460 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=938occurred in iteration=0, InterpolantAutomatonStates: 90, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 4540 NumberOfCodeBlocks, 4540 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4512 ConstructedInterpolants, 0 QuantifiedInterpolants, 4982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 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
    90 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-03-13 22:25:35,606 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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