./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i --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/goblint-regression/28-race_reach_19-callback_racing.i -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 a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:25:22,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:25:22,522 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:25:22,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:25:22,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:25:22,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:25:22,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:25:22,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:25:22,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:25:22,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:25:22,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:25:22,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:25:22,550 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:25:22,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:25:22,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:25:22,551 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:25:22,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:25:22,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:25:22,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:25:22,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:25:22,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:25:22,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:25:22,552 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:25:22,552 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:25:22,552 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:25:22,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:25:22,552 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:25:22,552 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:25:22,552 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:25:22,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:25:22,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:25:22,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:25:22,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:25:22,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:25:22,553 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:25:22,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:25:22,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:25:22,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:25:22,554 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:25:22,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:25:22,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:25:22,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:25:22,554 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 -> a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 [2025-02-06 09:25:22,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:25:22,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:25:22,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:25:22,774 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:25:22,774 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:25:22,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2025-02-06 09:25:23,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b8817308/e225f6504d3d42efbaa5c4f5c7253006/FLAG1ab2be19b [2025-02-06 09:25:24,212 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:25:24,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2025-02-06 09:25:24,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b8817308/e225f6504d3d42efbaa5c4f5c7253006/FLAG1ab2be19b [2025-02-06 09:25:24,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b8817308/e225f6504d3d42efbaa5c4f5c7253006 [2025-02-06 09:25:24,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:25:24,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:25:24,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:25:24,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:25:24,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:25:24,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:25:24" (1/1) ... [2025-02-06 09:25:24,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c5c2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:24, skipping insertion in model container [2025-02-06 09:25:24,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:25:24" (1/1) ... [2025-02-06 09:25:24,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:25:24,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:25:24,500 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:25:24,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:25:24,557 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:25:24,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:24 WrapperNode [2025-02-06 09:25:24,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:25:24,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:25:24,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:25:24,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:25:24,563 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:25:24" (1/1) ... [2025-02-06 09:25:24,571 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:25:24" (1/1) ... [2025-02-06 09:25:24,585 INFO L138 Inliner]: procedures = 174, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 161 [2025-02-06 09:25:24,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:25:24,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:25:24,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:25:24,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:25:24,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:24" (1/1) ... [2025-02-06 09:25:24,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:24" (1/1) ... [2025-02-06 09:25:24,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:24" (1/1) ... [2025-02-06 09:25:24,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:24" (1/1) ... [2025-02-06 09:25:24,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:24" (1/1) ... [2025-02-06 09:25:24,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:24" (1/1) ... [2025-02-06 09:25:24,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:24" (1/1) ... [2025-02-06 09:25:24,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:24" (1/1) ... [2025-02-06 09:25:24,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:25:24,617 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:25:24,617 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:25:24,617 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:25:24,618 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:24" (1/1) ... [2025-02-06 09:25:24,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:25:24,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:25:24,644 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:25:24,646 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:25:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:25:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:25:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:25:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:25:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:25:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:25:24,661 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:25:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:25:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:25:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:25:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:25:24,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:25:24,662 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:25:24,738 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:25:24,740 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:25:24,934 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 09:25:24,934 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 09:25:24,977 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:25:24,977 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:25:24,999 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:25:24,999 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:25:24,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:25:24 BoogieIcfgContainer [2025-02-06 09:25:24,999 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:25:25,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:25:25,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:25:25,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:25:25,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:25:24" (1/3) ... [2025-02-06 09:25:25,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231d907b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:25:25, skipping insertion in model container [2025-02-06 09:25:25,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:24" (2/3) ... [2025-02-06 09:25:25,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231d907b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:25:25, skipping insertion in model container [2025-02-06 09:25:25,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:25:24" (3/3) ... [2025-02-06 09:25:25,006 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_19-callback_racing.i [2025-02-06 09:25:25,018 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:25:25,020 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_19-callback_racing.i that has 2 procedures, 168 locations, 1 initial locations, 7 loop locations, and 7 error locations. [2025-02-06 09:25:25,020 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:25:25,086 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:25:25,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 181 transitions, 369 flow [2025-02-06 09:25:25,221 INFO L124 PetriNetUnfolderBase]: 21/290 cut-off events. [2025-02-06 09:25:25,223 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:25:25,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 290 events. 21/290 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 998 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 143. Up to 6 conditions per place. [2025-02-06 09:25:25,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 181 transitions, 369 flow [2025-02-06 09:25:25,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 181 transitions, 369 flow [2025-02-06 09:25:25,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:25:25,253 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;@d4205e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:25:25,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-06 09:25:25,274 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:25:25,276 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-02-06 09:25:25,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:25:25,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:25,277 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] [2025-02-06 09:25:25,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:25:25,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:25,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2040561899, now seen corresponding path program 1 times [2025-02-06 09:25:25,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:25,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940514661] [2025-02-06 09:25:25,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:25,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:25,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:25:25,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:25:25,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:25,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:26,031 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:25:26,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:26,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940514661] [2025-02-06 09:25:26,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940514661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:26,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:26,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:26,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587618109] [2025-02-06 09:25:26,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:26,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:25:26,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:26,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:25:26,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:25:26,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 181 [2025-02-06 09:25:26,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 181 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 141.5) internal successors, (849), 6 states have internal predecessors, (849), 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:25:26,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:26,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 181 [2025-02-06 09:25:26,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:26,385 INFO L124 PetriNetUnfolderBase]: 93/770 cut-off events. [2025-02-06 09:25:26,386 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:25:26,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 770 events. 93/770 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4313 event pairs, 8 based on Foata normal form. 116/828 useless extension candidates. Maximal degree in co-relation 810. Up to 154 conditions per place. [2025-02-06 09:25:26,393 INFO L140 encePairwiseOnDemand]: 165/181 looper letters, 40 selfloop transitions, 5 changer transitions 0/184 dead transitions. [2025-02-06 09:25:26,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 184 transitions, 465 flow [2025-02-06 09:25:26,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 912 transitions. [2025-02-06 09:25:26,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8397790055248618 [2025-02-06 09:25:26,412 INFO L175 Difference]: Start difference. First operand has 171 places, 181 transitions, 369 flow. Second operand 6 states and 912 transitions. [2025-02-06 09:25:26,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 184 transitions, 465 flow [2025-02-06 09:25:26,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 184 transitions, 465 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:26,422 INFO L231 Difference]: Finished difference. Result has 173 places, 168 transitions, 353 flow [2025-02-06 09:25:26,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=173, PETRI_TRANSITIONS=168} [2025-02-06 09:25:26,427 INFO L279 CegarLoopForPetriNet]: 171 programPoint places, 2 predicate places. [2025-02-06 09:25:26,427 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 168 transitions, 353 flow [2025-02-06 09:25:26,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.5) internal successors, (849), 6 states have internal predecessors, (849), 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:25:26,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:26,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:26,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:25:26,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:25:26,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:26,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1807497362, now seen corresponding path program 1 times [2025-02-06 09:25:26,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:26,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614992846] [2025-02-06 09:25:26,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:26,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:26,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:25:26,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:25:26,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:26,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:26,517 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:25:26,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:26,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614992846] [2025-02-06 09:25:26,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614992846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:26,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:26,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:26,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943791822] [2025-02-06 09:25:26,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:26,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:26,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:26,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:26,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:26,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 181 [2025-02-06 09:25:26,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 168 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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:25:26,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:26,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 181 [2025-02-06 09:25:26,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:26,615 INFO L124 PetriNetUnfolderBase]: 50/654 cut-off events. [2025-02-06 09:25:26,615 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 09:25:26,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 654 events. 50/654 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3299 event pairs, 0 based on Foata normal form. 1/609 useless extension candidates. Maximal degree in co-relation 705. Up to 94 conditions per place. [2025-02-06 09:25:26,619 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 20 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2025-02-06 09:25:26,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 172 transitions, 405 flow [2025-02-06 09:25:26,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2025-02-06 09:25:26,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8821362799263351 [2025-02-06 09:25:26,623 INFO L175 Difference]: Start difference. First operand has 173 places, 168 transitions, 353 flow. Second operand 3 states and 479 transitions. [2025-02-06 09:25:26,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 172 transitions, 405 flow [2025-02-06 09:25:26,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 172 transitions, 395 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:25:26,627 INFO L231 Difference]: Finished difference. Result has 171 places, 168 transitions, 351 flow [2025-02-06 09:25:26,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=171, PETRI_TRANSITIONS=168} [2025-02-06 09:25:26,629 INFO L279 CegarLoopForPetriNet]: 171 programPoint places, 0 predicate places. [2025-02-06 09:25:26,629 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 168 transitions, 351 flow [2025-02-06 09:25:26,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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:25:26,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:26,629 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] [2025-02-06 09:25:26,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:25:26,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:25:26,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:26,630 INFO L85 PathProgramCache]: Analyzing trace with hash -599383320, now seen corresponding path program 1 times [2025-02-06 09:25:26,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:26,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556873396] [2025-02-06 09:25:26,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:26,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:26,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 09:25:26,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 09:25:26,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:26,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:26,660 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:25:26,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:26,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556873396] [2025-02-06 09:25:26,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556873396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:26,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:26,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:26,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249317534] [2025-02-06 09:25:26,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:26,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:26,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:26,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:26,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:26,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 181 [2025-02-06 09:25:26,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 168 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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:25:26,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:26,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 181 [2025-02-06 09:25:26,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:26,805 INFO L124 PetriNetUnfolderBase]: 110/891 cut-off events. [2025-02-06 09:25:26,806 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2025-02-06 09:25:26,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 891 events. 110/891 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4631 event pairs, 41 based on Foata normal form. 1/819 useless extension candidates. Maximal degree in co-relation 1089. Up to 133 conditions per place. [2025-02-06 09:25:26,809 INFO L140 encePairwiseOnDemand]: 172/181 looper letters, 30 selfloop transitions, 6 changer transitions 0/181 dead transitions. [2025-02-06 09:25:26,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 181 transitions, 452 flow [2025-02-06 09:25:26,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2025-02-06 09:25:26,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8839779005524862 [2025-02-06 09:25:26,810 INFO L175 Difference]: Start difference. First operand has 171 places, 168 transitions, 351 flow. Second operand 3 states and 480 transitions. [2025-02-06 09:25:26,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 181 transitions, 452 flow [2025-02-06 09:25:26,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 181 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:25:26,812 INFO L231 Difference]: Finished difference. Result has 171 places, 170 transitions, 385 flow [2025-02-06 09:25:26,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=171, PETRI_TRANSITIONS=170} [2025-02-06 09:25:26,813 INFO L279 CegarLoopForPetriNet]: 171 programPoint places, 0 predicate places. [2025-02-06 09:25:26,813 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 170 transitions, 385 flow [2025-02-06 09:25:26,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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:25:26,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:26,814 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:26,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:25:26,814 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:25:26,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1513822939, now seen corresponding path program 1 times [2025-02-06 09:25:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:26,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521683409] [2025-02-06 09:25:26,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:26,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 09:25:26,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 09:25:26,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:26,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:26,834 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:25:26,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 09:25:26,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 09:25:26,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:26,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:26,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:25:26,858 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:25:26,858 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-06 09:25:26,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-02-06 09:25:26,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-02-06 09:25:26,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-02-06 09:25:26,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-02-06 09:25:26,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-02-06 09:25:26,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-02-06 09:25:26,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-02-06 09:25:26,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-02-06 09:25:26,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:25:26,860 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:25:26,862 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:25:26,862 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:25:26,885 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:25:26,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 214 transitions, 444 flow [2025-02-06 09:25:26,937 INFO L124 PetriNetUnfolderBase]: 35/459 cut-off events. [2025-02-06 09:25:26,938 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:25:26,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 459 events. 35/459 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1885 event pairs, 0 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 292. Up to 9 conditions per place. [2025-02-06 09:25:26,940 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 214 transitions, 444 flow [2025-02-06 09:25:26,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 214 transitions, 444 flow [2025-02-06 09:25:26,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:25:26,945 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;@d4205e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:25:26,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 09:25:26,950 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:25:26,951 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-02-06 09:25:26,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:25:26,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:26,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] [2025-02-06 09:25:26,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:25:26,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:26,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1917014229, now seen corresponding path program 1 times [2025-02-06 09:25:26,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:26,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831712664] [2025-02-06 09:25:26,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:26,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:26,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:25:26,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:25:26,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:26,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:27,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:25:27,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:27,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831712664] [2025-02-06 09:25:27,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831712664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:27,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:27,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:27,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569273806] [2025-02-06 09:25:27,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:27,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:25:27,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:27,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:25:27,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:25:27,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 214 [2025-02-06 09:25:27,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 214 transitions, 444 flow. Second operand has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 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:25:27,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:27,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 214 [2025-02-06 09:25:27,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:27,834 INFO L124 PetriNetUnfolderBase]: 971/4739 cut-off events. [2025-02-06 09:25:27,835 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-02-06 09:25:27,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6398 conditions, 4739 events. 971/4739 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 45528 event pairs, 306 based on Foata normal form. 1120/5477 useless extension candidates. Maximal degree in co-relation 2183. Up to 1202 conditions per place. [2025-02-06 09:25:27,854 INFO L140 encePairwiseOnDemand]: 194/214 looper letters, 62 selfloop transitions, 5 changer transitions 0/227 dead transitions. [2025-02-06 09:25:27,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 227 transitions, 604 flow [2025-02-06 09:25:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1086 transitions. [2025-02-06 09:25:27,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457943925233645 [2025-02-06 09:25:27,859 INFO L175 Difference]: Start difference. First operand has 201 places, 214 transitions, 444 flow. Second operand 6 states and 1086 transitions. [2025-02-06 09:25:27,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 227 transitions, 604 flow [2025-02-06 09:25:27,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 227 transitions, 604 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:27,864 INFO L231 Difference]: Finished difference. Result has 201 places, 195 transitions, 416 flow [2025-02-06 09:25:27,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=416, PETRI_PLACES=201, PETRI_TRANSITIONS=195} [2025-02-06 09:25:27,865 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, 0 predicate places. [2025-02-06 09:25:27,865 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 195 transitions, 416 flow [2025-02-06 09:25:27,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 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:25:27,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:27,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:27,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:25:27,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:25:27,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:27,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2027674578, now seen corresponding path program 1 times [2025-02-06 09:25:27,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:27,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419144308] [2025-02-06 09:25:27,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:27,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:27,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:25:27,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:25:27,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:27,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:27,904 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:25:27,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:27,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419144308] [2025-02-06 09:25:27,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419144308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:27,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:27,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:27,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681129164] [2025-02-06 09:25:27,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:27,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:27,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:27,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:27,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:27,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 214 [2025-02-06 09:25:27,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 195 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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:25:27,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:27,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 214 [2025-02-06 09:25:27,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:28,139 INFO L124 PetriNetUnfolderBase]: 498/3057 cut-off events. [2025-02-06 09:25:28,139 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-02-06 09:25:28,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3963 conditions, 3057 events. 498/3057 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 26661 event pairs, 403 based on Foata normal form. 1/2772 useless extension candidates. Maximal degree in co-relation 2498. Up to 817 conditions per place. [2025-02-06 09:25:28,154 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 27 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2025-02-06 09:25:28,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 200 transitions, 486 flow [2025-02-06 09:25:28,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2025-02-06 09:25:28,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8598130841121495 [2025-02-06 09:25:28,157 INFO L175 Difference]: Start difference. First operand has 201 places, 195 transitions, 416 flow. Second operand 3 states and 552 transitions. [2025-02-06 09:25:28,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 200 transitions, 486 flow [2025-02-06 09:25:28,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 200 transitions, 474 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:25:28,160 INFO L231 Difference]: Finished difference. Result has 199 places, 196 transitions, 418 flow [2025-02-06 09:25:28,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=199, PETRI_TRANSITIONS=196} [2025-02-06 09:25:28,162 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -2 predicate places. [2025-02-06 09:25:28,163 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 196 transitions, 418 flow [2025-02-06 09:25:28,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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:25:28,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:28,163 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] [2025-02-06 09:25:28,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:25:28,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:25:28,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash 968544285, now seen corresponding path program 1 times [2025-02-06 09:25:28,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:28,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446837925] [2025-02-06 09:25:28,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:28,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 09:25:28,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 09:25:28,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:28,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:28,224 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:25:28,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:28,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446837925] [2025-02-06 09:25:28,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446837925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:28,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:28,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:28,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573819656] [2025-02-06 09:25:28,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:28,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:28,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:28,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:28,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:28,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 214 [2025-02-06 09:25:28,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 196 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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:25:28,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:28,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 214 [2025-02-06 09:25:28,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:29,003 INFO L124 PetriNetUnfolderBase]: 2100/8720 cut-off events. [2025-02-06 09:25:29,003 INFO L125 PetriNetUnfolderBase]: For 189/278 co-relation queries the response was YES. [2025-02-06 09:25:29,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12225 conditions, 8720 events. 2100/8720 cut-off events. For 189/278 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 87387 event pairs, 755 based on Foata normal form. 7/7920 useless extension candidates. Maximal degree in co-relation 12168. Up to 2123 conditions per place. [2025-02-06 09:25:29,048 INFO L140 encePairwiseOnDemand]: 202/214 looper letters, 45 selfloop transitions, 8 changer transitions 0/217 dead transitions. [2025-02-06 09:25:29,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 217 transitions, 577 flow [2025-02-06 09:25:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-02-06 09:25:29,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8644859813084113 [2025-02-06 09:25:29,053 INFO L175 Difference]: Start difference. First operand has 199 places, 196 transitions, 418 flow. Second operand 3 states and 555 transitions. [2025-02-06 09:25:29,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 217 transitions, 577 flow [2025-02-06 09:25:29,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 217 transitions, 575 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:25:29,056 INFO L231 Difference]: Finished difference. Result has 200 places, 200 transitions, 472 flow [2025-02-06 09:25:29,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=200, PETRI_TRANSITIONS=200} [2025-02-06 09:25:29,057 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -1 predicate places. [2025-02-06 09:25:29,057 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 200 transitions, 472 flow [2025-02-06 09:25:29,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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:25:29,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:29,057 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:29,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:25:29,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:25:29,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:29,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1468720886, now seen corresponding path program 1 times [2025-02-06 09:25:29,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:29,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760120011] [2025-02-06 09:25:29,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:29,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:29,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 09:25:29,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 09:25:29,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:29,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:29,120 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:25:29,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:29,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760120011] [2025-02-06 09:25:29,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760120011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:29,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:29,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:29,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101346374] [2025-02-06 09:25:29,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:29,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:25:29,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:29,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:25:29,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:25:29,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 214 [2025-02-06 09:25:29,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 200 transitions, 472 flow. Second operand has 5 states, 5 states have (on average 173.6) internal successors, (868), 5 states have internal predecessors, (868), 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:25:29,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:29,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 214 [2025-02-06 09:25:29,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:29,870 INFO L124 PetriNetUnfolderBase]: 1407/9054 cut-off events. [2025-02-06 09:25:29,871 INFO L125 PetriNetUnfolderBase]: For 419/429 co-relation queries the response was YES. [2025-02-06 09:25:29,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11990 conditions, 9054 events. 1407/9054 cut-off events. For 419/429 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 95022 event pairs, 514 based on Foata normal form. 5/8320 useless extension candidates. Maximal degree in co-relation 5585. Up to 1727 conditions per place. [2025-02-06 09:25:29,909 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 44 selfloop transitions, 5 changer transitions 0/222 dead transitions. [2025-02-06 09:25:29,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 222 transitions, 614 flow [2025-02-06 09:25:29,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1082 transitions. [2025-02-06 09:25:29,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8426791277258567 [2025-02-06 09:25:29,911 INFO L175 Difference]: Start difference. First operand has 200 places, 200 transitions, 472 flow. Second operand 6 states and 1082 transitions. [2025-02-06 09:25:29,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 222 transitions, 614 flow [2025-02-06 09:25:29,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 222 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:25:29,916 INFO L231 Difference]: Finished difference. Result has 206 places, 202 transitions, 482 flow [2025-02-06 09:25:29,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=482, PETRI_PLACES=206, PETRI_TRANSITIONS=202} [2025-02-06 09:25:29,917 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, 5 predicate places. [2025-02-06 09:25:29,917 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 202 transitions, 482 flow [2025-02-06 09:25:29,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 173.6) internal successors, (868), 5 states have internal predecessors, (868), 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:25:29,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:29,918 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:29,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:25:29,918 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:25:29,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:29,919 INFO L85 PathProgramCache]: Analyzing trace with hash 572120286, now seen corresponding path program 1 times [2025-02-06 09:25:29,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:29,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351373266] [2025-02-06 09:25:29,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:29,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:29,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 09:25:29,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 09:25:29,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:29,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:29,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:25:29,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 09:25:29,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 09:25:29,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:29,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:29,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:25:29,951 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:25:29,951 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-06 09:25:29,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-02-06 09:25:29,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-02-06 09:25:29,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-02-06 09:25:29,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-02-06 09:25:29,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-02-06 09:25:29,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-02-06 09:25:29,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-02-06 09:25:29,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-02-06 09:25:29,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-02-06 09:25:29,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:25:29,952 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 09:25:29,952 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:25:29,952 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 09:25:29,969 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:25:29,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 247 transitions, 521 flow [2025-02-06 09:25:30,005 INFO L124 PetriNetUnfolderBase]: 52/671 cut-off events. [2025-02-06 09:25:30,005 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 09:25:30,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 671 events. 52/671 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3001 event pairs, 1 based on Foata normal form. 0/584 useless extension candidates. Maximal degree in co-relation 467. Up to 12 conditions per place. [2025-02-06 09:25:30,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 247 transitions, 521 flow [2025-02-06 09:25:30,011 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 247 transitions, 521 flow [2025-02-06 09:25:30,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:25:30,012 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;@d4205e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:25:30,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-06 09:25:30,014 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:25:30,014 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-02-06 09:25:30,014 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:25:30,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:30,014 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] [2025-02-06 09:25:30,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:25:30,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:30,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1086056757, now seen corresponding path program 1 times [2025-02-06 09:25:30,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:30,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190516551] [2025-02-06 09:25:30,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:30,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:30,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:25:30,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:25:30,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:30,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:30,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:30,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190516551] [2025-02-06 09:25:30,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190516551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:30,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:30,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:30,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464826224] [2025-02-06 09:25:30,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:30,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:25:30,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:30,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:25:30,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:25:30,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 247 [2025-02-06 09:25:30,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 247 transitions, 521 flow. Second operand has 6 states, 6 states have (on average 185.5) internal successors, (1113), 6 states have internal predecessors, (1113), 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:25:30,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:30,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 247 [2025-02-06 09:25:30,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:32,617 INFO L124 PetriNetUnfolderBase]: 7922/30415 cut-off events. [2025-02-06 09:25:32,617 INFO L125 PetriNetUnfolderBase]: For 613/615 co-relation queries the response was YES. [2025-02-06 09:25:32,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42190 conditions, 30415 events. 7922/30415 cut-off events. For 613/615 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 387674 event pairs, 3084 based on Foata normal form. 8249/35792 useless extension candidates. Maximal degree in co-relation 6661. Up to 8671 conditions per place. [2025-02-06 09:25:32,755 INFO L140 encePairwiseOnDemand]: 223/247 looper letters, 84 selfloop transitions, 5 changer transitions 0/270 dead transitions. [2025-02-06 09:25:32,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 270 transitions, 745 flow [2025-02-06 09:25:32,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:32,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1260 transitions. [2025-02-06 09:25:32,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502024291497976 [2025-02-06 09:25:32,759 INFO L175 Difference]: Start difference. First operand has 231 places, 247 transitions, 521 flow. Second operand 6 states and 1260 transitions. [2025-02-06 09:25:32,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 270 transitions, 745 flow [2025-02-06 09:25:32,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 270 transitions, 745 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:32,762 INFO L231 Difference]: Finished difference. Result has 229 places, 222 transitions, 481 flow [2025-02-06 09:25:32,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=481, PETRI_PLACES=229, PETRI_TRANSITIONS=222} [2025-02-06 09:25:32,763 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, -2 predicate places. [2025-02-06 09:25:32,763 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 222 transitions, 481 flow [2025-02-06 09:25:32,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.5) internal successors, (1113), 6 states have internal predecessors, (1113), 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:25:32,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:32,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:32,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:25:32,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:25:32,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:32,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1860335602, now seen corresponding path program 1 times [2025-02-06 09:25:32,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:32,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002997657] [2025-02-06 09:25:32,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:32,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:32,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:25:32,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:25:32,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:32,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:32,788 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:25:32,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:32,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002997657] [2025-02-06 09:25:32,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002997657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:32,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:32,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274681247] [2025-02-06 09:25:32,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:32,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:32,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:32,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:32,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:32,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 247 [2025-02-06 09:25:32,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 222 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 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:25:32,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:32,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 247 [2025-02-06 09:25:32,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:34,214 INFO L124 PetriNetUnfolderBase]: 3966/16088 cut-off events. [2025-02-06 09:25:34,215 INFO L125 PetriNetUnfolderBase]: For 678/678 co-relation queries the response was YES. [2025-02-06 09:25:34,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22296 conditions, 16088 events. 3966/16088 cut-off events. For 678/678 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 189241 event pairs, 3526 based on Foata normal form. 1/14552 useless extension candidates. Maximal degree in co-relation 14081. Up to 5780 conditions per place. [2025-02-06 09:25:34,366 INFO L140 encePairwiseOnDemand]: 244/247 looper letters, 33 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2025-02-06 09:25:34,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 227 transitions, 563 flow [2025-02-06 09:25:34,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2025-02-06 09:25:34,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2025-02-06 09:25:34,368 INFO L175 Difference]: Start difference. First operand has 229 places, 222 transitions, 481 flow. Second operand 3 states and 624 transitions. [2025-02-06 09:25:34,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 227 transitions, 563 flow [2025-02-06 09:25:34,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 227 transitions, 551 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:25:34,372 INFO L231 Difference]: Finished difference. Result has 227 places, 223 transitions, 483 flow [2025-02-06 09:25:34,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=483, PETRI_PLACES=227, PETRI_TRANSITIONS=223} [2025-02-06 09:25:34,373 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, -4 predicate places. [2025-02-06 09:25:34,373 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 223 transitions, 483 flow [2025-02-06 09:25:34,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 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:25:34,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:34,374 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] [2025-02-06 09:25:34,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:25:34,374 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:25:34,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash -925509293, now seen corresponding path program 1 times [2025-02-06 09:25:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:34,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993458714] [2025-02-06 09:25:34,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:34,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 09:25:34,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 09:25:34,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:34,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:34,408 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:25:34,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:34,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993458714] [2025-02-06 09:25:34,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993458714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:34,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:34,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:34,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120222319] [2025-02-06 09:25:34,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:34,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:34,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:34,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:34,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:34,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 247 [2025-02-06 09:25:34,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 223 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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:25:34,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:34,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 247 [2025-02-06 09:25:34,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:41,719 INFO L124 PetriNetUnfolderBase]: 27408/82878 cut-off events. [2025-02-06 09:25:41,720 INFO L125 PetriNetUnfolderBase]: For 2799/4667 co-relation queries the response was YES. [2025-02-06 09:25:41,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122686 conditions, 82878 events. 27408/82878 cut-off events. For 2799/4667 co-relation queries the response was YES. Maximal size of possible extension queue 1678. Compared 1104090 event pairs, 10807 based on Foata normal form. 41/74915 useless extension candidates. Maximal degree in co-relation 122628. Up to 25328 conditions per place. [2025-02-06 09:25:42,233 INFO L140 encePairwiseOnDemand]: 232/247 looper letters, 60 selfloop transitions, 10 changer transitions 0/252 dead transitions. [2025-02-06 09:25:42,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 252 transitions, 702 flow [2025-02-06 09:25:42,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2025-02-06 09:25:42,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502024291497976 [2025-02-06 09:25:42,235 INFO L175 Difference]: Start difference. First operand has 227 places, 223 transitions, 483 flow. Second operand 3 states and 630 transitions. [2025-02-06 09:25:42,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 252 transitions, 702 flow [2025-02-06 09:25:42,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 252 transitions, 700 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:25:42,240 INFO L231 Difference]: Finished difference. Result has 228 places, 229 transitions, 555 flow [2025-02-06 09:25:42,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=555, PETRI_PLACES=228, PETRI_TRANSITIONS=229} [2025-02-06 09:25:42,241 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, -3 predicate places. [2025-02-06 09:25:42,241 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 229 transitions, 555 flow [2025-02-06 09:25:42,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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:25:42,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:42,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:42,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:25:42,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:25:42,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash -365031861, now seen corresponding path program 1 times [2025-02-06 09:25:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:42,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233882991] [2025-02-06 09:25:42,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:42,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:42,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 09:25:42,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 09:25:42,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:42,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:42,294 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:25:42,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:42,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233882991] [2025-02-06 09:25:42,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233882991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:42,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:42,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:42,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332434258] [2025-02-06 09:25:42,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:42,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:25:42,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:42,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:25:42,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:25:42,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 247 [2025-02-06 09:25:42,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 229 transitions, 555 flow. Second operand has 5 states, 5 states have (on average 195.6) internal successors, (978), 5 states have internal predecessors, (978), 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:25:42,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:42,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 247 [2025-02-06 09:25:42,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:49,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][132], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 143#L715-2true, Black: 244#true, 31#L715-8true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 218#L715-2true, 228#true, 232#true, 10#L708true]) [2025-02-06 09:25:49,279 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-02-06 09:25:49,279 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-02-06 09:25:49,279 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-02-06 09:25:49,279 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-02-06 09:25:49,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 141#L715-2true, 143#L715-2true, Black: 244#true, 102#L715-9true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 228#true, 232#true, 10#L708true]) [2025-02-06 09:25:49,279 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2025-02-06 09:25:49,279 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:25:49,279 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:25:49,279 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-06 09:25:49,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 162#L715-8true, 141#L715-2true, 143#L715-2true, Black: 244#true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 228#true, 232#true, 10#L708true]) [2025-02-06 09:25:49,279 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-02-06 09:25:49,279 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-02-06 09:25:49,279 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-02-06 09:25:49,279 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-02-06 09:25:49,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][132], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 143#L715-2true, Black: 244#true, 31#L715-8true, 249#true, 218#L715-2true, 230#true, 176#ULTIMATE.startFINALtrue, 246#(= |#race~glob~0| 0), 228#true, 232#true]) [2025-02-06 09:25:49,334 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2025-02-06 09:25:49,334 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-06 09:25:49,334 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:25:49,334 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:25:49,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 141#L715-2true, 143#L715-2true, Black: 244#true, 102#L715-9true, 249#true, 230#true, 176#ULTIMATE.startFINALtrue, 246#(= |#race~glob~0| 0), 228#true, 232#true]) [2025-02-06 09:25:49,334 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-02-06 09:25:49,334 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-02-06 09:25:49,334 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-02-06 09:25:49,334 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-02-06 09:25:49,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 141#L715-2true, 162#L715-8true, 143#L715-2true, Black: 244#true, 249#true, 230#true, 176#ULTIMATE.startFINALtrue, 246#(= |#race~glob~0| 0), 228#true, 232#true]) [2025-02-06 09:25:49,334 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2025-02-06 09:25:49,334 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:25:49,334 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:25:49,334 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-06 09:25:49,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][132], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 244#true, 123#L716true, 31#L715-8true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 218#L715-2true, 228#true, 232#true, 10#L708true]) [2025-02-06 09:25:49,425 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-02-06 09:25:49,425 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-02-06 09:25:49,425 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-02-06 09:25:49,425 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-02-06 09:25:49,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 141#L715-2true, Black: 244#true, 102#L715-9true, 123#L716true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 228#true, 232#true, 10#L708true]) [2025-02-06 09:25:49,425 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-02-06 09:25:49,425 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-02-06 09:25:49,425 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-02-06 09:25:49,425 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-02-06 09:25:49,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 162#L715-8true, 141#L715-2true, Black: 244#true, 123#L716true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 228#true, 232#true, 10#L708true]) [2025-02-06 09:25:49,425 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-02-06 09:25:49,425 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-02-06 09:25:49,426 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-02-06 09:25:49,426 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-02-06 09:25:49,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][132], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 244#true, 123#L716true, 31#L715-8true, 249#true, 230#true, 176#ULTIMATE.startFINALtrue, 218#L715-2true, 246#(= |#race~glob~0| 0), 228#true, 232#true]) [2025-02-06 09:25:49,470 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-02-06 09:25:49,470 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-02-06 09:25:49,470 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-02-06 09:25:49,470 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-02-06 09:25:49,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 141#L715-2true, Black: 244#true, 102#L715-9true, 123#L716true, 249#true, 230#true, 176#ULTIMATE.startFINALtrue, 246#(= |#race~glob~0| 0), 228#true, 232#true]) [2025-02-06 09:25:49,470 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2025-02-06 09:25:49,470 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-02-06 09:25:49,470 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-02-06 09:25:49,470 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-02-06 09:25:49,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 162#L715-8true, 141#L715-2true, Black: 244#true, 123#L716true, 249#true, 230#true, 176#ULTIMATE.startFINALtrue, 246#(= |#race~glob~0| 0), 228#true, 232#true]) [2025-02-06 09:25:49,470 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-02-06 09:25:49,470 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-02-06 09:25:49,471 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-02-06 09:25:49,471 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-02-06 09:25:49,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][132], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 143#L715-2true, Black: 244#true, 12#L709-36true, 31#L715-8true, 249#true, 230#true, 218#L715-2true, 246#(= |#race~glob~0| 0), 228#true, 232#true]) [2025-02-06 09:25:49,472 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-02-06 09:25:49,472 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-02-06 09:25:49,472 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-02-06 09:25:49,472 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-02-06 09:25:49,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 141#L715-2true, 143#L715-2true, Black: 244#true, 12#L709-36true, 102#L715-9true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 228#true, 232#true]) [2025-02-06 09:25:49,472 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2025-02-06 09:25:49,472 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-02-06 09:25:49,473 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-02-06 09:25:49,473 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-02-06 09:25:49,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 162#L715-8true, 141#L715-2true, 143#L715-2true, Black: 244#true, 12#L709-36true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 228#true, 232#true]) [2025-02-06 09:25:49,473 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-02-06 09:25:49,473 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-02-06 09:25:49,473 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-02-06 09:25:49,473 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-02-06 09:25:49,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][198], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 143#L715-2true, Black: 244#true, 135#L715-9true, 102#L715-9true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 97#L709-33true, 228#true, 232#true]) [2025-02-06 09:25:49,512 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-02-06 09:25:49,512 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-02-06 09:25:49,512 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-02-06 09:25:49,512 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-02-06 09:25:49,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][198], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 162#L715-8true, 143#L715-2true, Black: 244#true, 135#L715-9true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 97#L709-33true, 228#true, 232#true]) [2025-02-06 09:25:49,512 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-02-06 09:25:49,512 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-06 09:25:49,512 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-06 09:25:49,512 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-02-06 09:25:49,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][198], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 143#L715-2true, Black: 244#true, 102#L715-9true, 31#L715-8true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 97#L709-33true, 228#true, 232#true]) [2025-02-06 09:25:49,513 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-02-06 09:25:49,513 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-06 09:25:49,513 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-02-06 09:25:49,513 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-02-06 09:25:49,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][198], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 162#L715-8true, 143#L715-2true, Black: 244#true, 31#L715-8true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 97#L709-33true, 228#true, 232#true]) [2025-02-06 09:25:49,513 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-02-06 09:25:49,513 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-06 09:25:49,513 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-02-06 09:25:49,513 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-02-06 09:25:49,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][132], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 244#true, 12#L709-36true, 123#L716true, 31#L715-8true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 218#L715-2true, 228#true, 232#true]) [2025-02-06 09:25:49,584 INFO L294 olderBase$Statistics]: this new event has 194 ancestors and is cut-off event [2025-02-06 09:25:49,584 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-02-06 09:25:49,584 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-02-06 09:25:49,584 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-02-06 09:25:49,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 141#L715-2true, Black: 244#true, 12#L709-36true, 102#L715-9true, 123#L716true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 228#true, 232#true]) [2025-02-06 09:25:49,584 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-02-06 09:25:49,584 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-06 09:25:49,585 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-06 09:25:49,585 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-02-06 09:25:49,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 141#L715-2true, 162#L715-8true, Black: 244#true, 12#L709-36true, 123#L716true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 228#true, 232#true]) [2025-02-06 09:25:49,585 INFO L294 olderBase$Statistics]: this new event has 194 ancestors and is cut-off event [2025-02-06 09:25:49,585 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-02-06 09:25:49,585 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-02-06 09:25:49,585 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-02-06 09:25:49,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][132], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 227#true, Black: 244#true, 31#L715-8true, 11#L722-3true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 218#L715-2true, 232#true]) [2025-02-06 09:25:49,615 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-02-06 09:25:49,615 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-06 09:25:49,615 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-06 09:25:49,615 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-02-06 09:25:49,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 227#true, 141#L715-2true, Black: 244#true, 102#L715-9true, 249#true, 11#L722-3true, 230#true, 246#(= |#race~glob~0| 0), 232#true]) [2025-02-06 09:25:49,615 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is cut-off event [2025-02-06 09:25:49,615 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-02-06 09:25:49,615 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-02-06 09:25:49,615 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-02-06 09:25:49,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 227#true, 141#L715-2true, 162#L715-8true, Black: 244#true, 249#true, 11#L722-3true, 230#true, 246#(= |#race~glob~0| 0), 232#true]) [2025-02-06 09:25:49,615 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-02-06 09:25:49,615 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-06 09:25:49,615 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-02-06 09:25:49,616 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-02-06 09:25:49,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][198], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 244#true, 135#L715-9true, 102#L715-9true, 123#L716true, 249#true, 230#true, 97#L709-33true, 246#(= |#race~glob~0| 0), 228#true, 232#true]) [2025-02-06 09:25:49,616 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-02-06 09:25:49,616 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-02-06 09:25:49,616 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-02-06 09:25:49,616 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-02-06 09:25:49,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][198], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 162#L715-8true, Black: 244#true, 135#L715-9true, 123#L716true, 249#true, 230#true, 97#L709-33true, 246#(= |#race~glob~0| 0), 228#true, 232#true]) [2025-02-06 09:25:49,617 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-02-06 09:25:49,617 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-02-06 09:25:49,617 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-02-06 09:25:49,617 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-02-06 09:25:49,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][198], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 244#true, 102#L715-9true, 123#L716true, 31#L715-8true, 249#true, 230#true, 97#L709-33true, 246#(= |#race~glob~0| 0), 228#true, 232#true]) [2025-02-06 09:25:49,617 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-02-06 09:25:49,617 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-02-06 09:25:49,617 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-02-06 09:25:49,617 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-02-06 09:25:49,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][198], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 162#L715-8true, Black: 244#true, 123#L716true, 31#L715-8true, 249#true, 230#true, 246#(= |#race~glob~0| 0), 97#L709-33true, 228#true, 232#true]) [2025-02-06 09:25:49,617 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2025-02-06 09:25:49,617 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-06 09:25:49,617 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:25:49,617 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:25:50,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][132], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 227#true, Black: 244#true, 31#L715-8true, 249#true, 230#true, 176#ULTIMATE.startFINALtrue, 246#(= |#race~glob~0| 0), 218#L715-2true, 232#true]) [2025-02-06 09:25:50,022 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2025-02-06 09:25:50,022 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-02-06 09:25:50,022 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-06 09:25:50,022 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-06 09:25:50,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 227#true, 141#L715-2true, Black: 244#true, 102#L715-9true, 249#true, 230#true, 176#ULTIMATE.startFINALtrue, 246#(= |#race~glob~0| 0), 232#true]) [2025-02-06 09:25:50,023 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-02-06 09:25:50,023 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-06 09:25:50,023 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-02-06 09:25:50,023 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-02-06 09:25:50,023 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][193], [Black: 242#(= |ULTIMATE.start_main_~i~1#1| 0), 227#true, 162#L715-8true, 141#L715-2true, Black: 244#true, 249#true, 230#true, 176#ULTIMATE.startFINALtrue, 246#(= |#race~glob~0| 0), 232#true]) [2025-02-06 09:25:50,023 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2025-02-06 09:25:50,023 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-02-06 09:25:50,023 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-06 09:25:50,023 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-06 09:25:50,120 INFO L124 PetriNetUnfolderBase]: 17529/84577 cut-off events. [2025-02-06 09:25:50,120 INFO L125 PetriNetUnfolderBase]: For 4463/4537 co-relation queries the response was YES. [2025-02-06 09:25:50,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115326 conditions, 84577 events. 17529/84577 cut-off events. For 4463/4537 co-relation queries the response was YES. Maximal size of possible extension queue 1297. Compared 1278874 event pairs, 6187 based on Foata normal form. 5/77076 useless extension candidates. Maximal degree in co-relation 25019. Up to 20381 conditions per place. [2025-02-06 09:25:50,763 INFO L140 encePairwiseOnDemand]: 242/247 looper letters, 52 selfloop transitions, 5 changer transitions 0/253 dead transitions. [2025-02-06 09:25:50,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 253 transitions, 719 flow [2025-02-06 09:25:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1222 transitions. [2025-02-06 09:25:50,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8245614035087719 [2025-02-06 09:25:50,771 INFO L175 Difference]: Start difference. First operand has 228 places, 229 transitions, 555 flow. Second operand 6 states and 1222 transitions. [2025-02-06 09:25:50,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 253 transitions, 719 flow [2025-02-06 09:25:50,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 253 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:25:50,796 INFO L231 Difference]: Finished difference. Result has 234 places, 232 transitions, 567 flow [2025-02-06 09:25:50,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=567, PETRI_PLACES=234, PETRI_TRANSITIONS=232} [2025-02-06 09:25:50,798 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 3 predicate places. [2025-02-06 09:25:50,798 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 232 transitions, 567 flow [2025-02-06 09:25:50,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 195.6) internal successors, (978), 5 states have internal predecessors, (978), 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:25:50,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:50,799 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:50,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:25:50,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:25:50,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:50,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1798692761, now seen corresponding path program 1 times [2025-02-06 09:25:50,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:50,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144908491] [2025-02-06 09:25:50,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:50,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:50,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 09:25:50,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 09:25:50,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:50,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:50,842 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:25:50,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:50,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144908491] [2025-02-06 09:25:50,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144908491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:50,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:50,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:50,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633931412] [2025-02-06 09:25:50,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:50,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:50,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:50,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:50,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:50,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 247 [2025-02-06 09:25:50,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 232 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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:25:50,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:50,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 247 [2025-02-06 09:25:50,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:01,676 INFO L124 PetriNetUnfolderBase]: 28122/119295 cut-off events. [2025-02-06 09:26:01,677 INFO L125 PetriNetUnfolderBase]: For 1437/1437 co-relation queries the response was YES. [2025-02-06 09:26:02,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164940 conditions, 119295 events. 28122/119295 cut-off events. For 1437/1437 co-relation queries the response was YES. Maximal size of possible extension queue 2352. Compared 1880136 event pairs, 16827 based on Foata normal form. 242/108632 useless extension candidates. Maximal degree in co-relation 164802. Up to 22645 conditions per place. [2025-02-06 09:26:02,657 INFO L140 encePairwiseOnDemand]: 244/247 looper letters, 47 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2025-02-06 09:26:02,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 251 transitions, 703 flow [2025-02-06 09:26:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:02,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 638 transitions. [2025-02-06 09:26:02,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8609986504723347 [2025-02-06 09:26:02,662 INFO L175 Difference]: Start difference. First operand has 234 places, 232 transitions, 567 flow. Second operand 3 states and 638 transitions. [2025-02-06 09:26:02,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 251 transitions, 703 flow [2025-02-06 09:26:02,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 251 transitions, 697 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 09:26:02,667 INFO L231 Difference]: Finished difference. Result has 235 places, 233 transitions, 573 flow [2025-02-06 09:26:02,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=235, PETRI_TRANSITIONS=233} [2025-02-06 09:26:02,668 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places. [2025-02-06 09:26:02,668 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 233 transitions, 573 flow [2025-02-06 09:26:02,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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:26:02,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:02,668 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:26:02,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:26:02,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:26:02,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:02,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2051435383, now seen corresponding path program 1 times [2025-02-06 09:26:02,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:02,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213827832] [2025-02-06 09:26:02,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:02,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:02,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 09:26:02,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 09:26:02,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:02,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:02,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:26:02,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 09:26:02,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 09:26:02,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:02,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:02,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:26:02,708 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:26:02,708 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-06 09:26:02,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-02-06 09:26:02,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-02-06 09:26:02,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-02-06 09:26:02,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-02-06 09:26:02,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-02-06 09:26:02,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-02-06 09:26:02,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-02-06 09:26:02,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-02-06 09:26:02,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-02-06 09:26:02,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-02-06 09:26:02,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:26:02,709 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 09:26:02,709 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:26:02,709 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 09:26:02,736 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 09:26:02,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 280 transitions, 600 flow [2025-02-06 09:26:02,826 INFO L124 PetriNetUnfolderBase]: 77/971 cut-off events. [2025-02-06 09:26:02,826 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-06 09:26:02,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 971 events. 77/971 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4741 event pairs, 6 based on Foata normal form. 0/849 useless extension candidates. Maximal degree in co-relation 691. Up to 32 conditions per place. [2025-02-06 09:26:02,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 280 transitions, 600 flow [2025-02-06 09:26:02,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 280 transitions, 600 flow [2025-02-06 09:26:02,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:26:02,844 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;@d4205e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:26:02,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-06 09:26:02,848 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:26:02,848 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-02-06 09:26:02,849 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:26:02,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:02,849 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] [2025-02-06 09:26:02,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:26:02,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:02,849 INFO L85 PathProgramCache]: Analyzing trace with hash -238467019, now seen corresponding path program 1 times [2025-02-06 09:26:02,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:02,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834961969] [2025-02-06 09:26:02,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:02,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:02,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:26:02,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:26:02,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:02,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:03,046 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:26:03,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834961969] [2025-02-06 09:26:03,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834961969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:03,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:03,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:26:03,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488932990] [2025-02-06 09:26:03,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:03,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:26:03,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:03,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:26:03,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:26:03,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 280 [2025-02-06 09:26:03,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 280 transitions, 600 flow. Second operand has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 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:26:03,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:03,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 280 [2025-02-06 09:26:03,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand