./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i --full-output --architecture 32bit


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


Checking for data races
Using default analysis
Version 735b3cc8
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/ldv-races/race-3_2-container_of-global.i -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 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-735b3cc-m
[2025-03-14 01:30:24,266 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-14 01:30:24,317 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2025-03-14 01:30:24,324 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-14 01:30:24,324 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-14 01:30:24,344 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-14 01:30:24,345 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-14 01:30:24,345 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-14 01:30:24,345 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-14 01:30:24,346 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-14 01:30:24,346 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-14 01:30:24,346 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-14 01:30:24,347 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-14 01:30:24,347 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-14 01:30:24,347 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-14 01:30:24,347 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-14 01:30:24,347 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-14 01:30:24,347 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-14 01:30:24,347 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-14 01:30:24,347 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-14 01:30:24,347 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-14 01:30:24,348 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-14 01:30:24,348 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2025-03-14 01:30:24,348 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-03-14 01:30:24,348 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-14 01:30:24,348 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-14 01:30:24,348 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-14 01:30:24,348 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-14 01:30:24,348 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-14 01:30:24,348 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-14 01:30:24,349 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-14 01:30:24,349 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-14 01:30:24,349 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-14 01:30:24,349 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-14 01:30:24,349 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-14 01:30:24,349 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-14 01:30:24,349 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-14 01:30:24,350 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-14 01:30:24,350 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-14 01:30:24,350 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-14 01:30:24,350 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-14 01:30:24,350 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-14 01:30:24,350 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702
[2025-03-14 01:30:24,566 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-14 01:30:24,572 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-14 01:30:24,575 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-14 01:30:24,576 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-14 01:30:24,577 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-14 01:30:24,579 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i
[2025-03-14 01:30:25,698 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f859f3e1b/3524eb1c8cb34e9ca4b2048f0a28a891/FLAG59572b190
[2025-03-14 01:30:26,058 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-14 01:30:26,059 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i
[2025-03-14 01:30:26,090 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f859f3e1b/3524eb1c8cb34e9ca4b2048f0a28a891/FLAG59572b190
[2025-03-14 01:30:26,106 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f859f3e1b/3524eb1c8cb34e9ca4b2048f0a28a891
[2025-03-14 01:30:26,108 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-14 01:30:26,109 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-14 01:30:26,110 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-14 01:30:26,110 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-14 01:30:26,113 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-14 01:30:26,114 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:30:26" (1/1) ...
[2025-03-14 01:30:26,115 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c94ccec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:26, skipping insertion in model container
[2025-03-14 01:30:26,116 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:30:26" (1/1) ...
[2025-03-14 01:30:26,159 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-14 01:30:26,524 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-14 01:30:26,532 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-14 01:30:26,591 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-14 01:30:26,629 INFO  L204         MainTranslator]: Completed translation
[2025-03-14 01:30:26,630 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:26 WrapperNode
[2025-03-14 01:30:26,630 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-14 01:30:26,631 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-14 01:30:26,631 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-14 01:30:26,631 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-14 01:30:26,637 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:26" (1/1) ...
[2025-03-14 01:30:26,655 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:26" (1/1) ...
[2025-03-14 01:30:26,676 INFO  L138                Inliner]: procedures = 246, calls = 44, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 219
[2025-03-14 01:30:26,676 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-14 01:30:26,677 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-14 01:30:26,677 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-14 01:30:26,677 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-14 01:30:26,682 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:26" (1/1) ...
[2025-03-14 01:30:26,683 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:26" (1/1) ...
[2025-03-14 01:30:26,688 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:26" (1/1) ...
[2025-03-14 01:30:26,688 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:26" (1/1) ...
[2025-03-14 01:30:26,704 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:26" (1/1) ...
[2025-03-14 01:30:26,707 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:26" (1/1) ...
[2025-03-14 01:30:26,709 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:26" (1/1) ...
[2025-03-14 01:30:26,711 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:26" (1/1) ...
[2025-03-14 01:30:26,714 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-14 01:30:26,714 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-14 01:30:26,714 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-14 01:30:26,714 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-14 01:30:26,715 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:26" (1/1) ...
[2025-03-14 01:30:26,719 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-14 01:30:26,738 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-14 01:30:26,752 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-14 01:30:26,755 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-14 01:30:26,772 INFO  L130     BoogieDeclarations]: Found specification of procedure my_callback
[2025-03-14 01:30:26,772 INFO  L138     BoogieDeclarations]: Found implementation of procedure my_callback
[2025-03-14 01:30:26,773 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2025-03-14 01:30:26,773 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2025-03-14 01:30:26,773 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-03-14 01:30:26,773 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2025-03-14 01:30:26,773 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2025-03-14 01:30:26,773 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2025-03-14 01:30:26,773 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-14 01:30:26,773 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2025-03-14 01:30:26,773 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-03-14 01:30:26,773 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-14 01:30:26,773 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-14 01:30:26,774 WARN  L225             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-03-14 01:30:26,985 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-14 01:30:26,987 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-14 01:30:27,373 INFO  L303             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-03-14 01:30:27,374 INFO  L313             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-14 01:30:27,374 INFO  L318             CfgBuilder]: Performing block encoding
[2025-03-14 01:30:27,439 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-14 01:30:27,440 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:30:27 BoogieIcfgContainer
[2025-03-14 01:30:27,440 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-14 01:30:27,442 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-14 01:30:27,443 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-14 01:30:27,446 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-14 01:30:27,447 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:30:26" (1/3) ...
[2025-03-14 01:30:27,447 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6700be26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:30:27, skipping insertion in model container
[2025-03-14 01:30:27,447 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:26" (2/3) ...
[2025-03-14 01:30:27,447 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6700be26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:30:27, skipping insertion in model container
[2025-03-14 01:30:27,448 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:30:27" (3/3) ...
[2025-03-14 01:30:27,449 INFO  L128   eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i
[2025-03-14 01:30:27,459 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-14 01:30:27,460 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_2-container_of-global.i that has 2 procedures, 272 locations, 1 initial locations, 0 loop locations, and 19 error locations.
[2025-03-14 01:30:27,460 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-03-14 01:30:27,526 INFO  L143    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2025-03-14 01:30:27,562 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 297 places, 305 transitions, 624 flow
[2025-03-14 01:30:27,656 INFO  L124   PetriNetUnfolderBase]: 18/389 cut-off events.
[2025-03-14 01:30:27,659 INFO  L125   PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2025-03-14 01:30:27,664 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 398 conditions, 389 events. 18/389 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 700 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 225. Up to 4 conditions per place. 
[2025-03-14 01:30:27,664 INFO  L82        GeneralOperation]: Start removeDead. Operand has 297 places, 305 transitions, 624 flow
[2025-03-14 01:30:27,671 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 295 places, 302 transitions, 616 flow
[2025-03-14 01:30:27,681 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-14 01:30:27,692 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;@7f4d73e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-14 01:30:27,692 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 29 error locations.
[2025-03-14 01:30:27,699 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-03-14 01:30:27,700 INFO  L124   PetriNetUnfolderBase]: 0/32 cut-off events.
[2025-03-14 01:30:27,700 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-14 01:30:27,700 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:30:27,700 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]
[2025-03-14 01:30:27,701 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-14 01:30:27,704 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:30:27,705 INFO  L85        PathProgramCache]: Analyzing trace with hash 1432301260, now seen corresponding path program 1 times
[2025-03-14 01:30:27,710 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:30:27,710 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396087269]
[2025-03-14 01:30:27,710 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:30:27,711 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:30:27,837 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-03-14 01:30:27,857 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-03-14 01:30:27,857 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:30:27,857 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:30:28,398 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-14 01:30:28,399 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:30:28,399 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396087269]
[2025-03-14 01:30:28,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396087269] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:30:28,400 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:30:28,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:30:28,401 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931368126]
[2025-03-14 01:30:28,401 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:30:28,405 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-14 01:30:28,408 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:30:28,423 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-14 01:30:28,424 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-14 01:30:28,721 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 231 out of 305
[2025-03-14 01:30:28,727 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 302 transitions, 616 flow. Second operand  has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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-14 01:30:28,727 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:30:28,727 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 305
[2025-03-14 01:30:28,730 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:30:29,091 INFO  L124   PetriNetUnfolderBase]: 424/1621 cut-off events.
[2025-03-14 01:30:29,091 INFO  L125   PetriNetUnfolderBase]: For 20/22 co-relation queries the response was YES.
[2025-03-14 01:30:29,100 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2399 conditions, 1621 events. 424/1621 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10268 event pairs, 423 based on Foata normal form. 60/1573 useless extension candidates. Maximal degree in co-relation 2107. Up to 755 conditions per place. 
[2025-03-14 01:30:29,109 INFO  L140   encePairwiseOnDemand]: 281/305 looper letters, 44 selfloop transitions, 5 changer transitions 12/265 dead transitions.
[2025-03-14 01:30:29,110 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 265 transitions, 640 flow
[2025-03-14 01:30:29,111 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-14 01:30:29,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-14 01:30:29,126 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1454 transitions.
[2025-03-14 01:30:29,129 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.7945355191256831
[2025-03-14 01:30:29,132 INFO  L175             Difference]: Start difference. First operand has 295 places, 302 transitions, 616 flow. Second operand 6 states and 1454 transitions.
[2025-03-14 01:30:29,132 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 265 transitions, 640 flow
[2025-03-14 01:30:29,141 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 265 transitions, 632 flow, removed 0 selfloop flow, removed 4 redundant places.
[2025-03-14 01:30:29,147 INFO  L231             Difference]: Finished difference. Result has 271 places, 253 transitions, 520 flow
[2025-03-14 01:30:29,150 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=271, PETRI_TRANSITIONS=253}
[2025-03-14 01:30:29,154 INFO  L279   CegarLoopForPetriNet]: 295 programPoint places, -24 predicate places.
[2025-03-14 01:30:29,155 INFO  L471      AbstractCegarLoop]: Abstraction has has 271 places, 253 transitions, 520 flow
[2025-03-14 01:30:29,156 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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-14 01:30:29,156 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:30:29,156 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]
[2025-03-14 01:30:29,156 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-14 01:30:29,157 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-14 01:30:29,157 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:30:29,158 INFO  L85        PathProgramCache]: Analyzing trace with hash 1547785665, now seen corresponding path program 1 times
[2025-03-14 01:30:29,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:30:29,158 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104433878]
[2025-03-14 01:30:29,158 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:30:29,158 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:30:29,188 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-03-14 01:30:29,200 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-03-14 01:30:29,203 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:30:29,203 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:30:29,607 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-14 01:30:29,607 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:30:29,607 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104433878]
[2025-03-14 01:30:29,607 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104433878] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:30:29,607 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:30:29,607 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:30:29,608 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560394125]
[2025-03-14 01:30:29,608 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:30:29,609 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-14 01:30:29,609 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:30:29,609 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-14 01:30:29,610 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-14 01:30:29,855 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 231 out of 305
[2025-03-14 01:30:29,857 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 253 transitions, 520 flow. Second operand  has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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-14 01:30:29,857 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:30:29,857 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 305
[2025-03-14 01:30:29,857 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:30:30,076 INFO  L124   PetriNetUnfolderBase]: 424/1608 cut-off events.
[2025-03-14 01:30:30,077 INFO  L125   PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES.
[2025-03-14 01:30:30,080 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 1608 events. 424/1608 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10227 event pairs, 423 based on Foata normal form. 0/1505 useless extension candidates. Maximal degree in co-relation 2337. Up to 755 conditions per place. 
[2025-03-14 01:30:30,086 INFO  L140   encePairwiseOnDemand]: 299/305 looper letters, 44 selfloop transitions, 5 changer transitions 0/252 dead transitions.
[2025-03-14 01:30:30,086 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 252 transitions, 616 flow
[2025-03-14 01:30:30,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-14 01:30:30,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-14 01:30:30,088 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1436 transitions.
[2025-03-14 01:30:30,089 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.7846994535519126
[2025-03-14 01:30:30,089 INFO  L175             Difference]: Start difference. First operand has 271 places, 253 transitions, 520 flow. Second operand 6 states and 1436 transitions.
[2025-03-14 01:30:30,089 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 252 transitions, 616 flow
[2025-03-14 01:30:30,092 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 252 transitions, 606 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-03-14 01:30:30,096 INFO  L231             Difference]: Finished difference. Result has 258 places, 252 transitions, 518 flow
[2025-03-14 01:30:30,098 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=258, PETRI_TRANSITIONS=252}
[2025-03-14 01:30:30,099 INFO  L279   CegarLoopForPetriNet]: 295 programPoint places, -37 predicate places.
[2025-03-14 01:30:30,099 INFO  L471      AbstractCegarLoop]: Abstraction has has 258 places, 252 transitions, 518 flow
[2025-03-14 01:30:30,100 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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-14 01:30:30,100 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:30:30,100 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-14 01:30:30,100 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-14 01:30:30,100 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-14 01:30:30,101 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:30:30,101 INFO  L85        PathProgramCache]: Analyzing trace with hash -1197698700, now seen corresponding path program 1 times
[2025-03-14 01:30:30,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:30:30,101 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924203791]
[2025-03-14 01:30:30,102 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:30:30,102 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:30:30,131 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes.
[2025-03-14 01:30:30,137 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements.
[2025-03-14 01:30:30,137 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:30:30,137 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:30:30,401 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-14 01:30:30,402 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:30:30,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924203791]
[2025-03-14 01:30:30,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924203791] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:30:30,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:30:30,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:30:30,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649299018]
[2025-03-14 01:30:30,402 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:30:30,402 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-14 01:30:30,402 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:30:30,403 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-14 01:30:30,403 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-14 01:30:30,740 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 249 out of 305
[2025-03-14 01:30:30,742 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 252 transitions, 518 flow. Second operand  has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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-14 01:30:30,742 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:30:30,742 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 305
[2025-03-14 01:30:30,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:30:30,871 INFO  L124   PetriNetUnfolderBase]: 232/817 cut-off events.
[2025-03-14 01:30:30,872 INFO  L125   PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES.
[2025-03-14 01:30:30,873 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 817 events. 232/817 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3895 event pairs, 210 based on Foata normal form. 0/789 useless extension candidates. Maximal degree in co-relation 1195. Up to 415 conditions per place. 
[2025-03-14 01:30:30,875 INFO  L140   encePairwiseOnDemand]: 297/305 looper letters, 28 selfloop transitions, 7 changer transitions 0/255 dead transitions.
[2025-03-14 01:30:30,875 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 255 transitions, 595 flow
[2025-03-14 01:30:30,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-14 01:30:30,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-14 01:30:30,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1530 transitions.
[2025-03-14 01:30:30,878 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8360655737704918
[2025-03-14 01:30:30,878 INFO  L175             Difference]: Start difference. First operand has 258 places, 252 transitions, 518 flow. Second operand 6 states and 1530 transitions.
[2025-03-14 01:30:30,878 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 255 transitions, 595 flow
[2025-03-14 01:30:30,879 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 255 transitions, 585 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-03-14 01:30:30,884 INFO  L231             Difference]: Finished difference. Result has 258 places, 254 transitions, 536 flow
[2025-03-14 01:30:30,885 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=536, PETRI_PLACES=258, PETRI_TRANSITIONS=254}
[2025-03-14 01:30:30,885 INFO  L279   CegarLoopForPetriNet]: 295 programPoint places, -37 predicate places.
[2025-03-14 01:30:30,886 INFO  L471      AbstractCegarLoop]: Abstraction has has 258 places, 254 transitions, 536 flow
[2025-03-14 01:30:30,886 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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-14 01:30:30,886 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:30:30,887 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:30:30,887 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-14 01:30:30,887 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-14 01:30:30,887 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:30:30,888 INFO  L85        PathProgramCache]: Analyzing trace with hash 770905336, now seen corresponding path program 1 times
[2025-03-14 01:30:30,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:30:30,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916471279]
[2025-03-14 01:30:30,888 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:30:30,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:30:30,907 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes.
[2025-03-14 01:30:30,918 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements.
[2025-03-14 01:30:30,918 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:30:30,918 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:30:31,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-03-14 01:30:31,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:30:31,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916471279]
[2025-03-14 01:30:31,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916471279] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:30:31,215 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:30:31,215 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:30:31,215 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123460810]
[2025-03-14 01:30:31,215 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:30:31,215 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-14 01:30:31,216 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:30:31,217 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-14 01:30:31,217 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-14 01:30:31,510 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 249 out of 305
[2025-03-14 01:30:31,512 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 254 transitions, 536 flow. Second operand  has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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-14 01:30:31,512 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:30:31,512 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 305
[2025-03-14 01:30:31,512 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:30:31,643 INFO  L124   PetriNetUnfolderBase]: 232/816 cut-off events.
[2025-03-14 01:30:31,643 INFO  L125   PetriNetUnfolderBase]: For 80/84 co-relation queries the response was YES.
[2025-03-14 01:30:31,645 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 816 events. 232/816 cut-off events. For 80/84 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3891 event pairs, 210 based on Foata normal form. 2/791 useless extension candidates. Maximal degree in co-relation 1001. Up to 415 conditions per place. 
[2025-03-14 01:30:31,648 INFO  L140   encePairwiseOnDemand]: 297/305 looper letters, 28 selfloop transitions, 7 changer transitions 0/254 dead transitions.
[2025-03-14 01:30:31,649 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 254 transitions, 607 flow
[2025-03-14 01:30:31,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-14 01:30:31,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-14 01:30:31,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1530 transitions.
[2025-03-14 01:30:31,653 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8360655737704918
[2025-03-14 01:30:31,653 INFO  L175             Difference]: Start difference. First operand has 258 places, 254 transitions, 536 flow. Second operand 6 states and 1530 transitions.
[2025-03-14 01:30:31,653 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 254 transitions, 607 flow
[2025-03-14 01:30:31,655 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 254 transitions, 597 flow, removed 0 selfloop flow, removed 4 redundant places.
[2025-03-14 01:30:31,657 INFO  L231             Difference]: Finished difference. Result has 258 places, 253 transitions, 538 flow
[2025-03-14 01:30:31,658 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=258, PETRI_TRANSITIONS=253}
[2025-03-14 01:30:31,659 INFO  L279   CegarLoopForPetriNet]: 295 programPoint places, -37 predicate places.
[2025-03-14 01:30:31,659 INFO  L471      AbstractCegarLoop]: Abstraction has has 258 places, 253 transitions, 538 flow
[2025-03-14 01:30:31,660 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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-14 01:30:31,660 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:30:31,660 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]
[2025-03-14 01:30:31,660 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-14 01:30:31,660 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-14 01:30:31,662 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:30:31,662 INFO  L85        PathProgramCache]: Analyzing trace with hash -1360502104, now seen corresponding path program 1 times
[2025-03-14 01:30:31,662 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:30:31,662 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951440260]
[2025-03-14 01:30:31,662 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:30:31,662 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:30:31,683 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-03-14 01:30:31,690 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-03-14 01:30:31,690 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:30:31,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:30:31,737 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-03-14 01:30:31,737 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:30:31,738 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951440260]
[2025-03-14 01:30:31,738 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951440260] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:30:31,738 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:30:31,738 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:30:31,738 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989081924]
[2025-03-14 01:30:31,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:30:31,738 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:30:31,738 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:30:31,739 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:30:31,739 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:30:31,753 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 262 out of 305
[2025-03-14 01:30:31,754 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 253 transitions, 538 flow. Second operand  has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-14 01:30:31,754 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:30:31,754 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 305
[2025-03-14 01:30:31,754 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:30:31,814 INFO  L124   PetriNetUnfolderBase]: 65/533 cut-off events.
[2025-03-14 01:30:31,814 INFO  L125   PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES.
[2025-03-14 01:30:31,816 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 737 conditions, 533 events. 65/533 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2179 event pairs, 40 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 291. Up to 130 conditions per place. 
[2025-03-14 01:30:31,818 INFO  L140   encePairwiseOnDemand]: 302/305 looper letters, 19 selfloop transitions, 2 changer transitions 0/252 dead transitions.
[2025-03-14 01:30:31,818 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 252 transitions, 578 flow
[2025-03-14 01:30:31,818 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:30:31,818 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:30:31,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions.
[2025-03-14 01:30:31,819 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8797814207650273
[2025-03-14 01:30:31,820 INFO  L175             Difference]: Start difference. First operand has 258 places, 253 transitions, 538 flow. Second operand 3 states and 805 transitions.
[2025-03-14 01:30:31,820 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 252 transitions, 578 flow
[2025-03-14 01:30:31,821 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 252 transitions, 564 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-03-14 01:30:31,823 INFO  L231             Difference]: Finished difference. Result has 254 places, 252 transitions, 526 flow
[2025-03-14 01:30:31,823 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=254, PETRI_TRANSITIONS=252}
[2025-03-14 01:30:31,824 INFO  L279   CegarLoopForPetriNet]: 295 programPoint places, -41 predicate places.
[2025-03-14 01:30:31,824 INFO  L471      AbstractCegarLoop]: Abstraction has has 254 places, 252 transitions, 526 flow
[2025-03-14 01:30:31,824 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-14 01:30:31,824 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:30:31,824 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]
[2025-03-14 01:30:31,824 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-14 01:30:31,825 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-14 01:30:31,825 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:30:31,825 INFO  L85        PathProgramCache]: Analyzing trace with hash -117261809, now seen corresponding path program 1 times
[2025-03-14 01:30:31,825 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:30:31,825 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637004517]
[2025-03-14 01:30:31,825 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:30:31,825 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:30:31,841 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-03-14 01:30:31,867 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-03-14 01:30:31,867 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:30:31,867 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:30:31,903 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-14 01:30:31,903 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:30:31,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637004517]
[2025-03-14 01:30:31,904 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637004517] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:30:31,904 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:30:31,904 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:30:31,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264796268]
[2025-03-14 01:30:31,904 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:30:31,904 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:30:31,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:30:31,905 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:30:31,905 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:30:31,916 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 263 out of 305
[2025-03-14 01:30:31,917 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 252 transitions, 526 flow. Second operand  has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-14 01:30:31,917 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:30:31,918 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 305
[2025-03-14 01:30:31,918 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:30:31,986 INFO  L124   PetriNetUnfolderBase]: 67/474 cut-off events.
[2025-03-14 01:30:31,987 INFO  L125   PetriNetUnfolderBase]: For 39/41 co-relation queries the response was YES.
[2025-03-14 01:30:31,988 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 663 conditions, 474 events. 67/474 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1718 event pairs, 45 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 497. Up to 128 conditions per place. 
[2025-03-14 01:30:31,989 INFO  L140   encePairwiseOnDemand]: 302/305 looper letters, 21 selfloop transitions, 2 changer transitions 0/254 dead transitions.
[2025-03-14 01:30:31,989 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 254 transitions, 578 flow
[2025-03-14 01:30:31,990 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:30:31,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:30:31,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions.
[2025-03-14 01:30:31,992 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8852459016393442
[2025-03-14 01:30:31,992 INFO  L175             Difference]: Start difference. First operand has 254 places, 252 transitions, 526 flow. Second operand 3 states and 810 transitions.
[2025-03-14 01:30:31,992 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 254 transitions, 578 flow
[2025-03-14 01:30:31,994 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 254 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-14 01:30:31,996 INFO  L231             Difference]: Finished difference. Result has 253 places, 251 transitions, 524 flow
[2025-03-14 01:30:31,996 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=253, PETRI_TRANSITIONS=251}
[2025-03-14 01:30:31,996 INFO  L279   CegarLoopForPetriNet]: 295 programPoint places, -42 predicate places.
[2025-03-14 01:30:31,997 INFO  L471      AbstractCegarLoop]: Abstraction has has 253 places, 251 transitions, 524 flow
[2025-03-14 01:30:31,997 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-14 01:30:31,997 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:30:31,997 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]
[2025-03-14 01:30:31,997 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-14 01:30:31,997 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-14 01:30:31,998 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:30:31,998 INFO  L85        PathProgramCache]: Analyzing trace with hash -1320388840, now seen corresponding path program 1 times
[2025-03-14 01:30:31,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:30:31,998 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669239510]
[2025-03-14 01:30:31,998 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:30:31,998 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:30:32,019 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-03-14 01:30:32,025 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-03-14 01:30:32,025 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:30:32,025 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:30:32,083 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-03-14 01:30:32,083 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:30:32,083 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669239510]
[2025-03-14 01:30:32,084 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669239510] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:30:32,084 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:30:32,084 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:30:32,084 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737730559]
[2025-03-14 01:30:32,084 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:30:32,085 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:30:32,086 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:30:32,086 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:30:32,086 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:30:32,092 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 267 out of 305
[2025-03-14 01:30:32,093 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 251 transitions, 524 flow. Second operand  has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 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-14 01:30:32,093 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:30:32,093 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 305
[2025-03-14 01:30:32,093 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:30:32,168 INFO  L124   PetriNetUnfolderBase]: 75/555 cut-off events.
[2025-03-14 01:30:32,169 INFO  L125   PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES.
[2025-03-14 01:30:32,171 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 753 conditions, 555 events. 75/555 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1837 event pairs, 18 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 577. Up to 90 conditions per place. 
[2025-03-14 01:30:32,173 INFO  L140   encePairwiseOnDemand]: 303/305 looper letters, 20 selfloop transitions, 1 changer transitions 0/256 dead transitions.
[2025-03-14 01:30:32,173 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 256 transitions, 580 flow
[2025-03-14 01:30:32,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:30:32,173 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:30:32,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 821 transitions.
[2025-03-14 01:30:32,175 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8972677595628415
[2025-03-14 01:30:32,175 INFO  L175             Difference]: Start difference. First operand has 253 places, 251 transitions, 524 flow. Second operand 3 states and 821 transitions.
[2025-03-14 01:30:32,175 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 256 transitions, 580 flow
[2025-03-14 01:30:32,176 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 256 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-14 01:30:32,178 INFO  L231             Difference]: Finished difference. Result has 252 places, 250 transitions, 520 flow
[2025-03-14 01:30:32,178 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=252, PETRI_TRANSITIONS=250}
[2025-03-14 01:30:32,179 INFO  L279   CegarLoopForPetriNet]: 295 programPoint places, -43 predicate places.
[2025-03-14 01:30:32,179 INFO  L471      AbstractCegarLoop]: Abstraction has has 252 places, 250 transitions, 520 flow
[2025-03-14 01:30:32,180 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 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-14 01:30:32,180 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:30:32,180 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]
[2025-03-14 01:30:32,180 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-14 01:30:32,180 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-14 01:30:32,180 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:30:32,180 INFO  L85        PathProgramCache]: Analyzing trace with hash -68707559, now seen corresponding path program 1 times
[2025-03-14 01:30:32,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:30:32,180 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693824238]
[2025-03-14 01:30:32,180 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:30:32,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:30:32,199 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes.
[2025-03-14 01:30:32,207 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements.
[2025-03-14 01:30:32,207 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:30:32,207 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:30:32,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-03-14 01:30:32,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:30:32,240 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693824238]
[2025-03-14 01:30:32,240 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693824238] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:30:32,240 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:30:32,240 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:30:32,240 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295810696]
[2025-03-14 01:30:32,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:30:32,241 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:30:32,241 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:30:32,242 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:30:32,242 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:30:32,251 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 264 out of 305
[2025-03-14 01:30:32,253 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 250 transitions, 520 flow. Second operand  has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-14 01:30:32,253 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:30:32,253 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 305
[2025-03-14 01:30:32,253 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:30:32,314 INFO  L124   PetriNetUnfolderBase]: 64/680 cut-off events.
[2025-03-14 01:30:32,314 INFO  L125   PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES.
[2025-03-14 01:30:32,316 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 865 conditions, 680 events. 64/680 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2668 event pairs, 44 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 715. Up to 130 conditions per place. 
[2025-03-14 01:30:32,318 INFO  L140   encePairwiseOnDemand]: 301/305 looper letters, 18 selfloop transitions, 2 changer transitions 0/251 dead transitions.
[2025-03-14 01:30:32,318 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 251 transitions, 563 flow
[2025-03-14 01:30:32,319 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:30:32,319 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:30:32,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions.
[2025-03-14 01:30:32,320 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8874316939890711
[2025-03-14 01:30:32,320 INFO  L175             Difference]: Start difference. First operand has 252 places, 250 transitions, 520 flow. Second operand 3 states and 812 transitions.
[2025-03-14 01:30:32,320 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 251 transitions, 563 flow
[2025-03-14 01:30:32,321 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 251 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-14 01:30:32,325 INFO  L231             Difference]: Finished difference. Result has 252 places, 250 transitions, 529 flow
[2025-03-14 01:30:32,326 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=252, PETRI_TRANSITIONS=250}
[2025-03-14 01:30:32,327 INFO  L279   CegarLoopForPetriNet]: 295 programPoint places, -43 predicate places.
[2025-03-14 01:30:32,328 INFO  L471      AbstractCegarLoop]: Abstraction has has 252 places, 250 transitions, 529 flow
[2025-03-14 01:30:32,328 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-14 01:30:32,328 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:30:32,329 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-14 01:30:32,329 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-14 01:30:32,329 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-14 01:30:32,329 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:30:32,329 INFO  L85        PathProgramCache]: Analyzing trace with hash 1010476882, now seen corresponding path program 1 times
[2025-03-14 01:30:32,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:30:32,330 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135665662]
[2025-03-14 01:30:32,330 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:30:32,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:30:32,353 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-03-14 01:30:32,361 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-03-14 01:30:32,361 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:30:32,361 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:30:32,673 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-03-14 01:30:32,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:30:32,674 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135665662]
[2025-03-14 01:30:32,674 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135665662] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:30:32,674 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:30:32,674 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:30:32,674 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342963895]
[2025-03-14 01:30:32,675 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:30:32,675 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-14 01:30:32,675 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:30:32,675 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-14 01:30:32,676 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-14 01:30:32,965 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 232 out of 305
[2025-03-14 01:30:32,967 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 250 transitions, 529 flow. Second operand  has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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-14 01:30:32,967 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:30:32,967 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 305
[2025-03-14 01:30:32,967 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:30:33,211 INFO  L124   PetriNetUnfolderBase]: 578/1724 cut-off events.
[2025-03-14 01:30:33,211 INFO  L125   PetriNetUnfolderBase]: For 171/180 co-relation queries the response was YES.
[2025-03-14 01:30:33,215 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3004 conditions, 1724 events. 578/1724 cut-off events. For 171/180 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 9894 event pairs, 347 based on Foata normal form. 0/1644 useless extension candidates. Maximal degree in co-relation 2473. Up to 943 conditions per place. 
[2025-03-14 01:30:33,220 INFO  L140   encePairwiseOnDemand]: 292/305 looper letters, 50 selfloop transitions, 30 changer transitions 0/279 dead transitions.
[2025-03-14 01:30:33,220 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 279 transitions, 763 flow
[2025-03-14 01:30:33,221 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-14 01:30:33,221 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-14 01:30:33,222 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1471 transitions.
[2025-03-14 01:30:33,223 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8038251366120218
[2025-03-14 01:30:33,223 INFO  L175             Difference]: Start difference. First operand has 252 places, 250 transitions, 529 flow. Second operand 6 states and 1471 transitions.
[2025-03-14 01:30:33,223 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 279 transitions, 763 flow
[2025-03-14 01:30:33,224 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 279 transitions, 763 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-03-14 01:30:33,228 INFO  L231             Difference]: Finished difference. Result has 262 places, 279 transitions, 747 flow
[2025-03-14 01:30:33,228 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=747, PETRI_PLACES=262, PETRI_TRANSITIONS=279}
[2025-03-14 01:30:33,229 INFO  L279   CegarLoopForPetriNet]: 295 programPoint places, -33 predicate places.
[2025-03-14 01:30:33,229 INFO  L471      AbstractCegarLoop]: Abstraction has has 262 places, 279 transitions, 747 flow
[2025-03-14 01:30:33,230 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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-14 01:30:33,230 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:30:33,230 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-14 01:30:33,230 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-14 01:30:33,230 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-14 01:30:33,231 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:30:33,231 INFO  L85        PathProgramCache]: Analyzing trace with hash -375758158, now seen corresponding path program 1 times
[2025-03-14 01:30:33,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:30:33,231 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208282180]
[2025-03-14 01:30:33,231 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:30:33,231 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:30:33,246 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-03-14 01:30:33,252 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-03-14 01:30:33,252 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:30:33,252 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:30:33,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-03-14 01:30:33,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:30:33,282 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208282180]
[2025-03-14 01:30:33,282 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208282180] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:30:33,282 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:30:33,282 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:30:33,282 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773574792]
[2025-03-14 01:30:33,282 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:30:33,282 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:30:33,282 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:30:33,283 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:30:33,283 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:30:33,294 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 263 out of 305
[2025-03-14 01:30:33,295 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 279 transitions, 747 flow. Second operand  has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 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-14 01:30:33,295 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:30:33,295 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 305
[2025-03-14 01:30:33,295 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:30:33,439 INFO  L124   PetriNetUnfolderBase]: 332/1161 cut-off events.
[2025-03-14 01:30:33,440 INFO  L125   PetriNetUnfolderBase]: For 608/629 co-relation queries the response was YES.
[2025-03-14 01:30:33,442 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2594 conditions, 1161 events. 332/1161 cut-off events. For 608/629 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6045 event pairs, 99 based on Foata normal form. 2/1126 useless extension candidates. Maximal degree in co-relation 2135. Up to 403 conditions per place. 
[2025-03-14 01:30:33,445 INFO  L140   encePairwiseOnDemand]: 302/305 looper letters, 50 selfloop transitions, 2 changer transitions 0/286 dead transitions.
[2025-03-14 01:30:33,445 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 286 transitions, 885 flow
[2025-03-14 01:30:33,446 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:30:33,446 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:30:33,447 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions.
[2025-03-14 01:30:33,447 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8885245901639345
[2025-03-14 01:30:33,447 INFO  L175             Difference]: Start difference. First operand has 262 places, 279 transitions, 747 flow. Second operand 3 states and 813 transitions.
[2025-03-14 01:30:33,447 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 286 transitions, 885 flow
[2025-03-14 01:30:33,453 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 286 transitions, 869 flow, removed 8 selfloop flow, removed 0 redundant places.
[2025-03-14 01:30:33,456 INFO  L231             Difference]: Finished difference. Result has 263 places, 278 transitions, 733 flow
[2025-03-14 01:30:33,457 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=733, PETRI_PLACES=263, PETRI_TRANSITIONS=278}
[2025-03-14 01:30:33,457 INFO  L279   CegarLoopForPetriNet]: 295 programPoint places, -32 predicate places.
[2025-03-14 01:30:33,457 INFO  L471      AbstractCegarLoop]: Abstraction has has 263 places, 278 transitions, 733 flow
[2025-03-14 01:30:33,458 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 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-14 01:30:33,458 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:30:33,458 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:30:33,458 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-14 01:30:33,458 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-14 01:30:33,458 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:30:33,458 INFO  L85        PathProgramCache]: Analyzing trace with hash 436136059, now seen corresponding path program 1 times
[2025-03-14 01:30:33,458 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:30:33,459 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279394923]
[2025-03-14 01:30:33,459 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:30:33,459 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:30:33,476 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes.
[2025-03-14 01:30:33,484 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements.
[2025-03-14 01:30:33,484 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:30:33,484 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:30:33,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-03-14 01:30:33,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:30:33,820 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279394923]
[2025-03-14 01:30:33,820 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279394923] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:30:33,820 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:30:33,820 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:30:33,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042717994]
[2025-03-14 01:30:33,820 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:30:33,820 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-14 01:30:33,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:30:33,820 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-14 01:30:33,820 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-14 01:30:34,105 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 232 out of 305
[2025-03-14 01:30:34,106 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 278 transitions, 733 flow. Second operand  has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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-14 01:30:34,107 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:30:34,107 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 305
[2025-03-14 01:30:34,107 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:30:34,473 INFO  L124   PetriNetUnfolderBase]: 828/2332 cut-off events.
[2025-03-14 01:30:34,473 INFO  L125   PetriNetUnfolderBase]: For 1076/1100 co-relation queries the response was YES.
[2025-03-14 01:30:34,480 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5280 conditions, 2332 events. 828/2332 cut-off events. For 1076/1100 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 14694 event pairs, 419 based on Foata normal form. 0/2248 useless extension candidates. Maximal degree in co-relation 5026. Up to 1225 conditions per place. 
[2025-03-14 01:30:34,487 INFO  L140   encePairwiseOnDemand]: 292/305 looper letters, 74 selfloop transitions, 30 changer transitions 0/307 dead transitions.
[2025-03-14 01:30:34,488 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 307 transitions, 1063 flow
[2025-03-14 01:30:34,488 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-14 01:30:34,488 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-14 01:30:34,490 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1471 transitions.
[2025-03-14 01:30:34,490 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8038251366120218
[2025-03-14 01:30:34,490 INFO  L175             Difference]: Start difference. First operand has 263 places, 278 transitions, 733 flow. Second operand 6 states and 1471 transitions.
[2025-03-14 01:30:34,490 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 307 transitions, 1063 flow
[2025-03-14 01:30:34,493 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 307 transitions, 1059 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-14 01:30:34,496 INFO  L231             Difference]: Finished difference. Result has 271 places, 307 transitions, 995 flow
[2025-03-14 01:30:34,496 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=995, PETRI_PLACES=271, PETRI_TRANSITIONS=307}
[2025-03-14 01:30:34,496 INFO  L279   CegarLoopForPetriNet]: 295 programPoint places, -24 predicate places.
[2025-03-14 01:30:34,497 INFO  L471      AbstractCegarLoop]: Abstraction has has 271 places, 307 transitions, 995 flow
[2025-03-14 01:30:34,497 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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-14 01:30:34,497 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:30:34,498 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:30:34,498 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-14 01:30:34,498 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-14 01:30:34,498 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:30:34,498 INFO  L85        PathProgramCache]: Analyzing trace with hash -1716192315, now seen corresponding path program 1 times
[2025-03-14 01:30:34,498 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:30:34,499 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867129883]
[2025-03-14 01:30:34,499 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:30:34,499 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:30:34,514 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes.
[2025-03-14 01:30:34,520 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements.
[2025-03-14 01:30:34,521 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:30:34,521 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:30:34,830 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-03-14 01:30:34,830 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:30:34,831 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867129883]
[2025-03-14 01:30:34,831 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867129883] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:30:34,831 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:30:34,831 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:30:34,831 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318138040]
[2025-03-14 01:30:34,831 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:30:34,831 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-14 01:30:34,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:30:34,832 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-14 01:30:34,832 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-14 01:30:35,145 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 241 out of 305
[2025-03-14 01:30:35,147 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 307 transitions, 995 flow. Second operand  has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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-14 01:30:35,147 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:30:35,147 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 305
[2025-03-14 01:30:35,147 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:30:35,571 INFO  L124   PetriNetUnfolderBase]: 925/2856 cut-off events.
[2025-03-14 01:30:35,572 INFO  L125   PetriNetUnfolderBase]: For 2135/2171 co-relation queries the response was YES.
[2025-03-14 01:30:35,581 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7371 conditions, 2856 events. 925/2856 cut-off events. For 2135/2171 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 19881 event pairs, 307 based on Foata normal form. 0/2738 useless extension candidates. Maximal degree in co-relation 6285. Up to 1290 conditions per place. 
[2025-03-14 01:30:35,593 INFO  L140   encePairwiseOnDemand]: 288/305 looper letters, 96 selfloop transitions, 27 changer transitions 0/336 dead transitions.
[2025-03-14 01:30:35,593 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 336 transitions, 1415 flow
[2025-03-14 01:30:35,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-14 01:30:35,597 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-14 01:30:35,598 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1517 transitions.
[2025-03-14 01:30:35,599 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8289617486338798
[2025-03-14 01:30:35,599 INFO  L175             Difference]: Start difference. First operand has 271 places, 307 transitions, 995 flow. Second operand 6 states and 1517 transitions.
[2025-03-14 01:30:35,600 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 336 transitions, 1415 flow
[2025-03-14 01:30:35,606 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 336 transitions, 1351 flow, removed 32 selfloop flow, removed 0 redundant places.
[2025-03-14 01:30:35,608 INFO  L231             Difference]: Finished difference. Result has 280 places, 328 transitions, 1187 flow
[2025-03-14 01:30:35,609 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1187, PETRI_PLACES=280, PETRI_TRANSITIONS=328}
[2025-03-14 01:30:35,610 INFO  L279   CegarLoopForPetriNet]: 295 programPoint places, -15 predicate places.
[2025-03-14 01:30:35,610 INFO  L471      AbstractCegarLoop]: Abstraction has has 280 places, 328 transitions, 1187 flow
[2025-03-14 01:30:35,611 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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-14 01:30:35,611 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:30:35,611 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]
[2025-03-14 01:30:35,611 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-14 01:30:35,611 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-14 01:30:35,611 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:30:35,612 INFO  L85        PathProgramCache]: Analyzing trace with hash -1563886253, now seen corresponding path program 1 times
[2025-03-14 01:30:35,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:30:35,612 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247610682]
[2025-03-14 01:30:35,612 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:30:35,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:30:35,632 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-03-14 01:30:35,640 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-03-14 01:30:35,641 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:30:35,642 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:30:35,965 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-03-14 01:30:35,965 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:30:35,965 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247610682]
[2025-03-14 01:30:35,965 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247610682] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:30:35,965 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:30:35,965 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:30:35,965 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143731756]
[2025-03-14 01:30:35,965 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:30:35,965 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-14 01:30:35,966 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:30:35,966 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-14 01:30:35,966 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-14 01:30:36,264 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 241 out of 305
[2025-03-14 01:30:36,266 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 328 transitions, 1187 flow. Second operand  has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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-14 01:30:36,266 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:30:36,266 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 305
[2025-03-14 01:30:36,266 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:30:36,865 INFO  L124   PetriNetUnfolderBase]: 1209/3460 cut-off events.
[2025-03-14 01:30:36,865 INFO  L125   PetriNetUnfolderBase]: For 4790/5018 co-relation queries the response was YES.
[2025-03-14 01:30:36,877 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10167 conditions, 3460 events. 1209/3460 cut-off events. For 4790/5018 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 24895 event pairs, 352 based on Foata normal form. 10/3338 useless extension candidates. Maximal degree in co-relation 8769. Up to 1593 conditions per place. 
[2025-03-14 01:30:36,888 INFO  L140   encePairwiseOnDemand]: 288/305 looper letters, 110 selfloop transitions, 39 changer transitions 37/373 dead transitions.
[2025-03-14 01:30:36,888 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 373 transitions, 1883 flow
[2025-03-14 01:30:36,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-14 01:30:36,889 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-14 01:30:36,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1517 transitions.
[2025-03-14 01:30:36,891 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8289617486338798
[2025-03-14 01:30:36,891 INFO  L175             Difference]: Start difference. First operand has 280 places, 328 transitions, 1187 flow. Second operand 6 states and 1517 transitions.
[2025-03-14 01:30:36,891 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 373 transitions, 1883 flow
[2025-03-14 01:30:36,898 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 373 transitions, 1851 flow, removed 16 selfloop flow, removed 0 redundant places.
[2025-03-14 01:30:36,901 INFO  L231             Difference]: Finished difference. Result has 289 places, 328 transitions, 1574 flow
[2025-03-14 01:30:36,902 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1574, PETRI_PLACES=289, PETRI_TRANSITIONS=328}
[2025-03-14 01:30:36,903 INFO  L279   CegarLoopForPetriNet]: 295 programPoint places, -6 predicate places.
[2025-03-14 01:30:36,903 INFO  L471      AbstractCegarLoop]: Abstraction has has 289 places, 328 transitions, 1574 flow
[2025-03-14 01:30:36,903 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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-14 01:30:36,903 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:30:36,903 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:30:36,904 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-14 01:30:36,904 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-14 01:30:36,904 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:30:36,904 INFO  L85        PathProgramCache]: Analyzing trace with hash -1623307407, now seen corresponding path program 1 times
[2025-03-14 01:30:36,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:30:36,904 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425163095]
[2025-03-14 01:30:36,904 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:30:36,905 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:30:36,924 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-03-14 01:30:36,931 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-03-14 01:30:36,933 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:30:36,933 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:30:37,010 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-03-14 01:30:37,011 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:30:37,011 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425163095]
[2025-03-14 01:30:37,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425163095] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:30:37,012 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:30:37,012 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:30:37,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249626996]
[2025-03-14 01:30:37,012 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:30:37,012 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-14 01:30:37,012 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:30:37,013 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-14 01:30:37,013 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-14 01:30:37,034 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 259 out of 305
[2025-03-14 01:30:37,035 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 328 transitions, 1574 flow. Second operand  has 5 states, 5 states have (on average 261.2) internal successors, (1306), 5 states have internal predecessors, (1306), 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-14 01:30:37,035 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:30:37,035 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 305
[2025-03-14 01:30:37,035 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:30:37,197 INFO  L124   PetriNetUnfolderBase]: 167/614 cut-off events.
[2025-03-14 01:30:37,198 INFO  L125   PetriNetUnfolderBase]: For 1270/1332 co-relation queries the response was YES.
[2025-03-14 01:30:37,200 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 614 events. 167/614 cut-off events. For 1270/1332 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3064 event pairs, 15 based on Foata normal form. 6/607 useless extension candidates. Maximal degree in co-relation 1612. Up to 179 conditions per place. 
[2025-03-14 01:30:37,201 INFO  L140   encePairwiseOnDemand]: 300/305 looper letters, 43 selfloop transitions, 4 changer transitions 0/178 dead transitions.
[2025-03-14 01:30:37,202 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 178 transitions, 702 flow
[2025-03-14 01:30:37,202 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-14 01:30:37,202 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-14 01:30:37,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1596 transitions.
[2025-03-14 01:30:37,204 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8721311475409836
[2025-03-14 01:30:37,205 INFO  L175             Difference]: Start difference. First operand has 289 places, 328 transitions, 1574 flow. Second operand 6 states and 1596 transitions.
[2025-03-14 01:30:37,205 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 178 transitions, 702 flow
[2025-03-14 01:30:37,206 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 178 transitions, 562 flow, removed 70 selfloop flow, removed 3 redundant places.
[2025-03-14 01:30:37,208 INFO  L231             Difference]: Finished difference. Result has 176 places, 150 transitions, 348 flow
[2025-03-14 01:30:37,208 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=176, PETRI_TRANSITIONS=150}
[2025-03-14 01:30:37,208 INFO  L279   CegarLoopForPetriNet]: 295 programPoint places, -119 predicate places.
[2025-03-14 01:30:37,208 INFO  L471      AbstractCegarLoop]: Abstraction has has 176 places, 150 transitions, 348 flow
[2025-03-14 01:30:37,209 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 261.2) internal successors, (1306), 5 states have internal predecessors, (1306), 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-14 01:30:37,209 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:30:37,209 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]
[2025-03-14 01:30:37,209 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-14 01:30:37,209 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] ===
[2025-03-14 01:30:37,210 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:30:37,210 INFO  L85        PathProgramCache]: Analyzing trace with hash -544523988, now seen corresponding path program 1 times
[2025-03-14 01:30:37,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:30:37,210 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457775303]
[2025-03-14 01:30:37,210 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:30:37,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:30:37,229 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes.
[2025-03-14 01:30:37,235 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements.
[2025-03-14 01:30:37,236 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:30:37,236 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:30:37,281 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-03-14 01:30:37,281 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:30:37,281 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457775303]
[2025-03-14 01:30:37,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457775303] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:30:37,281 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:30:37,282 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:30:37,282 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110241781]
[2025-03-14 01:30:37,282 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:30:37,282 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:30:37,282 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:30:37,283 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:30:37,283 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:30:37,287 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 267 out of 305
[2025-03-14 01:30:37,288 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 150 transitions, 348 flow. Second operand  has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 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-14 01:30:37,288 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:30:37,288 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 305
[2025-03-14 01:30:37,288 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:30:37,331 INFO  L124   PetriNetUnfolderBase]: 39/300 cut-off events.
[2025-03-14 01:30:37,331 INFO  L125   PetriNetUnfolderBase]: For 60/81 co-relation queries the response was YES.
[2025-03-14 01:30:37,332 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 525 conditions, 300 events. 39/300 cut-off events. For 60/81 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 932 event pairs, 23 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 503. Up to 76 conditions per place. 
[2025-03-14 01:30:37,333 INFO  L140   encePairwiseOnDemand]: 303/305 looper letters, 0 selfloop transitions, 0 changer transitions 152/152 dead transitions.
[2025-03-14 01:30:37,333 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 152 transitions, 394 flow
[2025-03-14 01:30:37,333 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:30:37,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:30:37,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions.
[2025-03-14 01:30:37,334 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.892896174863388
[2025-03-14 01:30:37,335 INFO  L175             Difference]: Start difference. First operand has 176 places, 150 transitions, 348 flow. Second operand 3 states and 817 transitions.
[2025-03-14 01:30:37,335 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 152 transitions, 394 flow
[2025-03-14 01:30:37,335 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 152 transitions, 387 flow, removed 0 selfloop flow, removed 4 redundant places.
[2025-03-14 01:30:37,336 INFO  L231             Difference]: Finished difference. Result has 173 places, 0 transitions, 0 flow
[2025-03-14 01:30:37,336 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=173, PETRI_TRANSITIONS=0}
[2025-03-14 01:30:37,337 INFO  L279   CegarLoopForPetriNet]: 295 programPoint places, -122 predicate places.
[2025-03-14 01:30:37,337 INFO  L471      AbstractCegarLoop]: Abstraction has has 173 places, 0 transitions, 0 flow
[2025-03-14 01:30:37,337 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 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-14 01:30:37,339 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (28 of 29 remaining)
[2025-03-14 01:30:37,339 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining)
[2025-03-14 01:30:37,340 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining)
[2025-03-14 01:30:37,340 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining)
[2025-03-14 01:30:37,340 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining)
[2025-03-14 01:30:37,340 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining)
[2025-03-14 01:30:37,340 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining)
[2025-03-14 01:30:37,340 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining)
[2025-03-14 01:30:37,340 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining)
[2025-03-14 01:30:37,340 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining)
[2025-03-14 01:30:37,340 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining)
[2025-03-14 01:30:37,340 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining)
[2025-03-14 01:30:37,341 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining)
[2025-03-14 01:30:37,341 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-14 01:30:37,341 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:30:37,346 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-03-14 01:30:37,346 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-14 01:30:37,352 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:30:37 BasicIcfg
[2025-03-14 01:30:37,352 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-14 01:30:37,352 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-14 01:30:37,352 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-14 01:30:37,352 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-14 01:30:37,353 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:30:27" (3/4) ...
[2025-03-14 01:30:37,355 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-14 01:30:37,357 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback
[2025-03-14 01:30:37,363 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges
[2025-03-14 01:30:37,363 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges
[2025-03-14 01:30:37,363 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-14 01:30:37,363 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-14 01:30:37,441 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-14 01:30:37,442 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-14 01:30:37,442 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-14 01:30:37,442 INFO  L158              Benchmark]: Toolchain (without parser) took 11333.58ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 102.9MB in the beginning and 512.3MB in the end (delta: -409.4MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB.
[2025-03-14 01:30:37,443 INFO  L158              Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-14 01:30:37,443 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 520.64ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 71.0MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-03-14 01:30:37,443 INFO  L158              Benchmark]: Boogie Procedure Inliner took 45.67ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 67.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-14 01:30:37,444 INFO  L158              Benchmark]: Boogie Preprocessor took 36.69ms. Allocated memory is still 142.6MB. Free memory was 67.9MB in the beginning and 64.7MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-14 01:30:37,444 INFO  L158              Benchmark]: IcfgBuilder took 725.78ms. Allocated memory is still 142.6MB. Free memory was 64.7MB in the beginning and 91.6MB in the end (delta: -26.9MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB.
[2025-03-14 01:30:37,444 INFO  L158              Benchmark]: TraceAbstraction took 9909.39ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 90.8MB in the beginning and 520.7MB in the end (delta: -429.8MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB.
[2025-03-14 01:30:37,444 INFO  L158              Benchmark]: Witness Printer took 89.50ms. Allocated memory is still 604.0MB. Free memory was 520.7MB in the beginning and 512.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-14 01:30:37,445 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.40ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 520.64ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 71.0MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 45.67ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 67.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 36.69ms. Allocated memory is still 142.6MB. Free memory was 67.9MB in the beginning and 64.7MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 725.78ms. Allocated memory is still 142.6MB. Free memory was 64.7MB in the beginning and 91.6MB in the end (delta: -26.9MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 9909.39ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 90.8MB in the beginning and 520.7MB in the end (delta: -429.8MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB.
 * Witness Printer took 89.50ms. Allocated memory is still 604.0MB. Free memory was 520.7MB in the beginning and 512.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: 3923]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3924]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3925]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3926]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3931]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3933]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3942]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3964]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3943]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3934]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3965]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3960]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3966]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3961]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3967]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3904]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3908]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3911]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 3914]: 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 4 procedures, 312 locations, 29 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.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1642 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 901 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 676 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3559 IncrementalHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 676 mSolverCounterUnsat, 135 mSDtfsCounter, 3559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1574occurred in iteration=13, InterpolantAutomatonStates: 72, 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, 3.1s InterpolantComputationTime, 1266 NumberOfCodeBlocks, 1266 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1251 ConstructedInterpolants, 0 QuantifiedInterpolants, 1989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 102/102 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
    19 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-03-14 01:30:37,461 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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