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


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


Checking for data races
Using default analysis
Version c00e63dc
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/popl20-more-array-sum.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 e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-06 09:31:35,224 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-06 09:31:35,306 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2025-02-06 09:31:35,316 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-06 09:31:35,316 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-06 09:31:35,345 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-06 09:31:35,346 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-06 09:31:35,347 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-06 09:31:35,347 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-06 09:31:35,348 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-06 09:31:35,348 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-06 09:31:35,349 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-06 09:31:35,349 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-06 09:31:35,349 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-06 09:31:35,349 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-06 09:31:35,349 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-06 09:31:35,349 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-06 09:31:35,350 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-06 09:31:35,350 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-06 09:31:35,350 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-06 09:31:35,351 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-06 09:31:35,351 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-06 09:31:35,351 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2025-02-06 09:31:35,351 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-02-06 09:31:35,351 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-06 09:31:35,351 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-06 09:31:35,351 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-06 09:31:35,351 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-06 09:31:35,351 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-06 09:31:35,351 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-06 09:31:35,351 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-06 09:31:35,352 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 09:31:35,352 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-06 09:31:35,352 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-06 09:31:35,352 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-06 09:31:35,353 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-06 09:31:35,353 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-06 09:31:35,353 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-06 09:31:35,353 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-06 09:31:35,353 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-06 09:31:35,353 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-06 09:31:35,353 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-06 09:31:35,353 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 -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1
[2025-02-06 09:31:35,651 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-06 09:31:35,662 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-06 09:31:35,665 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-06 09:31:35,666 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-06 09:31:35,666 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-06 09:31:35,667 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c
[2025-02-06 09:31:36,989 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0aa811d80/c470c1d58c344b7c96ba730a35bc8f4b/FLAG5f995a6ce
[2025-02-06 09:31:37,256 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-06 09:31:37,257 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c
[2025-02-06 09:31:37,264 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0aa811d80/c470c1d58c344b7c96ba730a35bc8f4b/FLAG5f995a6ce
[2025-02-06 09:31:37,277 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0aa811d80/c470c1d58c344b7c96ba730a35bc8f4b
[2025-02-06 09:31:37,279 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-06 09:31:37,280 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-06 09:31:37,281 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-06 09:31:37,281 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-06 09:31:37,285 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-06 09:31:37,286 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:31:37" (1/1) ...
[2025-02-06 09:31:37,287 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ede652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:37, skipping insertion in model container
[2025-02-06 09:31:37,287 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:31:37" (1/1) ...
[2025-02-06 09:31:37,301 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-06 09:31:37,527 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 09:31:37,543 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-06 09:31:37,581 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-06 09:31:37,602 INFO  L204         MainTranslator]: Completed translation
[2025-02-06 09:31:37,603 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:37 WrapperNode
[2025-02-06 09:31:37,603 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-06 09:31:37,604 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-06 09:31:37,604 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-06 09:31:37,605 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-06 09:31:37,610 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:37" (1/1) ...
[2025-02-06 09:31:37,620 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:37" (1/1) ...
[2025-02-06 09:31:37,668 INFO  L138                Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 359
[2025-02-06 09:31:37,672 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-06 09:31:37,672 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-06 09:31:37,673 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-06 09:31:37,673 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-06 09:31:37,680 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:37" (1/1) ...
[2025-02-06 09:31:37,681 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:37" (1/1) ...
[2025-02-06 09:31:37,690 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:37" (1/1) ...
[2025-02-06 09:31:37,690 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:37" (1/1) ...
[2025-02-06 09:31:37,715 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:37" (1/1) ...
[2025-02-06 09:31:37,717 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:37" (1/1) ...
[2025-02-06 09:31:37,722 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:37" (1/1) ...
[2025-02-06 09:31:37,724 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:37" (1/1) ...
[2025-02-06 09:31:37,731 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-06 09:31:37,735 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-06 09:31:37,735 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-06 09:31:37,735 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-06 09:31:37,736 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:37" (1/1) ...
[2025-02-06 09:31:37,741 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-06 09:31:37,753 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-06 09:31:37,770 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-06 09:31:37,774 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-06 09:31:37,792 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-06 09:31:37,792 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2025-02-06 09:31:37,792 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2025-02-06 09:31:37,792 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2025-02-06 09:31:37,792 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2025-02-06 09:31:37,793 INFO  L130     BoogieDeclarations]: Found specification of procedure thread3
[2025-02-06 09:31:37,793 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread3
[2025-02-06 09:31:37,793 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-02-06 09:31:37,793 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2025-02-06 09:31:37,793 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2025-02-06 09:31:37,793 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-06 09:31:37,793 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-06 09:31:37,793 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2025-02-06 09:31:37,794 WARN  L227             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-02-06 09:31:37,887 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-06 09:31:37,889 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-06 09:31:38,486 INFO  L304             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-02-06 09:31:38,486 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-06 09:31:38,528 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-06 09:31:38,529 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-06 09:31:38,529 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:31:38 BoogieIcfgContainer
[2025-02-06 09:31:38,529 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-06 09:31:38,535 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-06 09:31:38,535 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-06 09:31:38,540 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-06 09:31:38,540 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:31:37" (1/3) ...
[2025-02-06 09:31:38,541 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d46c0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:31:38, skipping insertion in model container
[2025-02-06 09:31:38,541 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:37" (2/3) ...
[2025-02-06 09:31:38,541 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d46c0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:31:38, skipping insertion in model container
[2025-02-06 09:31:38,542 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:31:38" (3/3) ...
[2025-02-06 09:31:38,543 INFO  L128   eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c
[2025-02-06 09:31:38,564 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-06 09:31:38,565 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 474 locations, 1 initial locations, 5 loop locations, and 30 error locations.
[2025-02-06 09:31:38,565 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-02-06 09:31:38,752 INFO  L143    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2025-02-06 09:31:38,800 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 483 places, 500 transitions, 1021 flow
[2025-02-06 09:31:38,988 INFO  L124   PetriNetUnfolderBase]: 27/497 cut-off events.
[2025-02-06 09:31:38,990 INFO  L125   PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2025-02-06 09:31:39,007 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 510 conditions, 497 events. 27/497 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1039 event pairs, 0 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 380. Up to 2 conditions per place. 
[2025-02-06 09:31:39,008 INFO  L82        GeneralOperation]: Start removeDead. Operand has 483 places, 500 transitions, 1021 flow
[2025-02-06 09:31:39,021 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 464 places, 480 transitions, 978 flow
[2025-02-06 09:31:39,030 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-06 09:31:39,046 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;@632c5aa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-06 09:31:39,047 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 51 error locations.
[2025-02-06 09:31:39,052 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-02-06 09:31:39,052 INFO  L124   PetriNetUnfolderBase]: 0/23 cut-off events.
[2025-02-06 09:31:39,052 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-02-06 09:31:39,055 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:39,056 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]
[2025-02-06 09:31:39,056 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:39,061 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:39,061 INFO  L85        PathProgramCache]: Analyzing trace with hash -79264842, now seen corresponding path program 1 times
[2025-02-06 09:31:39,068 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:39,069 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533865051]
[2025-02-06 09:31:39,070 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:39,071 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:39,138 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-02-06 09:31:39,150 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-02-06 09:31:39,150 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:39,150 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:39,228 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-06 09:31:39,230 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:39,231 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533865051]
[2025-02-06 09:31:39,231 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533865051] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:39,231 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:39,232 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:31:39,233 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389165844]
[2025-02-06 09:31:39,233 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:39,240 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:31:39,244 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:39,260 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:31:39,261 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:31:39,301 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 459 out of 500
[2025-02-06 09:31:39,307 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 480 transitions, 978 flow. Second operand  has 3 states, 3 states have (on average 460.3333333333333) internal successors, (1381), 3 states have internal predecessors, (1381), 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-06 09:31:39,307 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:39,307 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 500
[2025-02-06 09:31:39,310 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:39,674 INFO  L124   PetriNetUnfolderBase]: 36/1189 cut-off events.
[2025-02-06 09:31:39,674 INFO  L125   PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES.
[2025-02-06 09:31:39,688 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 1189 events. 36/1189 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5525 event pairs, 20 based on Foata normal form. 101/1149 useless extension candidates. Maximal degree in co-relation 979. Up to 58 conditions per place. 
[2025-02-06 09:31:39,694 INFO  L140   encePairwiseOnDemand]: 477/500 looper letters, 15 selfloop transitions, 2 changer transitions 5/459 dead transitions.
[2025-02-06 09:31:39,695 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 459 transitions, 970 flow
[2025-02-06 09:31:39,696 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:31:39,698 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:31:39,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1415 transitions.
[2025-02-06 09:31:39,718 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9433333333333334
[2025-02-06 09:31:39,720 INFO  L175             Difference]: Start difference. First operand has 464 places, 480 transitions, 978 flow. Second operand 3 states and 1415 transitions.
[2025-02-06 09:31:39,721 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 459 transitions, 970 flow
[2025-02-06 09:31:39,731 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 459 transitions, 958 flow, removed 0 selfloop flow, removed 6 redundant places.
[2025-02-06 09:31:39,743 INFO  L231             Difference]: Finished difference. Result has 459 places, 454 transitions, 918 flow
[2025-02-06 09:31:39,746 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=459, PETRI_TRANSITIONS=454}
[2025-02-06 09:31:39,753 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -5 predicate places.
[2025-02-06 09:31:39,753 INFO  L471      AbstractCegarLoop]: Abstraction has has 459 places, 454 transitions, 918 flow
[2025-02-06 09:31:39,755 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 460.3333333333333) internal successors, (1381), 3 states have internal predecessors, (1381), 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-06 09:31:39,755 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:39,755 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:31:39,755 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-06 09:31:39,755 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:39,756 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:39,756 INFO  L85        PathProgramCache]: Analyzing trace with hash 880253268, now seen corresponding path program 1 times
[2025-02-06 09:31:39,756 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:39,756 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247027231]
[2025-02-06 09:31:39,756 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:39,756 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:39,771 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-02-06 09:31:39,781 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-02-06 09:31:39,781 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:39,781 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:39,833 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-06 09:31:39,833 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:39,833 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247027231]
[2025-02-06 09:31:39,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247027231] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:39,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:39,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:31:39,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444748536]
[2025-02-06 09:31:39,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:39,835 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:31:39,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:39,835 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:31:39,835 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:31:39,875 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 458 out of 500
[2025-02-06 09:31:39,877 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 454 transitions, 918 flow. Second operand  has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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-06 09:31:39,877 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:39,877 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 500
[2025-02-06 09:31:39,877 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:40,162 INFO  L124   PetriNetUnfolderBase]: 39/1139 cut-off events.
[2025-02-06 09:31:40,162 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2025-02-06 09:31:40,177 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 1139 events. 39/1139 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5027 event pairs, 23 based on Foata normal form. 0/996 useless extension candidates. Maximal degree in co-relation 1187. Up to 66 conditions per place. 
[2025-02-06 09:31:40,184 INFO  L140   encePairwiseOnDemand]: 497/500 looper letters, 16 selfloop transitions, 2 changer transitions 0/453 dead transitions.
[2025-02-06 09:31:40,184 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 453 transitions, 952 flow
[2025-02-06 09:31:40,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:31:40,185 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:31:40,188 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1393 transitions.
[2025-02-06 09:31:40,189 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9286666666666666
[2025-02-06 09:31:40,190 INFO  L175             Difference]: Start difference. First operand has 459 places, 454 transitions, 918 flow. Second operand 3 states and 1393 transitions.
[2025-02-06 09:31:40,190 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 453 transitions, 952 flow
[2025-02-06 09:31:40,193 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 453 transitions, 948 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:31:40,200 INFO  L231             Difference]: Finished difference. Result has 453 places, 453 transitions, 916 flow
[2025-02-06 09:31:40,201 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=916, PETRI_PLACES=453, PETRI_TRANSITIONS=453}
[2025-02-06 09:31:40,202 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -11 predicate places.
[2025-02-06 09:31:40,202 INFO  L471      AbstractCegarLoop]: Abstraction has has 453 places, 453 transitions, 916 flow
[2025-02-06 09:31:40,203 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 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-06 09:31:40,203 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:40,203 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]
[2025-02-06 09:31:40,203 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-06 09:31:40,203 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:40,204 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:40,204 INFO  L85        PathProgramCache]: Analyzing trace with hash -1831804540, now seen corresponding path program 1 times
[2025-02-06 09:31:40,204 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:40,204 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008393326]
[2025-02-06 09:31:40,204 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:40,204 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:40,215 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-02-06 09:31:40,219 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-02-06 09:31:40,219 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:40,219 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:40,266 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-06 09:31:40,266 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:40,266 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008393326]
[2025-02-06 09:31:40,266 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008393326] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:40,266 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:40,266 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:31:40,266 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502465217]
[2025-02-06 09:31:40,266 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:40,266 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:31:40,267 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:40,267 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:31:40,267 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:31:40,290 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 454 out of 500
[2025-02-06 09:31:40,292 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 453 transitions, 916 flow. Second operand  has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 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-06 09:31:40,292 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:40,292 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 500
[2025-02-06 09:31:40,292 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:40,631 INFO  L124   PetriNetUnfolderBase]: 68/1410 cut-off events.
[2025-02-06 09:31:40,631 INFO  L125   PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES.
[2025-02-06 09:31:40,655 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 1410 events. 68/1410 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7406 event pairs, 45 based on Foata normal form. 0/1241 useless extension candidates. Maximal degree in co-relation 1498. Up to 111 conditions per place. 
[2025-02-06 09:31:40,665 INFO  L140   encePairwiseOnDemand]: 494/500 looper letters, 18 selfloop transitions, 1 changer transitions 0/448 dead transitions.
[2025-02-06 09:31:40,665 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 448 transitions, 944 flow
[2025-02-06 09:31:40,666 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:31:40,666 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:31:40,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1386 transitions.
[2025-02-06 09:31:40,670 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.924
[2025-02-06 09:31:40,670 INFO  L175             Difference]: Start difference. First operand has 453 places, 453 transitions, 916 flow. Second operand 3 states and 1386 transitions.
[2025-02-06 09:31:40,670 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 448 transitions, 944 flow
[2025-02-06 09:31:40,674 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 448 transitions, 940 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:31:40,680 INFO  L231             Difference]: Finished difference. Result has 448 places, 448 transitions, 904 flow
[2025-02-06 09:31:40,681 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=448, PETRI_TRANSITIONS=448}
[2025-02-06 09:31:40,681 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -16 predicate places.
[2025-02-06 09:31:40,682 INFO  L471      AbstractCegarLoop]: Abstraction has has 448 places, 448 transitions, 904 flow
[2025-02-06 09:31:40,683 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 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-06 09:31:40,683 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:40,683 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]
[2025-02-06 09:31:40,683 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-06 09:31:40,684 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:40,685 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:40,685 INFO  L85        PathProgramCache]: Analyzing trace with hash -1870690529, now seen corresponding path program 1 times
[2025-02-06 09:31:40,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:40,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904010422]
[2025-02-06 09:31:40,686 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:40,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:40,705 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-02-06 09:31:40,738 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-02-06 09:31:40,738 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:40,738 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:41,366 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-06 09:31:41,366 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:41,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904010422]
[2025-02-06 09:31:41,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904010422] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:41,366 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:41,366 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 09:31:41,366 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053791480]
[2025-02-06 09:31:41,366 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:41,367 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 09:31:41,367 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:41,367 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 09:31:41,367 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-06 09:31:41,670 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 418 out of 500
[2025-02-06 09:31:41,673 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 448 transitions, 904 flow. Second operand  has 6 states, 6 states have (on average 419.5) internal successors, (2517), 6 states have internal predecessors, (2517), 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-06 09:31:41,673 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:41,673 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 500
[2025-02-06 09:31:41,674 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:44,414 INFO  L124   PetriNetUnfolderBase]: 2314/17706 cut-off events.
[2025-02-06 09:31:44,415 INFO  L125   PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES.
[2025-02-06 09:31:44,496 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21249 conditions, 17706 events. 2314/17706 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 215897 event pairs, 1879 based on Foata normal form. 0/15700 useless extension candidates. Maximal degree in co-relation 21211. Up to 3430 conditions per place. 
[2025-02-06 09:31:44,565 INFO  L140   encePairwiseOnDemand]: 488/500 looper letters, 48 selfloop transitions, 10 changer transitions 0/446 dead transitions.
[2025-02-06 09:31:44,565 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 446 transitions, 1016 flow
[2025-02-06 09:31:44,566 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 09:31:44,566 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-06 09:31:44,570 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2568 transitions.
[2025-02-06 09:31:44,572 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.856
[2025-02-06 09:31:44,572 INFO  L175             Difference]: Start difference. First operand has 448 places, 448 transitions, 904 flow. Second operand 6 states and 2568 transitions.
[2025-02-06 09:31:44,572 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 446 transitions, 1016 flow
[2025-02-06 09:31:44,575 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 446 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-02-06 09:31:44,579 INFO  L231             Difference]: Finished difference. Result has 450 places, 446 transitions, 919 flow
[2025-02-06 09:31:44,580 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=919, PETRI_PLACES=450, PETRI_TRANSITIONS=446}
[2025-02-06 09:31:44,581 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -14 predicate places.
[2025-02-06 09:31:44,581 INFO  L471      AbstractCegarLoop]: Abstraction has has 450 places, 446 transitions, 919 flow
[2025-02-06 09:31:44,583 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 419.5) internal successors, (2517), 6 states have internal predecessors, (2517), 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-06 09:31:44,583 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:44,583 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]
[2025-02-06 09:31:44,583 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-06 09:31:44,584 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:44,584 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:44,584 INFO  L85        PathProgramCache]: Analyzing trace with hash 1054026362, now seen corresponding path program 1 times
[2025-02-06 09:31:44,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:44,585 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932752297]
[2025-02-06 09:31:44,585 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:44,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:44,595 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-02-06 09:31:44,600 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-02-06 09:31:44,600 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:44,600 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:44,630 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-06 09:31:44,631 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:44,631 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932752297]
[2025-02-06 09:31:44,631 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932752297] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:44,631 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:44,631 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:31:44,631 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944460457]
[2025-02-06 09:31:44,631 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:44,632 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:31:44,632 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:44,633 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:31:44,633 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:31:44,662 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 460 out of 500
[2025-02-06 09:31:44,664 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 446 transitions, 919 flow. Second operand  has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-06 09:31:44,664 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:44,664 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 500
[2025-02-06 09:31:44,664 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:44,842 INFO  L124   PetriNetUnfolderBase]: 58/1292 cut-off events.
[2025-02-06 09:31:44,843 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2025-02-06 09:31:44,863 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 1292 events. 58/1292 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6630 event pairs, 38 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 1376. Up to 93 conditions per place. 
[2025-02-06 09:31:44,868 INFO  L140   encePairwiseOnDemand]: 497/500 looper letters, 14 selfloop transitions, 2 changer transitions 0/445 dead transitions.
[2025-02-06 09:31:44,869 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 445 transitions, 949 flow
[2025-02-06 09:31:44,869 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:31:44,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:31:44,872 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1397 transitions.
[2025-02-06 09:31:44,873 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9313333333333333
[2025-02-06 09:31:44,874 INFO  L175             Difference]: Start difference. First operand has 450 places, 446 transitions, 919 flow. Second operand 3 states and 1397 transitions.
[2025-02-06 09:31:44,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 445 transitions, 949 flow
[2025-02-06 09:31:44,881 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 445 transitions, 929 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-02-06 09:31:44,885 INFO  L231             Difference]: Finished difference. Result has 446 places, 445 transitions, 901 flow
[2025-02-06 09:31:44,886 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=446, PETRI_TRANSITIONS=445}
[2025-02-06 09:31:44,889 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -18 predicate places.
[2025-02-06 09:31:44,890 INFO  L471      AbstractCegarLoop]: Abstraction has has 446 places, 445 transitions, 901 flow
[2025-02-06 09:31:44,891 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-06 09:31:44,892 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:44,892 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]
[2025-02-06 09:31:44,892 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-06 09:31:44,892 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:44,893 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:44,895 INFO  L85        PathProgramCache]: Analyzing trace with hash -1504494366, now seen corresponding path program 1 times
[2025-02-06 09:31:44,895 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:44,895 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646481585]
[2025-02-06 09:31:44,895 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:44,895 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:44,908 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-02-06 09:31:44,915 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-02-06 09:31:44,916 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:44,916 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:44,958 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-06 09:31:44,959 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:44,959 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646481585]
[2025-02-06 09:31:44,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646481585] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:44,959 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:44,959 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:31:44,959 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887788187]
[2025-02-06 09:31:44,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:44,960 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:31:44,960 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:44,960 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:31:44,961 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:31:44,985 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 460 out of 500
[2025-02-06 09:31:44,987 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 445 transitions, 901 flow. Second operand  has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-06 09:31:44,987 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:44,988 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 500
[2025-02-06 09:31:44,988 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:45,174 INFO  L124   PetriNetUnfolderBase]: 50/1051 cut-off events.
[2025-02-06 09:31:45,174 INFO  L125   PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES.
[2025-02-06 09:31:45,186 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 1051 events. 50/1051 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4838 event pairs, 38 based on Foata normal form. 0/938 useless extension candidates. Maximal degree in co-relation 1109. Up to 81 conditions per place. 
[2025-02-06 09:31:45,190 INFO  L140   encePairwiseOnDemand]: 497/500 looper letters, 14 selfloop transitions, 2 changer transitions 0/444 dead transitions.
[2025-02-06 09:31:45,190 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 444 transitions, 931 flow
[2025-02-06 09:31:45,191 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:31:45,191 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:31:45,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1397 transitions.
[2025-02-06 09:31:45,194 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9313333333333333
[2025-02-06 09:31:45,194 INFO  L175             Difference]: Start difference. First operand has 446 places, 445 transitions, 901 flow. Second operand 3 states and 1397 transitions.
[2025-02-06 09:31:45,194 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 444 transitions, 931 flow
[2025-02-06 09:31:45,198 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 444 transitions, 927 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:31:45,202 INFO  L231             Difference]: Finished difference. Result has 445 places, 444 transitions, 899 flow
[2025-02-06 09:31:45,203 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=445, PETRI_TRANSITIONS=444}
[2025-02-06 09:31:45,205 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -19 predicate places.
[2025-02-06 09:31:45,205 INFO  L471      AbstractCegarLoop]: Abstraction has has 445 places, 444 transitions, 899 flow
[2025-02-06 09:31:45,206 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-06 09:31:45,206 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:45,206 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]
[2025-02-06 09:31:45,206 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-06 09:31:45,206 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:45,208 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:45,208 INFO  L85        PathProgramCache]: Analyzing trace with hash -1611681059, now seen corresponding path program 1 times
[2025-02-06 09:31:45,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:45,208 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923570128]
[2025-02-06 09:31:45,208 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:45,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:45,223 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-02-06 09:31:45,233 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-02-06 09:31:45,237 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:45,238 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:45,292 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-06 09:31:45,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:45,292 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923570128]
[2025-02-06 09:31:45,292 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923570128] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:45,292 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:45,292 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:31:45,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319724663]
[2025-02-06 09:31:45,292 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:45,293 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:31:45,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:45,293 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:31:45,293 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:31:45,312 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 457 out of 500
[2025-02-06 09:31:45,314 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 444 transitions, 899 flow. Second operand  has 3 states, 3 states have (on average 458.0) internal successors, (1374), 3 states have internal predecessors, (1374), 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-06 09:31:45,314 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:45,314 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 500
[2025-02-06 09:31:45,314 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:45,499 INFO  L124   PetriNetUnfolderBase]: 61/1443 cut-off events.
[2025-02-06 09:31:45,499 INFO  L125   PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES.
[2025-02-06 09:31:45,520 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 1443 events. 61/1443 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7857 event pairs, 39 based on Foata normal form. 0/1301 useless extension candidates. Maximal degree in co-relation 1510. Up to 93 conditions per place. 
[2025-02-06 09:31:45,526 INFO  L140   encePairwiseOnDemand]: 495/500 looper letters, 16 selfloop transitions, 1 changer transitions 0/440 dead transitions.
[2025-02-06 09:31:45,526 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 440 transitions, 925 flow
[2025-02-06 09:31:45,527 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:31:45,527 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:31:45,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions.
[2025-02-06 09:31:45,530 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.928
[2025-02-06 09:31:45,530 INFO  L175             Difference]: Start difference. First operand has 445 places, 444 transitions, 899 flow. Second operand 3 states and 1392 transitions.
[2025-02-06 09:31:45,530 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 440 transitions, 925 flow
[2025-02-06 09:31:45,533 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 440 transitions, 921 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:31:45,537 INFO  L231             Difference]: Finished difference. Result has 441 places, 440 transitions, 889 flow
[2025-02-06 09:31:45,538 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=889, PETRI_PLACES=441, PETRI_TRANSITIONS=440}
[2025-02-06 09:31:45,540 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -23 predicate places.
[2025-02-06 09:31:45,540 INFO  L471      AbstractCegarLoop]: Abstraction has has 441 places, 440 transitions, 889 flow
[2025-02-06 09:31:45,541 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 458.0) internal successors, (1374), 3 states have internal predecessors, (1374), 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-06 09:31:45,541 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:45,541 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:31:45,541 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-06 09:31:45,542 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:45,543 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:45,543 INFO  L85        PathProgramCache]: Analyzing trace with hash -916711640, now seen corresponding path program 1 times
[2025-02-06 09:31:45,543 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:45,543 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896244125]
[2025-02-06 09:31:45,543 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:45,544 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:45,559 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-02-06 09:31:45,570 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-02-06 09:31:45,570 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:45,570 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:45,609 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-06 09:31:45,609 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:45,609 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896244125]
[2025-02-06 09:31:45,609 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896244125] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:45,609 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:45,609 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:31:45,609 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047043885]
[2025-02-06 09:31:45,609 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:45,611 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:31:45,611 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:45,611 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:31:45,611 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:31:45,632 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 463 out of 500
[2025-02-06 09:31:45,634 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 440 transitions, 889 flow. Second operand  has 3 states, 3 states have (on average 464.0) internal successors, (1392), 3 states have internal predecessors, (1392), 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-06 09:31:45,634 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:45,634 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 500
[2025-02-06 09:31:45,634 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:45,840 INFO  L124   PetriNetUnfolderBase]: 41/1274 cut-off events.
[2025-02-06 09:31:45,841 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2025-02-06 09:31:45,853 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 1274 events. 41/1274 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5261 event pairs, 15 based on Foata normal form. 1/1149 useless extension candidates. Maximal degree in co-relation 1321. Up to 37 conditions per place. 
[2025-02-06 09:31:45,857 INFO  L140   encePairwiseOnDemand]: 495/500 looper letters, 12 selfloop transitions, 2 changer transitions 2/442 dead transitions.
[2025-02-06 09:31:45,857 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 442 transitions, 927 flow
[2025-02-06 09:31:45,858 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:31:45,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:31:45,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1407 transitions.
[2025-02-06 09:31:45,861 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.938
[2025-02-06 09:31:45,861 INFO  L175             Difference]: Start difference. First operand has 441 places, 440 transitions, 889 flow. Second operand 3 states and 1407 transitions.
[2025-02-06 09:31:45,861 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 442 transitions, 927 flow
[2025-02-06 09:31:45,864 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 442 transitions, 926 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-02-06 09:31:45,869 INFO  L231             Difference]: Finished difference. Result has 440 places, 436 transitions, 883 flow
[2025-02-06 09:31:45,869 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=883, PETRI_PLACES=440, PETRI_TRANSITIONS=436}
[2025-02-06 09:31:45,870 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -24 predicate places.
[2025-02-06 09:31:45,870 INFO  L471      AbstractCegarLoop]: Abstraction has has 440 places, 436 transitions, 883 flow
[2025-02-06 09:31:45,871 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 464.0) internal successors, (1392), 3 states have internal predecessors, (1392), 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-06 09:31:45,871 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:45,871 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:31:45,871 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-06 09:31:45,871 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:45,872 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:45,872 INFO  L85        PathProgramCache]: Analyzing trace with hash -491558647, now seen corresponding path program 1 times
[2025-02-06 09:31:45,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:45,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786230616]
[2025-02-06 09:31:45,872 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:45,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:45,882 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-02-06 09:31:45,889 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-02-06 09:31:45,889 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:45,889 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:45,928 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-06 09:31:45,928 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:45,928 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786230616]
[2025-02-06 09:31:45,928 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786230616] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:45,928 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:45,928 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:31:45,928 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337789242]
[2025-02-06 09:31:45,928 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:45,929 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:31:45,929 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:45,929 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:31:45,929 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:31:45,943 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 460 out of 500
[2025-02-06 09:31:45,945 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 436 transitions, 883 flow. Second operand  has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-06 09:31:45,945 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:45,945 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 500
[2025-02-06 09:31:45,945 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:46,407 INFO  L124   PetriNetUnfolderBase]: 185/3164 cut-off events.
[2025-02-06 09:31:46,407 INFO  L125   PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES.
[2025-02-06 09:31:46,429 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3464 conditions, 3164 events. 185/3164 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 24596 event pairs, 48 based on Foata normal form. 0/2850 useless extension candidates. Maximal degree in co-relation 3426. Up to 262 conditions per place. 
[2025-02-06 09:31:46,439 INFO  L140   encePairwiseOnDemand]: 494/500 looper letters, 18 selfloop transitions, 3 changer transitions 0/440 dead transitions.
[2025-02-06 09:31:46,439 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 440 transitions, 937 flow
[2025-02-06 09:31:46,440 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:31:46,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:31:46,442 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1404 transitions.
[2025-02-06 09:31:46,443 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.936
[2025-02-06 09:31:46,443 INFO  L175             Difference]: Start difference. First operand has 440 places, 436 transitions, 883 flow. Second operand 3 states and 1404 transitions.
[2025-02-06 09:31:46,443 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 440 transitions, 937 flow
[2025-02-06 09:31:46,446 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 440 transitions, 933 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:31:46,454 INFO  L231             Difference]: Finished difference. Result has 436 places, 436 transitions, 894 flow
[2025-02-06 09:31:46,454 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=436, PETRI_TRANSITIONS=436}
[2025-02-06 09:31:46,455 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -28 predicate places.
[2025-02-06 09:31:46,455 INFO  L471      AbstractCegarLoop]: Abstraction has has 436 places, 436 transitions, 894 flow
[2025-02-06 09:31:46,456 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 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-06 09:31:46,456 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:46,457 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:31:46,457 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-06 09:31:46,457 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:46,458 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:46,458 INFO  L85        PathProgramCache]: Analyzing trace with hash -207417588, now seen corresponding path program 1 times
[2025-02-06 09:31:46,458 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:46,458 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940937921]
[2025-02-06 09:31:46,458 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:46,458 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:46,470 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-02-06 09:31:46,478 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-02-06 09:31:46,479 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:46,479 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:46,653 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-06 09:31:46,654 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:46,654 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940937921]
[2025-02-06 09:31:46,654 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940937921] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:46,654 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:46,654 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-06 09:31:46,654 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210571212]
[2025-02-06 09:31:46,654 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:46,654 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-06 09:31:46,655 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:46,656 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-06 09:31:46,656 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-02-06 09:31:46,944 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 446 out of 500
[2025-02-06 09:31:46,948 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 436 transitions, 894 flow. Second operand  has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 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-06 09:31:46,948 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:46,948 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 500
[2025-02-06 09:31:46,948 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:47,620 INFO  L124   PetriNetUnfolderBase]: 164/3595 cut-off events.
[2025-02-06 09:31:47,620 INFO  L125   PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES.
[2025-02-06 09:31:47,635 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3964 conditions, 3595 events. 164/3595 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 25617 event pairs, 67 based on Foata normal form. 8/3274 useless extension candidates. Maximal degree in co-relation 3924. Up to 148 conditions per place. 
[2025-02-06 09:31:47,644 INFO  L140   encePairwiseOnDemand]: 479/500 looper letters, 35 selfloop transitions, 28 changer transitions 0/468 dead transitions.
[2025-02-06 09:31:47,644 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 468 transitions, 1091 flow
[2025-02-06 09:31:47,645 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-06 09:31:47,645 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2025-02-06 09:31:47,651 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4524 transitions.
[2025-02-06 09:31:47,652 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9048
[2025-02-06 09:31:47,653 INFO  L175             Difference]: Start difference. First operand has 436 places, 436 transitions, 894 flow. Second operand 10 states and 4524 transitions.
[2025-02-06 09:31:47,653 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 468 transitions, 1091 flow
[2025-02-06 09:31:47,655 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 468 transitions, 1091 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-02-06 09:31:47,659 INFO  L231             Difference]: Finished difference. Result has 449 places, 452 transitions, 1023 flow
[2025-02-06 09:31:47,660 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1023, PETRI_PLACES=449, PETRI_TRANSITIONS=452}
[2025-02-06 09:31:47,660 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -15 predicate places.
[2025-02-06 09:31:47,661 INFO  L471      AbstractCegarLoop]: Abstraction has has 449 places, 452 transitions, 1023 flow
[2025-02-06 09:31:47,662 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 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-06 09:31:47,663 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:47,663 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:31:47,663 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-06 09:31:47,663 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:47,664 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:47,664 INFO  L85        PathProgramCache]: Analyzing trace with hash -815382832, now seen corresponding path program 1 times
[2025-02-06 09:31:47,664 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:47,664 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045879020]
[2025-02-06 09:31:47,664 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:47,664 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:47,678 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes.
[2025-02-06 09:31:47,685 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements.
[2025-02-06 09:31:47,686 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:47,686 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:47,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-06 09:31:47,807 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:47,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045879020]
[2025-02-06 09:31:47,807 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045879020] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:47,807 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:47,807 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 09:31:47,807 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159514206]
[2025-02-06 09:31:47,807 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:47,808 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-06 09:31:47,808 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:47,808 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-06 09:31:47,808 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-02-06 09:31:47,867 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 457 out of 500
[2025-02-06 09:31:47,870 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 452 transitions, 1023 flow. Second operand  has 5 states, 5 states have (on average 459.0) internal successors, (2295), 5 states have internal predecessors, (2295), 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-06 09:31:47,870 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:47,870 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 500
[2025-02-06 09:31:47,870 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:48,323 INFO  L124   PetriNetUnfolderBase]: 200/2722 cut-off events.
[2025-02-06 09:31:48,324 INFO  L125   PetriNetUnfolderBase]: For 99/108 co-relation queries the response was YES.
[2025-02-06 09:31:48,367 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3217 conditions, 2722 events. 200/2722 cut-off events. For 99/108 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 19283 event pairs, 85 based on Foata normal form. 12/2478 useless extension candidates. Maximal degree in co-relation 3168. Up to 212 conditions per place. 
[2025-02-06 09:31:48,377 INFO  L140   encePairwiseOnDemand]: 494/500 looper letters, 26 selfloop transitions, 5 changer transitions 0/464 dead transitions.
[2025-02-06 09:31:48,378 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 464 transitions, 1116 flow
[2025-02-06 09:31:48,378 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-06 09:31:48,378 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2025-02-06 09:31:48,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2317 transitions.
[2025-02-06 09:31:48,382 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9268
[2025-02-06 09:31:48,382 INFO  L175             Difference]: Start difference. First operand has 449 places, 452 transitions, 1023 flow. Second operand 5 states and 2317 transitions.
[2025-02-06 09:31:48,382 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 464 transitions, 1116 flow
[2025-02-06 09:31:48,385 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 464 transitions, 1116 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-02-06 09:31:48,391 INFO  L231             Difference]: Finished difference. Result has 455 places, 454 transitions, 1048 flow
[2025-02-06 09:31:48,392 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1048, PETRI_PLACES=455, PETRI_TRANSITIONS=454}
[2025-02-06 09:31:48,393 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -9 predicate places.
[2025-02-06 09:31:48,393 INFO  L471      AbstractCegarLoop]: Abstraction has has 455 places, 454 transitions, 1048 flow
[2025-02-06 09:31:48,394 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 459.0) internal successors, (2295), 5 states have internal predecessors, (2295), 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-06 09:31:48,394 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:48,395 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:31:48,395 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-06 09:31:48,395 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:48,396 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:48,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -1715527604, now seen corresponding path program 1 times
[2025-02-06 09:31:48,396 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:48,396 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217845434]
[2025-02-06 09:31:48,396 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:48,396 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:48,413 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes.
[2025-02-06 09:31:48,422 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements.
[2025-02-06 09:31:48,423 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:48,423 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:48,835 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-06 09:31:48,835 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:48,837 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217845434]
[2025-02-06 09:31:48,837 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217845434] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:48,837 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:48,837 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 09:31:48,837 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386340141]
[2025-02-06 09:31:48,838 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:48,838 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 09:31:48,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:48,838 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 09:31:48,839 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-06 09:31:49,209 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 451 out of 500
[2025-02-06 09:31:49,212 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 454 transitions, 1048 flow. Second operand  has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 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-06 09:31:49,212 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:49,212 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 500
[2025-02-06 09:31:49,212 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:49,602 INFO  L124   PetriNetUnfolderBase]: 250/3099 cut-off events.
[2025-02-06 09:31:49,602 INFO  L125   PetriNetUnfolderBase]: For 230/241 co-relation queries the response was YES.
[2025-02-06 09:31:49,629 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3809 conditions, 3099 events. 250/3099 cut-off events. For 230/241 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 22208 event pairs, 71 based on Foata normal form. 0/2816 useless extension candidates. Maximal degree in co-relation 3759. Up to 243 conditions per place. 
[2025-02-06 09:31:49,639 INFO  L140   encePairwiseOnDemand]: 494/500 looper letters, 34 selfloop transitions, 5 changer transitions 0/465 dead transitions.
[2025-02-06 09:31:49,639 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 465 transitions, 1156 flow
[2025-02-06 09:31:49,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 09:31:49,639 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-06 09:31:49,643 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2744 transitions.
[2025-02-06 09:31:49,643 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9146666666666666
[2025-02-06 09:31:49,643 INFO  L175             Difference]: Start difference. First operand has 455 places, 454 transitions, 1048 flow. Second operand 6 states and 2744 transitions.
[2025-02-06 09:31:49,643 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 465 transitions, 1156 flow
[2025-02-06 09:31:49,647 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 465 transitions, 1151 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-02-06 09:31:49,651 INFO  L231             Difference]: Finished difference. Result has 457 places, 453 transitions, 1051 flow
[2025-02-06 09:31:49,652 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1051, PETRI_PLACES=457, PETRI_TRANSITIONS=453}
[2025-02-06 09:31:49,652 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -7 predicate places.
[2025-02-06 09:31:49,652 INFO  L471      AbstractCegarLoop]: Abstraction has has 457 places, 453 transitions, 1051 flow
[2025-02-06 09:31:49,654 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 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-06 09:31:49,654 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:49,654 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:31:49,654 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-06 09:31:49,654 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:49,655 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:49,655 INFO  L85        PathProgramCache]: Analyzing trace with hash 645449325, now seen corresponding path program 1 times
[2025-02-06 09:31:49,655 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:49,655 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975568356]
[2025-02-06 09:31:49,655 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:49,655 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:49,665 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-02-06 09:31:49,671 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-02-06 09:31:49,671 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:49,672 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:49,700 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-06 09:31:49,700 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:49,700 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975568356]
[2025-02-06 09:31:49,700 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975568356] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:49,700 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:49,700 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:31:49,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202029050]
[2025-02-06 09:31:49,700 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:49,701 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:31:49,701 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:49,701 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:31:49,701 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:31:49,713 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 460 out of 500
[2025-02-06 09:31:49,714 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 453 transitions, 1051 flow. Second operand  has 3 states, 3 states have (on average 461.6666666666667) internal successors, (1385), 3 states have internal predecessors, (1385), 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-06 09:31:49,714 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:49,714 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 500
[2025-02-06 09:31:49,714 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:50,829 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L65-32-->L65-31: Formula: (= |v_#race~A~0_9| 0)  InVars {}  OutVars{#race~A~0=|v_#race~A~0_9|}  AuxVars[]  AssignedVars[#race~A~0][226], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 553#(= |#race~B~0| 0), Black: 513#true, 494#(= |#race~N~0| 0), 157#L65-31true, 304#L86-1true, 148#L56-31true, 105#L48-35true, 517#true, 515#(= |#race~A~0| 0), Black: 523#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 545#true, Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 522#(<= ~N~0 0), 509#(= |#race~M~0| 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 541#(<= (+ ~M~0 1) 0)])
[2025-02-06 09:31:50,829 INFO  L294   olderBase$Statistics]: this new event has 335 ancestors and is cut-off event
[2025-02-06 09:31:50,830 INFO  L297   olderBase$Statistics]:   existing Event has 258 ancestors and is cut-off event
[2025-02-06 09:31:50,830 INFO  L297   olderBase$Statistics]:   existing Event has 331 ancestors and is cut-off event
[2025-02-06 09:31:50,830 INFO  L297   olderBase$Statistics]:   existing Event has 258 ancestors and is cut-off event
[2025-02-06 09:31:50,870 INFO  L124   PetriNetUnfolderBase]: 384/7928 cut-off events.
[2025-02-06 09:31:50,870 INFO  L125   PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES.
[2025-02-06 09:31:50,915 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8879 conditions, 7928 events. 384/7928 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 76231 event pairs, 98 based on Foata normal form. 0/7299 useless extension candidates. Maximal degree in co-relation 8830. Up to 490 conditions per place. 
[2025-02-06 09:31:50,935 INFO  L140   encePairwiseOnDemand]: 494/500 looper letters, 18 selfloop transitions, 3 changer transitions 0/457 dead transitions.
[2025-02-06 09:31:50,935 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 457 transitions, 1105 flow
[2025-02-06 09:31:50,936 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:31:50,936 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:31:50,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1404 transitions.
[2025-02-06 09:31:50,938 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.936
[2025-02-06 09:31:50,938 INFO  L175             Difference]: Start difference. First operand has 457 places, 453 transitions, 1051 flow. Second operand 3 states and 1404 transitions.
[2025-02-06 09:31:50,938 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 457 transitions, 1105 flow
[2025-02-06 09:31:50,943 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 457 transitions, 1095 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-02-06 09:31:50,948 INFO  L231             Difference]: Finished difference. Result has 452 places, 453 transitions, 1056 flow
[2025-02-06 09:31:50,949 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=452, PETRI_TRANSITIONS=453}
[2025-02-06 09:31:50,950 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -12 predicate places.
[2025-02-06 09:31:50,950 INFO  L471      AbstractCegarLoop]: Abstraction has has 452 places, 453 transitions, 1056 flow
[2025-02-06 09:31:50,951 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 461.6666666666667) internal successors, (1385), 3 states have internal predecessors, (1385), 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-06 09:31:50,951 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:50,951 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:31:50,951 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-06 09:31:50,952 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:50,952 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:50,952 INFO  L85        PathProgramCache]: Analyzing trace with hash 1953782133, now seen corresponding path program 1 times
[2025-02-06 09:31:50,953 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:50,953 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642777192]
[2025-02-06 09:31:50,953 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:50,953 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:50,966 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes.
[2025-02-06 09:31:50,982 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements.
[2025-02-06 09:31:50,983 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:50,983 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:51,358 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-06 09:31:51,359 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:51,359 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642777192]
[2025-02-06 09:31:51,359 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642777192] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:51,359 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:51,359 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 09:31:51,359 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383112785]
[2025-02-06 09:31:51,359 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:51,360 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 09:31:51,360 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:51,360 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 09:31:51,360 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-06 09:31:51,702 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 451 out of 500
[2025-02-06 09:31:51,704 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 453 transitions, 1056 flow. Second operand  has 6 states, 6 states have (on average 452.8333333333333) internal successors, (2717), 6 states have internal predecessors, (2717), 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-06 09:31:51,704 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:51,704 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 500
[2025-02-06 09:31:51,704 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:52,616 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L65-32-->L65-31: Formula: (= |v_#race~A~0_9| 0)  InVars {}  OutVars{#race~A~0=|v_#race~A~0_9|}  AuxVars[]  AssignedVars[#race~A~0][228], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 553#(= |#race~B~0| 0), Black: 513#true, 157#L65-31true, 494#(= |#race~N~0| 0), 555#true, 304#L86-1true, Black: 551#true, 148#L56-31true, 105#L48-35true, 517#true, 515#(= |#race~A~0| 0), Black: 523#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 522#(<= ~N~0 0), 509#(= |#race~M~0| 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 541#(<= (+ ~M~0 1) 0)])
[2025-02-06 09:31:52,617 INFO  L294   olderBase$Statistics]: this new event has 404 ancestors and is cut-off event
[2025-02-06 09:31:52,617 INFO  L297   olderBase$Statistics]:   existing Event has 258 ancestors and is cut-off event
[2025-02-06 09:31:52,617 INFO  L297   olderBase$Statistics]:   existing Event has 258 ancestors and is cut-off event
[2025-02-06 09:31:52,617 INFO  L297   olderBase$Statistics]:   existing Event has 335 ancestors and is cut-off event
[2025-02-06 09:31:52,618 INFO  L124   PetriNetUnfolderBase]: 475/5756 cut-off events.
[2025-02-06 09:31:52,619 INFO  L125   PetriNetUnfolderBase]: For 254/269 co-relation queries the response was YES.
[2025-02-06 09:31:52,657 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6907 conditions, 5756 events. 475/5756 cut-off events. For 254/269 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 50578 event pairs, 93 based on Foata normal form. 0/5325 useless extension candidates. Maximal degree in co-relation 6857. Up to 277 conditions per place. 
[2025-02-06 09:31:52,670 INFO  L140   encePairwiseOnDemand]: 494/500 looper letters, 32 selfloop transitions, 5 changer transitions 0/464 dead transitions.
[2025-02-06 09:31:52,670 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 464 transitions, 1160 flow
[2025-02-06 09:31:52,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 09:31:52,671 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-06 09:31:52,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2744 transitions.
[2025-02-06 09:31:52,675 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9146666666666666
[2025-02-06 09:31:52,675 INFO  L175             Difference]: Start difference. First operand has 452 places, 453 transitions, 1056 flow. Second operand 6 states and 2744 transitions.
[2025-02-06 09:31:52,675 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 464 transitions, 1160 flow
[2025-02-06 09:31:52,680 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 464 transitions, 1160 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-02-06 09:31:52,684 INFO  L231             Difference]: Finished difference. Result has 456 places, 452 transitions, 1064 flow
[2025-02-06 09:31:52,685 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1064, PETRI_PLACES=456, PETRI_TRANSITIONS=452}
[2025-02-06 09:31:52,685 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -8 predicate places.
[2025-02-06 09:31:52,686 INFO  L471      AbstractCegarLoop]: Abstraction has has 456 places, 452 transitions, 1064 flow
[2025-02-06 09:31:52,687 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 452.8333333333333) internal successors, (2717), 6 states have internal predecessors, (2717), 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-06 09:31:52,687 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:52,687 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:31:52,687 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-06 09:31:52,687 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:52,688 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:52,688 INFO  L85        PathProgramCache]: Analyzing trace with hash -1744369360, now seen corresponding path program 1 times
[2025-02-06 09:31:52,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:52,689 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435801831]
[2025-02-06 09:31:52,689 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:52,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:52,705 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes.
[2025-02-06 09:31:52,725 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements.
[2025-02-06 09:31:52,725 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:52,725 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:53,077 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-02-06 09:31:53,077 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:53,077 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435801831]
[2025-02-06 09:31:53,077 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435801831] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:53,077 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:53,077 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 09:31:53,077 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049524499]
[2025-02-06 09:31:53,077 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:53,077 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 09:31:53,078 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:53,078 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 09:31:53,078 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-06 09:31:53,429 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 451 out of 500
[2025-02-06 09:31:53,432 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 452 transitions, 1064 flow. Second operand  has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 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-06 09:31:53,432 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:53,432 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 500
[2025-02-06 09:31:53,432 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:53,979 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L65-32-->L65-31: Formula: (= |v_#race~A~0_9| 0)  InVars {}  OutVars{#race~A~0=|v_#race~A~0_9|}  AuxVars[]  AssignedVars[#race~A~0][225], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 553#(= |#race~B~0| 0), Black: 513#true, 157#L65-31true, 555#true, 494#(= |#race~N~0| 0), 304#L86-1true, 148#L56-31true, Black: 551#true, 105#L48-35true, 561#true, 517#true, 515#(= |#race~A~0| 0), Black: 523#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 509#(= |#race~M~0| 0), Black: 522#(<= ~N~0 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 541#(<= (+ ~M~0 1) 0)])
[2025-02-06 09:31:53,979 INFO  L294   olderBase$Statistics]: this new event has 335 ancestors and is cut-off event
[2025-02-06 09:31:53,979 INFO  L297   olderBase$Statistics]:   existing Event has 258 ancestors and is cut-off event
[2025-02-06 09:31:53,979 INFO  L297   olderBase$Statistics]:   existing Event has 258 ancestors and is cut-off event
[2025-02-06 09:31:53,979 INFO  L297   olderBase$Statistics]:   existing Event has 258 ancestors and is cut-off event
[2025-02-06 09:31:54,030 INFO  L124   PetriNetUnfolderBase]: 317/4281 cut-off events.
[2025-02-06 09:31:54,030 INFO  L125   PetriNetUnfolderBase]: For 246/257 co-relation queries the response was YES.
[2025-02-06 09:31:54,053 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5276 conditions, 4281 events. 317/4281 cut-off events. For 246/257 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 34998 event pairs, 92 based on Foata normal form. 0/3948 useless extension candidates. Maximal degree in co-relation 5225. Up to 269 conditions per place. 
[2025-02-06 09:31:54,060 INFO  L140   encePairwiseOnDemand]: 494/500 looper letters, 34 selfloop transitions, 5 changer transitions 0/463 dead transitions.
[2025-02-06 09:31:54,060 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 463 transitions, 1172 flow
[2025-02-06 09:31:54,061 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 09:31:54,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-06 09:31:54,063 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2744 transitions.
[2025-02-06 09:31:54,063 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9146666666666666
[2025-02-06 09:31:54,063 INFO  L175             Difference]: Start difference. First operand has 456 places, 452 transitions, 1064 flow. Second operand 6 states and 2744 transitions.
[2025-02-06 09:31:54,064 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 463 transitions, 1172 flow
[2025-02-06 09:31:54,066 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 463 transitions, 1162 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-02-06 09:31:54,069 INFO  L231             Difference]: Finished difference. Result has 455 places, 451 transitions, 1062 flow
[2025-02-06 09:31:54,069 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1062, PETRI_PLACES=455, PETRI_TRANSITIONS=451}
[2025-02-06 09:31:54,070 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -9 predicate places.
[2025-02-06 09:31:54,070 INFO  L471      AbstractCegarLoop]: Abstraction has has 455 places, 451 transitions, 1062 flow
[2025-02-06 09:31:54,070 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 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-06 09:31:54,070 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:54,070 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:31:54,071 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-06 09:31:54,071 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:54,071 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:54,071 INFO  L85        PathProgramCache]: Analyzing trace with hash 1568094553, now seen corresponding path program 1 times
[2025-02-06 09:31:54,071 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:54,071 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277182664]
[2025-02-06 09:31:54,071 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:54,071 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:54,084 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-02-06 09:31:54,094 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-02-06 09:31:54,094 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:54,095 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:54,416 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-06 09:31:54,418 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:54,418 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277182664]
[2025-02-06 09:31:54,418 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277182664] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:54,418 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:54,418 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 09:31:54,418 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458075660]
[2025-02-06 09:31:54,418 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:54,419 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 09:31:54,419 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:54,419 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 09:31:54,421 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-06 09:31:54,751 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 451 out of 500
[2025-02-06 09:31:54,753 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 451 transitions, 1062 flow. Second operand  has 6 states, 6 states have (on average 452.8333333333333) internal successors, (2717), 6 states have internal predecessors, (2717), 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-06 09:31:54,753 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:54,753 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 500
[2025-02-06 09:31:54,753 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:55,375 INFO  L124   PetriNetUnfolderBase]: 389/4673 cut-off events.
[2025-02-06 09:31:55,375 INFO  L125   PetriNetUnfolderBase]: For 213/228 co-relation queries the response was YES.
[2025-02-06 09:31:55,413 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5682 conditions, 4673 events. 389/4673 cut-off events. For 213/228 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 39233 event pairs, 78 based on Foata normal form. 0/4336 useless extension candidates. Maximal degree in co-relation 5631. Up to 278 conditions per place. 
[2025-02-06 09:31:55,420 INFO  L140   encePairwiseOnDemand]: 494/500 looper letters, 32 selfloop transitions, 5 changer transitions 14/462 dead transitions.
[2025-02-06 09:31:55,420 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 462 transitions, 1166 flow
[2025-02-06 09:31:55,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 09:31:55,421 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-06 09:31:55,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2744 transitions.
[2025-02-06 09:31:55,423 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9146666666666666
[2025-02-06 09:31:55,423 INFO  L175             Difference]: Start difference. First operand has 455 places, 451 transitions, 1062 flow. Second operand 6 states and 2744 transitions.
[2025-02-06 09:31:55,423 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 462 transitions, 1166 flow
[2025-02-06 09:31:55,427 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 462 transitions, 1156 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-02-06 09:31:55,431 INFO  L231             Difference]: Finished difference. Result has 454 places, 436 transitions, 989 flow
[2025-02-06 09:31:55,432 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=989, PETRI_PLACES=454, PETRI_TRANSITIONS=436}
[2025-02-06 09:31:55,432 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -10 predicate places.
[2025-02-06 09:31:55,432 INFO  L471      AbstractCegarLoop]: Abstraction has has 454 places, 436 transitions, 989 flow
[2025-02-06 09:31:55,433 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 452.8333333333333) internal successors, (2717), 6 states have internal predecessors, (2717), 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-06 09:31:55,433 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:55,434 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:31:55,434 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-06 09:31:55,434 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:55,435 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:55,435 INFO  L85        PathProgramCache]: Analyzing trace with hash 1134899364, now seen corresponding path program 1 times
[2025-02-06 09:31:55,435 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:55,435 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667863540]
[2025-02-06 09:31:55,435 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:55,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:55,450 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes.
[2025-02-06 09:31:55,458 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements.
[2025-02-06 09:31:55,459 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:55,459 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:55,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-06 09:31:55,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:55,818 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667863540]
[2025-02-06 09:31:55,818 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667863540] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:55,818 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:55,818 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 09:31:55,818 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490354002]
[2025-02-06 09:31:55,818 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:55,818 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 09:31:55,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:55,819 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 09:31:55,819 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-06 09:31:56,182 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 451 out of 500
[2025-02-06 09:31:56,185 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 436 transitions, 989 flow. Second operand  has 6 states, 6 states have (on average 453.8333333333333) internal successors, (2723), 6 states have internal predecessors, (2723), 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-06 09:31:56,185 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:56,185 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 500
[2025-02-06 09:31:56,185 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:56,607 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1116] L56-32-->L56-31: Formula: (= |v_#race~A~0_6| 0)  InVars {}  OutVars{#race~A~0=|v_#race~A~0_6|}  AuxVars[]  AssignedVars[#race~A~0][224], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 553#(= |#race~B~0| 0), Black: 513#true, 573#true, 157#L65-31true, 494#(= |#race~N~0| 0), 304#L86-1true, Black: 551#true, 148#L56-31true, 567#true, 105#L48-35true, 517#true, 515#(= |#race~A~0| 0), Black: 523#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 509#(= |#race~M~0| 0), Black: 522#(<= ~N~0 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 541#(<= (+ ~M~0 1) 0)])
[2025-02-06 09:31:56,608 INFO  L294   olderBase$Statistics]: this new event has 331 ancestors and is cut-off event
[2025-02-06 09:31:56,608 INFO  L297   olderBase$Statistics]:   existing Event has 258 ancestors and is cut-off event
[2025-02-06 09:31:56,608 INFO  L297   olderBase$Statistics]:   existing Event has 258 ancestors and is cut-off event
[2025-02-06 09:31:56,608 INFO  L297   olderBase$Statistics]:   existing Event has 258 ancestors and is cut-off event
[2025-02-06 09:31:56,641 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1290] L66-1-->L64-5: Formula: (= |v_thread3Thread1of1ForFork0_~tmp~1#1_3| v_~res2~0_9)  InVars {thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_3|}  OutVars{~res2~0=v_~res2~0_9, thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_3|}  AuxVars[]  AssignedVars[~res2~0][436], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 572#(and (= (select (select |#race| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset)) 0)), 553#(= |#race~B~0| 0), Black: 513#true, 573#true, 494#(= |#race~N~0| 0), Black: 551#true, 517#true, 515#(= |#race~A~0| 0), Black: 523#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 509#(= |#race~M~0| 0), Black: 522#(<= ~N~0 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 416#L64-5true, 163#L89true, Black: 541#(<= (+ ~M~0 1) 0)])
[2025-02-06 09:31:56,641 INFO  L294   olderBase$Statistics]: this new event has 406 ancestors and is cut-off event
[2025-02-06 09:31:56,641 INFO  L297   olderBase$Statistics]:   existing Event has 329 ancestors and is cut-off event
[2025-02-06 09:31:56,641 INFO  L297   olderBase$Statistics]:   existing Event has 402 ancestors and is cut-off event
[2025-02-06 09:31:56,641 INFO  L297   olderBase$Statistics]:   existing Event has 256 ancestors and is cut-off event
[2025-02-06 09:31:56,689 INFO  L124   PetriNetUnfolderBase]: 294/4122 cut-off events.
[2025-02-06 09:31:56,689 INFO  L125   PetriNetUnfolderBase]: For 57/66 co-relation queries the response was YES.
[2025-02-06 09:31:56,723 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5033 conditions, 4122 events. 294/4122 cut-off events. For 57/66 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 30538 event pairs, 64 based on Foata normal form. 0/3847 useless extension candidates. Maximal degree in co-relation 4982. Up to 202 conditions per place. 
[2025-02-06 09:31:56,731 INFO  L140   encePairwiseOnDemand]: 494/500 looper letters, 36 selfloop transitions, 5 changer transitions 0/451 dead transitions.
[2025-02-06 09:31:56,731 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 451 transitions, 1109 flow
[2025-02-06 09:31:56,732 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 09:31:56,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-06 09:31:56,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2748 transitions.
[2025-02-06 09:31:56,735 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.916
[2025-02-06 09:31:56,735 INFO  L175             Difference]: Start difference. First operand has 454 places, 436 transitions, 989 flow. Second operand 6 states and 2748 transitions.
[2025-02-06 09:31:56,735 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 451 transitions, 1109 flow
[2025-02-06 09:31:56,739 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 451 transitions, 1061 flow, removed 6 selfloop flow, removed 12 redundant places.
[2025-02-06 09:31:56,743 INFO  L231             Difference]: Finished difference. Result has 442 places, 435 transitions, 949 flow
[2025-02-06 09:31:56,743 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=949, PETRI_PLACES=442, PETRI_TRANSITIONS=435}
[2025-02-06 09:31:56,744 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -22 predicate places.
[2025-02-06 09:31:56,744 INFO  L471      AbstractCegarLoop]: Abstraction has has 442 places, 435 transitions, 949 flow
[2025-02-06 09:31:56,745 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 453.8333333333333) internal successors, (2723), 6 states have internal predecessors, (2723), 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-06 09:31:56,745 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:56,745 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:31:56,745 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-06 09:31:56,746 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:56,746 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:56,747 INFO  L85        PathProgramCache]: Analyzing trace with hash -967503480, now seen corresponding path program 1 times
[2025-02-06 09:31:56,747 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:56,747 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291841957]
[2025-02-06 09:31:56,747 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:56,747 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:56,762 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-02-06 09:31:56,770 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-02-06 09:31:56,771 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:56,771 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:57,134 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-06 09:31:57,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:57,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291841957]
[2025-02-06 09:31:57,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291841957] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:57,134 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:57,134 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-06 09:31:57,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560860628]
[2025-02-06 09:31:57,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:57,135 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-06 09:31:57,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:57,136 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-06 09:31:57,136 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-02-06 09:31:57,471 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 451 out of 500
[2025-02-06 09:31:57,472 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 435 transitions, 949 flow. Second operand  has 6 states, 6 states have (on average 453.8333333333333) internal successors, (2723), 6 states have internal predecessors, (2723), 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-06 09:31:57,473 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:57,473 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 500
[2025-02-06 09:31:57,473 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:57,946 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1116] L56-32-->L56-31: Formula: (= |v_#race~A~0_6| 0)  InVars {}  OutVars{#race~A~0=|v_#race~A~0_6|}  AuxVars[]  AssignedVars[#race~A~0][218], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 579#true, 553#(= |#race~B~0| 0), Black: 513#true, 573#true, 157#L65-31true, 494#(= |#race~N~0| 0), 304#L86-1true, 148#L56-31true, Black: 551#true, 105#L48-35true, 515#(= |#race~A~0| 0), 509#(= |#race~M~0| 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 541#(<= (+ ~M~0 1) 0)])
[2025-02-06 09:31:57,946 INFO  L294   olderBase$Statistics]: this new event has 331 ancestors and is cut-off event
[2025-02-06 09:31:57,946 INFO  L297   olderBase$Statistics]:   existing Event has 258 ancestors and is cut-off event
[2025-02-06 09:31:57,946 INFO  L297   olderBase$Statistics]:   existing Event has 258 ancestors and is cut-off event
[2025-02-06 09:31:57,946 INFO  L297   olderBase$Statistics]:   existing Event has 258 ancestors and is cut-off event
[2025-02-06 09:31:57,960 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1290] L66-1-->L64-5: Formula: (= |v_thread3Thread1of1ForFork0_~tmp~1#1_3| v_~res2~0_9)  InVars {thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_3|}  OutVars{~res2~0=v_~res2~0_9, thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_3|}  AuxVars[]  AssignedVars[~res2~0][435], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 579#true, 553#(= |#race~B~0| 0), Black: 513#true, 573#true, 494#(= |#race~N~0| 0), Black: 551#true, 515#(= |#race~A~0| 0), 509#(= |#race~M~0| 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 416#L64-5true, 163#L89true, Black: 541#(<= (+ ~M~0 1) 0)])
[2025-02-06 09:31:57,960 INFO  L294   olderBase$Statistics]: this new event has 406 ancestors and is cut-off event
[2025-02-06 09:31:57,960 INFO  L297   olderBase$Statistics]:   existing Event has 329 ancestors and is cut-off event
[2025-02-06 09:31:57,960 INFO  L297   olderBase$Statistics]:   existing Event has 402 ancestors and is cut-off event
[2025-02-06 09:31:57,960 INFO  L297   olderBase$Statistics]:   existing Event has 256 ancestors and is cut-off event
[2025-02-06 09:31:57,979 INFO  L124   PetriNetUnfolderBase]: 241/3934 cut-off events.
[2025-02-06 09:31:57,980 INFO  L125   PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES.
[2025-02-06 09:31:58,009 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4609 conditions, 3934 events. 241/3934 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 30458 event pairs, 70 based on Foata normal form. 0/3646 useless extension candidates. Maximal degree in co-relation 4565. Up to 196 conditions per place. 
[2025-02-06 09:31:58,018 INFO  L140   encePairwiseOnDemand]: 494/500 looper letters, 36 selfloop transitions, 5 changer transitions 0/450 dead transitions.
[2025-02-06 09:31:58,019 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 450 transitions, 1069 flow
[2025-02-06 09:31:58,019 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-06 09:31:58,019 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-02-06 09:31:58,022 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2748 transitions.
[2025-02-06 09:31:58,023 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.916
[2025-02-06 09:31:58,023 INFO  L175             Difference]: Start difference. First operand has 442 places, 435 transitions, 949 flow. Second operand 6 states and 2748 transitions.
[2025-02-06 09:31:58,023 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 450 transitions, 1069 flow
[2025-02-06 09:31:58,026 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 450 transitions, 1059 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-02-06 09:31:58,030 INFO  L231             Difference]: Finished difference. Result has 441 places, 434 transitions, 947 flow
[2025-02-06 09:31:58,031 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=947, PETRI_PLACES=441, PETRI_TRANSITIONS=434}
[2025-02-06 09:31:58,031 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -23 predicate places.
[2025-02-06 09:31:58,031 INFO  L471      AbstractCegarLoop]: Abstraction has has 441 places, 434 transitions, 947 flow
[2025-02-06 09:31:58,032 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 453.8333333333333) internal successors, (2723), 6 states have internal predecessors, (2723), 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-06 09:31:58,032 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-02-06 09:31:58,033 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:31:58,033 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-06 09:31:58,033 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] ===
[2025-02-06 09:31:58,034 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-06 09:31:58,035 INFO  L85        PathProgramCache]: Analyzing trace with hash -350262492, now seen corresponding path program 1 times
[2025-02-06 09:31:58,035 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-06 09:31:58,035 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064223503]
[2025-02-06 09:31:58,035 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-06 09:31:58,035 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-06 09:31:58,063 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes.
[2025-02-06 09:31:58,073 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements.
[2025-02-06 09:31:58,073 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-06 09:31:58,073 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-06 09:31:58,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-06 09:31:58,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-06 09:31:58,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064223503]
[2025-02-06 09:31:58,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064223503] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-06 09:31:58,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-06 09:31:58,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-06 09:31:58,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130480449]
[2025-02-06 09:31:58,116 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-06 09:31:58,117 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-06 09:31:58,117 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-06 09:31:58,118 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-06 09:31:58,118 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-06 09:31:58,131 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 463 out of 500
[2025-02-06 09:31:58,132 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 434 transitions, 947 flow. Second operand  has 3 states, 3 states have (on average 464.6666666666667) internal successors, (1394), 3 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-02-06 09:31:58,132 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-02-06 09:31:58,132 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 500
[2025-02-06 09:31:58,132 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-02-06 09:31:58,691 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L65-32-->L65-31: Formula: (= |v_#race~A~0_9| 0)  InVars {}  OutVars{#race~A~0=|v_#race~A~0_9|}  AuxVars[]  AssignedVars[#race~A~0][237], [Black: 542#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 579#true, 553#(= |#race~B~0| 0), Black: 513#true, 494#(= |#race~N~0| 0), 157#L65-31true, 304#L86-1true, 148#L56-31true, Black: 551#true, 105#L48-35true, 515#(= |#race~A~0| 0), 585#true, 509#(= |#race~M~0| 0), Black: 527#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 541#(<= (+ ~M~0 1) 0)])
[2025-02-06 09:31:58,691 INFO  L294   olderBase$Statistics]: this new event has 331 ancestors and is cut-off event
[2025-02-06 09:31:58,691 INFO  L297   olderBase$Statistics]:   existing Event has 258 ancestors and is cut-off event
[2025-02-06 09:31:58,691 INFO  L297   olderBase$Statistics]:   existing Event has 258 ancestors and is cut-off event
[2025-02-06 09:31:58,691 INFO  L297   olderBase$Statistics]:   existing Event has 262 ancestors and is cut-off event
[2025-02-06 09:31:58,742 INFO  L124   PetriNetUnfolderBase]: 224/4171 cut-off events.
[2025-02-06 09:31:58,742 INFO  L125   PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES.
[2025-02-06 09:31:58,773 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 4171 events. 224/4171 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 31003 event pairs, 74 based on Foata normal form. 0/3894 useless extension candidates. Maximal degree in co-relation 4727. Up to 202 conditions per place. 
[2025-02-06 09:31:58,776 INFO  L140   encePairwiseOnDemand]: 497/500 looper letters, 0 selfloop transitions, 0 changer transitions 437/437 dead transitions.
[2025-02-06 09:31:58,776 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 437 transitions, 987 flow
[2025-02-06 09:31:58,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-06 09:31:58,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-02-06 09:31:58,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1406 transitions.
[2025-02-06 09:31:58,778 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9373333333333334
[2025-02-06 09:31:58,778 INFO  L175             Difference]: Start difference. First operand has 441 places, 434 transitions, 947 flow. Second operand 3 states and 1406 transitions.
[2025-02-06 09:31:58,778 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 437 transitions, 987 flow
[2025-02-06 09:31:58,780 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 437 transitions, 977 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-02-06 09:31:58,782 INFO  L231             Difference]: Finished difference. Result has 437 places, 0 transitions, 0 flow
[2025-02-06 09:31:58,782 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=500, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=437, PETRI_TRANSITIONS=0}
[2025-02-06 09:31:58,782 INFO  L279   CegarLoopForPetriNet]: 464 programPoint places, -27 predicate places.
[2025-02-06 09:31:58,782 INFO  L471      AbstractCegarLoop]: Abstraction has has 437 places, 0 transitions, 0 flow
[2025-02-06 09:31:58,782 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 464.6666666666667) internal successors, (1394), 3 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-02-06 09:31:58,784 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (50 of 51 remaining)
[2025-02-06 09:31:58,784 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining)
[2025-02-06 09:31:58,785 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining)
[2025-02-06 09:31:58,786 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining)
[2025-02-06 09:31:58,786 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining)
[2025-02-06 09:31:58,786 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining)
[2025-02-06 09:31:58,786 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining)
[2025-02-06 09:31:58,786 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining)
[2025-02-06 09:31:58,786 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining)
[2025-02-06 09:31:58,786 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining)
[2025-02-06 09:31:58,786 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 51 remaining)
[2025-02-06 09:31:58,786 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining)
[2025-02-06 09:31:58,787 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining)
[2025-02-06 09:31:58,788 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-06 09:31:58,788 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-06 09:31:58,793 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-02-06 09:31:58,793 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-06 09:31:58,800 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:31:58 BasicIcfg
[2025-02-06 09:31:58,800 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-06 09:31:58,801 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-06 09:31:58,801 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-06 09:31:58,801 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-06 09:31:58,802 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:31:38" (3/4) ...
[2025-02-06 09:31:58,803 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-06 09:31:58,806 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread1
[2025-02-06 09:31:58,806 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread2
[2025-02-06 09:31:58,806 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread3
[2025-02-06 09:31:58,811 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges
[2025-02-06 09:31:58,812 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges
[2025-02-06 09:31:58,812 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-06 09:31:58,813 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-06 09:31:58,899 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-06 09:31:58,900 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-06 09:31:58,900 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-06 09:31:58,901 INFO  L158              Benchmark]: Toolchain (without parser) took 21621.00ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 113.1MB in the beginning and 309.2MB in the end (delta: -196.1MB). Peak memory consumption was 851.2MB. Max. memory is 16.1GB.
[2025-02-06 09:31:58,902 INFO  L158              Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 09:31:58,902 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 322.52ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 100.0MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-06 09:31:58,902 INFO  L158              Benchmark]: Boogie Procedure Inliner took 67.91ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-06 09:31:58,903 INFO  L158              Benchmark]: Boogie Preprocessor took 61.54ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-02-06 09:31:58,904 INFO  L158              Benchmark]: IcfgBuilder took 794.57ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 59.0MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-02-06 09:31:58,904 INFO  L158              Benchmark]: TraceAbstraction took 20264.91ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 58.1MB in the beginning and 317.6MB in the end (delta: -259.5MB). Peak memory consumption was 792.5MB. Max. memory is 16.1GB.
[2025-02-06 09:31:58,905 INFO  L158              Benchmark]: Witness Printer took 99.73ms. Allocated memory is still 1.2GB. Free memory was 317.6MB in the beginning and 309.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-02-06 09:31:58,906 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.27ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 322.52ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 100.0MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 67.91ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 61.54ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 794.57ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 59.0MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 20264.91ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 58.1MB in the beginning and 317.6MB in the end (delta: -259.5MB). Peak memory consumption was 792.5MB. Max. memory is 16.1GB.
 * Witness Printer took 99.73ms. Allocated memory is still 1.2GB. Free memory was 317.6MB in the beginning and 309.2MB 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: 47]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 48]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 48]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 48]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 48]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 48]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 48]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 55]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 56]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 56]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 56]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 56]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 64]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 64]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 65]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 65]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 65]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 65]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 76]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 77]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 78]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 103]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 78]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 79]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 103]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 79]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 81]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 81]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 81]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 91]: there are no data races
    For all program executions holds that there are no data races at this location
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 7 procedures, 750 locations, 51 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: 20.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2034 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1148 mSDsluCounter, 546 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 365 mSDsCounter, 589 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3479 IncrementalHoareTripleChecker+Invalid, 4068 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 589 mSolverCounterUnsat, 181 mSDtfsCounter, 3479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1064occurred in iteration=14, InterpolantAutomatonStates: 87, 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.5s InterpolantComputationTime, 2206 NumberOfCodeBlocks, 2206 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2187 ConstructedInterpolants, 0 QuantifiedInterpolants, 3302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 9/9 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
    30 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-02-06 09:31:58,928 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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