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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a
[2025-02-08 05:39:03,041 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-08 05:39:03,046 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-08 05:39:03,048 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-08 05:39:03,049 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-08 05:39:03,049 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-08 05:39:03,049 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c
[2025-02-08 05:39:04,140 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a162b545f/82dec4dbda3f4887a1cf43c5e7501d11/FLAG4cd442d13
[2025-02-08 05:39:04,385 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-08 05:39:04,386 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c
[2025-02-08 05:39:04,393 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a162b545f/82dec4dbda3f4887a1cf43c5e7501d11/FLAG4cd442d13
[2025-02-08 05:39:04,700 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a162b545f/82dec4dbda3f4887a1cf43c5e7501d11
[2025-02-08 05:39:04,703 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-08 05:39:04,704 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-08 05:39:04,707 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-08 05:39:04,708 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-08 05:39:04,711 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-08 05:39:04,711 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:04" (1/1) ...
[2025-02-08 05:39:04,712 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@503fb929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:04, skipping insertion in model container
[2025-02-08 05:39:04,712 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:04" (1/1) ...
[2025-02-08 05:39:04,727 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-08 05:39:04,853 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 05:39:04,859 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-08 05:39:04,886 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 05:39:04,901 INFO  L204         MainTranslator]: Completed translation
[2025-02-08 05:39:04,901 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:04 WrapperNode
[2025-02-08 05:39:04,901 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-08 05:39:04,902 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-08 05:39:04,902 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-08 05:39:04,902 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-08 05:39:04,908 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:04" (1/1) ...
[2025-02-08 05:39:04,914 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:04" (1/1) ...
[2025-02-08 05:39:04,938 INFO  L138                Inliner]: procedures = 22, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 305
[2025-02-08 05:39:04,939 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-08 05:39:04,939 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-08 05:39:04,939 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-08 05:39:04,939 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-08 05:39:04,945 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:04" (1/1) ...
[2025-02-08 05:39:04,945 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:04" (1/1) ...
[2025-02-08 05:39:04,951 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:04" (1/1) ...
[2025-02-08 05:39:04,951 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:04" (1/1) ...
[2025-02-08 05:39:04,960 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:04" (1/1) ...
[2025-02-08 05:39:04,962 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:04" (1/1) ...
[2025-02-08 05:39:04,969 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:04" (1/1) ...
[2025-02-08 05:39:04,969 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:04" (1/1) ...
[2025-02-08 05:39:04,971 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-08 05:39:04,972 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-08 05:39:04,972 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-08 05:39:04,972 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-08 05:39:04,975 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:04" (1/1) ...
[2025-02-08 05:39:04,979 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-08 05:39:04,988 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 05:39:04,999 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-08 05:39:05,003 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-08 05:39:05,019 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-08 05:39:05,020 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2025-02-08 05:39:05,020 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2025-02-08 05:39:05,020 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2025-02-08 05:39:05,020 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2025-02-08 05:39:05,020 INFO  L130     BoogieDeclarations]: Found specification of procedure thread3
[2025-02-08 05:39:05,020 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread3
[2025-02-08 05:39:05,020 INFO  L130     BoogieDeclarations]: Found specification of procedure thread4
[2025-02-08 05:39:05,020 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread4
[2025-02-08 05:39:05,021 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-02-08 05:39:05,021 INFO  L130     BoogieDeclarations]: Found specification of procedure thread5
[2025-02-08 05:39:05,021 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread5
[2025-02-08 05:39:05,021 INFO  L130     BoogieDeclarations]: Found specification of procedure thread6
[2025-02-08 05:39:05,022 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread6
[2025-02-08 05:39:05,022 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-08 05:39:05,022 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-08 05:39:05,023 WARN  L227             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-02-08 05:39:05,107 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-08 05:39:05,108 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-08 05:39:05,461 INFO  L304             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-02-08 05:39:05,461 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-08 05:39:05,499 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-08 05:39:05,502 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-08 05:39:05,503 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:05 BoogieIcfgContainer
[2025-02-08 05:39:05,504 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-08 05:39:05,506 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-08 05:39:05,506 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-08 05:39:05,509 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-08 05:39:05,510 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:04" (1/3) ...
[2025-02-08 05:39:05,510 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc6e203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:05, skipping insertion in model container
[2025-02-08 05:39:05,510 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:04" (2/3) ...
[2025-02-08 05:39:05,511 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc6e203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:39:05, skipping insertion in model container
[2025-02-08 05:39:05,511 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:39:05" (3/3) ...
[2025-02-08 05:39:05,513 INFO  L128   eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c
[2025-02-08 05:39:05,523 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-08 05:39:05,527 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-barrier-loop.wvr.c that has 7 procedures, 379 locations, 1 initial locations, 4 loop locations, and 24 error locations.
[2025-02-08 05:39:05,527 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-02-08 05:39:05,639 INFO  L143    ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions.
[2025-02-08 05:39:05,678 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 405 places, 408 transitions, 882 flow
[2025-02-08 05:39:05,794 INFO  L124   PetriNetUnfolderBase]: 22/394 cut-off events.
[2025-02-08 05:39:05,795 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2025-02-08 05:39:05,802 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 423 conditions, 394 events. 22/394 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 935 event pairs, 0 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 335. Up to 3 conditions per place. 
[2025-02-08 05:39:05,802 INFO  L82        GeneralOperation]: Start removeDead. Operand has 405 places, 408 transitions, 882 flow
[2025-02-08 05:39:05,807 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 375 places, 377 transitions, 799 flow
[2025-02-08 05:39:05,813 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-08 05:39:05,823 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;@527c9fd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-08 05:39:05,825 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 50 error locations.
[2025-02-08 05:39:05,833 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-02-08 05:39:05,836 INFO  L124   PetriNetUnfolderBase]: 0/43 cut-off events.
[2025-02-08 05:39:05,836 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-02-08 05:39:05,836 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:39:05,837 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]
[2025-02-08 05:39:05,837 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:39:05,841 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:39:05,842 INFO  L85        PathProgramCache]: Analyzing trace with hash -2097858830, now seen corresponding path program 1 times
[2025-02-08 05:39:05,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:39:05,846 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664829467]
[2025-02-08 05:39:05,847 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:39:05,849 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:39:05,899 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes.
[2025-02-08 05:39:05,906 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements.
[2025-02-08 05:39:05,906 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:39:05,906 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:39:05,964 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:39:05,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:39:05,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664829467]
[2025-02-08 05:39:05,965 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664829467] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:39:05,965 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:39:05,965 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:39:05,966 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700234333]
[2025-02-08 05:39:05,969 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:39:05,978 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:39:05,981 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:39:05,996 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:39:05,996 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:39:06,026 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412
[2025-02-08 05:39:06,032 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 377 transitions, 799 flow. Second operand  has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:39:06,032 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:39:06,032 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412
[2025-02-08 05:39:06,034 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:39:10,841 INFO  L124   PetriNetUnfolderBase]: 7436/38733 cut-off events.
[2025-02-08 05:39:10,842 INFO  L125   PetriNetUnfolderBase]: For 4083/4083 co-relation queries the response was YES.
[2025-02-08 05:39:11,022 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51805 conditions, 38733 events. 7436/38733 cut-off events. For 4083/4083 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 530486 event pairs, 4596 based on Foata normal form. 3874/35792 useless extension candidates. Maximal degree in co-relation 50913. Up to 9448 conditions per place. 
[2025-02-08 05:39:11,241 INFO  L140   encePairwiseOnDemand]: 396/412 looper letters, 48 selfloop transitions, 2 changer transitions 1/363 dead transitions.
[2025-02-08 05:39:11,241 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 363 transitions, 871 flow
[2025-02-08 05:39:11,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:39:11,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:39:11,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1072 transitions.
[2025-02-08 05:39:11,253 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8673139158576052
[2025-02-08 05:39:11,255 INFO  L175             Difference]: Start difference. First operand has 375 places, 377 transitions, 799 flow. Second operand 3 states and 1072 transitions.
[2025-02-08 05:39:11,255 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 363 transitions, 871 flow
[2025-02-08 05:39:11,296 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 363 transitions, 842 flow, removed 0 selfloop flow, removed 11 redundant places.
[2025-02-08 05:39:11,300 INFO  L231             Difference]: Finished difference. Result has 365 places, 362 transitions, 744 flow
[2025-02-08 05:39:11,303 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=365, PETRI_TRANSITIONS=362}
[2025-02-08 05:39:11,305 INFO  L279   CegarLoopForPetriNet]: 375 programPoint places, -10 predicate places.
[2025-02-08 05:39:11,305 INFO  L471      AbstractCegarLoop]: Abstraction has has 365 places, 362 transitions, 744 flow
[2025-02-08 05:39:11,306 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:39:11,306 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:39:11,306 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]
[2025-02-08 05:39:11,306 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-08 05:39:11,307 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:39:11,307 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:39:11,307 INFO  L85        PathProgramCache]: Analyzing trace with hash -2031014513, now seen corresponding path program 1 times
[2025-02-08 05:39:11,307 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:39:11,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145831155]
[2025-02-08 05:39:11,308 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:39:11,308 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:39:11,315 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes.
[2025-02-08 05:39:11,320 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements.
[2025-02-08 05:39:11,320 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:39:11,320 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:39:11,372 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:39:11,372 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:39:11,372 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145831155]
[2025-02-08 05:39:11,373 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145831155] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:39:11,373 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:39:11,373 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:39:11,373 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888399238]
[2025-02-08 05:39:11,373 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:39:11,374 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:39:11,374 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:39:11,374 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:39:11,374 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:39:11,398 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412
[2025-02-08 05:39:11,399 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 362 transitions, 744 flow. Second operand  has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:39:11,400 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:39:11,400 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412
[2025-02-08 05:39:11,400 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:39:15,894 INFO  L124   PetriNetUnfolderBase]: 7436/39583 cut-off events.
[2025-02-08 05:39:15,894 INFO  L125   PetriNetUnfolderBase]: For 1130/1130 co-relation queries the response was YES.
[2025-02-08 05:39:16,021 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49802 conditions, 39583 events. 7436/39583 cut-off events. For 1130/1130 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 547652 event pairs, 4596 based on Foata normal form. 0/32443 useless extension candidates. Maximal degree in co-relation 49747. Up to 9478 conditions per place. 
[2025-02-08 05:39:16,167 INFO  L140   encePairwiseOnDemand]: 409/412 looper letters, 48 selfloop transitions, 2 changer transitions 0/361 dead transitions.
[2025-02-08 05:39:16,167 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 361 transitions, 842 flow
[2025-02-08 05:39:16,167 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:39:16,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:39:16,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1059 transitions.
[2025-02-08 05:39:16,170 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8567961165048543
[2025-02-08 05:39:16,170 INFO  L175             Difference]: Start difference. First operand has 365 places, 362 transitions, 744 flow. Second operand 3 states and 1059 transitions.
[2025-02-08 05:39:16,170 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 361 transitions, 842 flow
[2025-02-08 05:39:16,172 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 361 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-08 05:39:16,175 INFO  L231             Difference]: Finished difference. Result has 363 places, 361 transitions, 742 flow
[2025-02-08 05:39:16,175 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=363, PETRI_TRANSITIONS=361}
[2025-02-08 05:39:16,176 INFO  L279   CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places.
[2025-02-08 05:39:16,176 INFO  L471      AbstractCegarLoop]: Abstraction has has 363 places, 361 transitions, 742 flow
[2025-02-08 05:39:16,176 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:39:16,177 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:39:16,177 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]
[2025-02-08 05:39:16,177 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-08 05:39:16,177 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:39:16,177 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:39:16,177 INFO  L85        PathProgramCache]: Analyzing trace with hash -663420953, now seen corresponding path program 1 times
[2025-02-08 05:39:16,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:39:16,177 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714702575]
[2025-02-08 05:39:16,178 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:39:16,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:39:16,184 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes.
[2025-02-08 05:39:16,187 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements.
[2025-02-08 05:39:16,187 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:39:16,188 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:39:16,215 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:39:16,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:39:16,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714702575]
[2025-02-08 05:39:16,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714702575] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:39:16,215 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:39:16,215 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:39:16,215 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996387944]
[2025-02-08 05:39:16,215 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:39:16,216 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:39:16,216 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:39:16,216 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:39:16,216 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:39:16,241 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412
[2025-02-08 05:39:16,243 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 361 transitions, 742 flow. Second operand  has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:39:16,243 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:39:16,244 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412
[2025-02-08 05:39:16,244 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:39:20,297 INFO  L124   PetriNetUnfolderBase]: 7676/38535 cut-off events.
[2025-02-08 05:39:20,298 INFO  L125   PetriNetUnfolderBase]: For 1288/1288 co-relation queries the response was YES.
[2025-02-08 05:39:20,419 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48904 conditions, 38535 events. 7676/38535 cut-off events. For 1288/1288 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 525805 event pairs, 4596 based on Foata normal form. 0/31649 useless extension candidates. Maximal degree in co-relation 48842. Up to 9708 conditions per place. 
[2025-02-08 05:39:20,529 INFO  L140   encePairwiseOnDemand]: 409/412 looper letters, 48 selfloop transitions, 2 changer transitions 0/360 dead transitions.
[2025-02-08 05:39:20,529 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 360 transitions, 840 flow
[2025-02-08 05:39:20,530 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:39:20,530 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:39:20,531 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1059 transitions.
[2025-02-08 05:39:20,533 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8567961165048543
[2025-02-08 05:39:20,533 INFO  L175             Difference]: Start difference. First operand has 363 places, 361 transitions, 742 flow. Second operand 3 states and 1059 transitions.
[2025-02-08 05:39:20,533 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 360 transitions, 840 flow
[2025-02-08 05:39:20,535 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 360 transitions, 836 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-08 05:39:20,537 INFO  L231             Difference]: Finished difference. Result has 362 places, 360 transitions, 740 flow
[2025-02-08 05:39:20,537 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=362, PETRI_TRANSITIONS=360}
[2025-02-08 05:39:20,538 INFO  L279   CegarLoopForPetriNet]: 375 programPoint places, -13 predicate places.
[2025-02-08 05:39:20,538 INFO  L471      AbstractCegarLoop]: Abstraction has has 362 places, 360 transitions, 740 flow
[2025-02-08 05:39:20,539 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:39:20,539 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:39:20,539 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]
[2025-02-08 05:39:20,539 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-08 05:39:20,539 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:39:20,539 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:39:20,539 INFO  L85        PathProgramCache]: Analyzing trace with hash 1863108195, now seen corresponding path program 1 times
[2025-02-08 05:39:20,539 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:39:20,539 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899404653]
[2025-02-08 05:39:20,540 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:39:20,540 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:39:20,547 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes.
[2025-02-08 05:39:20,554 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements.
[2025-02-08 05:39:20,554 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:39:20,554 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:39:20,582 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:39:20,582 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:39:20,582 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899404653]
[2025-02-08 05:39:20,582 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899404653] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:39:20,582 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:39:20,582 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:39:20,582 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027165007]
[2025-02-08 05:39:20,583 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:39:20,583 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:39:20,583 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:39:20,584 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:39:20,584 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:39:20,600 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412
[2025-02-08 05:39:20,602 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 360 transitions, 740 flow. Second operand  has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:39:20,602 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:39:20,602 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412
[2025-02-08 05:39:20,602 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:39:25,326 INFO  L124   PetriNetUnfolderBase]: 7676/38807 cut-off events.
[2025-02-08 05:39:25,327 INFO  L125   PetriNetUnfolderBase]: For 1290/1290 co-relation queries the response was YES.
[2025-02-08 05:39:25,446 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49186 conditions, 38807 events. 7676/38807 cut-off events. For 1290/1290 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 530155 event pairs, 4596 based on Foata normal form. 0/31588 useless extension candidates. Maximal degree in co-relation 49117. Up to 9718 conditions per place. 
[2025-02-08 05:39:25,702 INFO  L140   encePairwiseOnDemand]: 409/412 looper letters, 48 selfloop transitions, 2 changer transitions 0/359 dead transitions.
[2025-02-08 05:39:25,705 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 359 transitions, 838 flow
[2025-02-08 05:39:25,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:39:25,706 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:39:25,707 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1059 transitions.
[2025-02-08 05:39:25,708 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8567961165048543
[2025-02-08 05:39:25,708 INFO  L175             Difference]: Start difference. First operand has 362 places, 360 transitions, 740 flow. Second operand 3 states and 1059 transitions.
[2025-02-08 05:39:25,708 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 359 transitions, 838 flow
[2025-02-08 05:39:25,709 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 359 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-08 05:39:25,715 INFO  L231             Difference]: Finished difference. Result has 361 places, 359 transitions, 738 flow
[2025-02-08 05:39:25,716 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=361, PETRI_TRANSITIONS=359}
[2025-02-08 05:39:25,716 INFO  L279   CegarLoopForPetriNet]: 375 programPoint places, -14 predicate places.
[2025-02-08 05:39:25,716 INFO  L471      AbstractCegarLoop]: Abstraction has has 361 places, 359 transitions, 738 flow
[2025-02-08 05:39:25,717 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:39:25,717 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:39:25,717 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 05:39:25,717 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-08 05:39:25,717 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:39:25,721 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:39:25,721 INFO  L85        PathProgramCache]: Analyzing trace with hash 1130218005, now seen corresponding path program 1 times
[2025-02-08 05:39:25,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:39:25,721 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170988654]
[2025-02-08 05:39:25,721 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:39:25,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:39:25,733 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes.
[2025-02-08 05:39:25,738 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements.
[2025-02-08 05:39:25,738 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:39:25,738 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:39:25,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:39:25,807 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:39:25,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170988654]
[2025-02-08 05:39:25,808 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170988654] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:39:25,808 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:39:25,808 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:39:25,808 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452428443]
[2025-02-08 05:39:25,808 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:39:25,808 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:39:25,808 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:39:25,809 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:39:25,810 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:39:25,831 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412
[2025-02-08 05:39:25,832 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 359 transitions, 738 flow. Second operand  has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:39:25,832 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:39:25,832 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412
[2025-02-08 05:39:25,832 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:39:30,057 INFO  L124   PetriNetUnfolderBase]: 7436/38568 cut-off events.
[2025-02-08 05:39:30,058 INFO  L125   PetriNetUnfolderBase]: For 1142/1142 co-relation queries the response was YES.
[2025-02-08 05:39:30,203 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48735 conditions, 38568 events. 7436/38568 cut-off events. For 1142/1142 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 528814 event pairs, 4596 based on Foata normal form. 0/31804 useless extension candidates. Maximal degree in co-relation 48659. Up to 9450 conditions per place. 
[2025-02-08 05:39:30,332 INFO  L140   encePairwiseOnDemand]: 409/412 looper letters, 48 selfloop transitions, 2 changer transitions 0/358 dead transitions.
[2025-02-08 05:39:30,332 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 358 transitions, 836 flow
[2025-02-08 05:39:30,332 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:39:30,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:39:30,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1059 transitions.
[2025-02-08 05:39:30,337 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8567961165048543
[2025-02-08 05:39:30,338 INFO  L175             Difference]: Start difference. First operand has 361 places, 359 transitions, 738 flow. Second operand 3 states and 1059 transitions.
[2025-02-08 05:39:30,338 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 358 transitions, 836 flow
[2025-02-08 05:39:30,339 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 358 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-08 05:39:30,342 INFO  L231             Difference]: Finished difference. Result has 360 places, 358 transitions, 736 flow
[2025-02-08 05:39:30,342 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=360, PETRI_TRANSITIONS=358}
[2025-02-08 05:39:30,345 INFO  L279   CegarLoopForPetriNet]: 375 programPoint places, -15 predicate places.
[2025-02-08 05:39:30,345 INFO  L471      AbstractCegarLoop]: Abstraction has has 360 places, 358 transitions, 736 flow
[2025-02-08 05:39:30,346 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:39:30,348 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:39:30,348 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]
[2025-02-08 05:39:30,349 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-08 05:39:30,349 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:39:30,349 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:39:30,349 INFO  L85        PathProgramCache]: Analyzing trace with hash 1754022976, now seen corresponding path program 1 times
[2025-02-08 05:39:30,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:39:30,349 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638077358]
[2025-02-08 05:39:30,349 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:39:30,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:39:30,358 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes.
[2025-02-08 05:39:30,365 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements.
[2025-02-08 05:39:30,365 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:39:30,365 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:39:30,404 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:39:30,404 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:39:30,404 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638077358]
[2025-02-08 05:39:30,405 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638077358] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:39:30,405 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:39:30,405 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:39:30,405 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118996312]
[2025-02-08 05:39:30,406 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:39:30,406 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:39:30,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:39:30,407 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:39:30,407 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:39:30,419 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412
[2025-02-08 05:39:30,420 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 358 transitions, 736 flow. Second operand  has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:39:30,420 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:39:30,421 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412
[2025-02-08 05:39:30,421 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:39:34,940 INFO  L124   PetriNetUnfolderBase]: 7436/39249 cut-off events.
[2025-02-08 05:39:34,941 INFO  L125   PetriNetUnfolderBase]: For 1142/1142 co-relation queries the response was YES.
[2025-02-08 05:39:35,084 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49444 conditions, 39249 events. 7436/39249 cut-off events. For 1142/1142 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 542117 event pairs, 4596 based on Foata normal form. 0/32120 useless extension candidates. Maximal degree in co-relation 49361. Up to 9478 conditions per place. 
[2025-02-08 05:39:35,224 INFO  L140   encePairwiseOnDemand]: 409/412 looper letters, 48 selfloop transitions, 2 changer transitions 0/357 dead transitions.
[2025-02-08 05:39:35,224 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 357 transitions, 834 flow
[2025-02-08 05:39:35,224 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:39:35,224 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:39:35,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1059 transitions.
[2025-02-08 05:39:35,226 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8567961165048543
[2025-02-08 05:39:35,226 INFO  L175             Difference]: Start difference. First operand has 360 places, 358 transitions, 736 flow. Second operand 3 states and 1059 transitions.
[2025-02-08 05:39:35,226 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 357 transitions, 834 flow
[2025-02-08 05:39:35,228 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 357 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-08 05:39:35,230 INFO  L231             Difference]: Finished difference. Result has 359 places, 357 transitions, 734 flow
[2025-02-08 05:39:35,231 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=359, PETRI_TRANSITIONS=357}
[2025-02-08 05:39:35,231 INFO  L279   CegarLoopForPetriNet]: 375 programPoint places, -16 predicate places.
[2025-02-08 05:39:35,231 INFO  L471      AbstractCegarLoop]: Abstraction has has 359 places, 357 transitions, 734 flow
[2025-02-08 05:39:35,232 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:39:35,232 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:39:35,232 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]
[2025-02-08 05:39:35,232 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-08 05:39:35,232 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:39:35,232 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:39:35,233 INFO  L85        PathProgramCache]: Analyzing trace with hash -1952052191, now seen corresponding path program 1 times
[2025-02-08 05:39:35,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:39:35,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247731393]
[2025-02-08 05:39:35,233 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:39:35,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:39:35,238 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes.
[2025-02-08 05:39:35,240 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements.
[2025-02-08 05:39:35,240 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:39:35,240 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:39:35,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:39:35,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:39:35,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247731393]
[2025-02-08 05:39:35,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247731393] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:39:35,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:39:35,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:39:35,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530178905]
[2025-02-08 05:39:35,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:39:35,263 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:39:35,264 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:39:35,264 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:39:35,264 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:39:35,275 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412
[2025-02-08 05:39:35,277 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 357 transitions, 734 flow. Second operand  has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:39:35,277 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:39:35,277 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412
[2025-02-08 05:39:35,277 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-08 05:39:39,604 INFO  L124   PetriNetUnfolderBase]: 7676/38233 cut-off events.
[2025-02-08 05:39:39,604 INFO  L125   PetriNetUnfolderBase]: For 1302/1302 co-relation queries the response was YES.
[2025-02-08 05:39:39,721 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48586 conditions, 38233 events. 7676/38233 cut-off events. For 1302/1302 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 522313 event pairs, 4596 based on Foata normal form. 0/31406 useless extension candidates. Maximal degree in co-relation 48496. Up to 9716 conditions per place. 
[2025-02-08 05:39:39,841 INFO  L140   encePairwiseOnDemand]: 409/412 looper letters, 48 selfloop transitions, 2 changer transitions 0/356 dead transitions.
[2025-02-08 05:39:39,841 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 356 transitions, 832 flow
[2025-02-08 05:39:39,843 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 05:39:39,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-08 05:39:39,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1059 transitions.
[2025-02-08 05:39:39,845 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8567961165048543
[2025-02-08 05:39:39,845 INFO  L175             Difference]: Start difference. First operand has 359 places, 357 transitions, 734 flow. Second operand 3 states and 1059 transitions.
[2025-02-08 05:39:39,845 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 356 transitions, 832 flow
[2025-02-08 05:39:39,846 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 356 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-08 05:39:39,848 INFO  L231             Difference]: Finished difference. Result has 358 places, 356 transitions, 732 flow
[2025-02-08 05:39:39,849 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=358, PETRI_TRANSITIONS=356}
[2025-02-08 05:39:39,849 INFO  L279   CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places.
[2025-02-08 05:39:39,849 INFO  L471      AbstractCegarLoop]: Abstraction has has 358 places, 356 transitions, 732 flow
[2025-02-08 05:39:39,850 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:39:39,850 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-08 05:39:39,850 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]
[2025-02-08 05:39:39,850 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-08 05:39:39,850 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-08 05:39:39,851 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 05:39:39,851 INFO  L85        PathProgramCache]: Analyzing trace with hash -268495395, now seen corresponding path program 1 times
[2025-02-08 05:39:39,851 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 05:39:39,851 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730403650]
[2025-02-08 05:39:39,851 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 05:39:39,851 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 05:39:39,856 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-02-08 05:39:39,858 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-02-08 05:39:39,858 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 05:39:39,858 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 05:39:39,888 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-08 05:39:39,889 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 05:39:39,889 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730403650]
[2025-02-08 05:39:39,889 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730403650] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 05:39:39,889 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 05:39:39,889 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 05:39:39,889 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706396763]
[2025-02-08 05:39:39,889 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 05:39:39,889 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 05:39:39,890 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 05:39:39,890 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 05:39:39,890 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 05:39:39,902 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 336 out of 412
[2025-02-08 05:39:39,903 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 356 transitions, 732 flow. Second operand  has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-08 05:39:39,904 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-08 05:39:39,904 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 412
[2025-02-08 05:39:39,904 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand